<--- Back to Details
First PageDocument Content
Algebraic structures / Boolean algebra / Category theory / Forcing / Heyting algebra / Functor / Complete Boolean algebra / Adjoint functors / Topos / Mathematics / Abstract algebra / Algebra
Date: 2013-10-13 15:36:04
Algebraic structures
Boolean algebra
Category theory
Forcing
Heyting algebra
Functor
Complete Boolean algebra
Adjoint functors
Topos
Mathematics
Abstract algebra
Algebra

A brief introduction to algebraic set theory∗ Steve Awodey

Add to Reading List

Source URL: www.andrew.cmu.edu

Download Document from Source Website

File Size: 185,26 KB

Share Document on Facebook

Similar Documents

Theoretical computer science / Mathematics / Computational complexity theory / Operations research / Logic in computer science / Mathematical optimization / NP-complete problems / Boolean algebra / Maximum satisfiability problem / Boolean satisfiability problem / Constraint satisfaction / Solver

On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon

DocID: 1rsZm - View Document

Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Symposium on Discrete Algorithms / Approximation algorithm / Random walk / 2-satisfiability

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

DocID: 1roWY - View Document

Mathematics / Logic / Mathematical logic / Boolean algebra / Formal languages / Semantics / Algebraic logic / Logic in computer science / Substitution / Propositional calculus / Rewriting / Negation

No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositional

DocID: 1qNTb - View Document

Theoretical computer science / Mathematical logic / Mathematics / Logic in computer science / NP-complete problems / Boolean algebra / Electronic design automation / Algebraic logic / Tseytin transformation / Boolean satisfiability problem / Conjunctive normal form / Canonical normal form

Microsoft Word - IBSdoc

DocID: 1qERD - View Document

Computational complexity theory / Complexity classes / Theory of computation / FO / PSPACE / SO / P / EXPTIME / Boolean algebra / Co-NP-complete / Reduction / Descriptive complexity theory

Introduction & Motivation Relations and Operations Boolean and 3-element cases

DocID: 1qCnb - View Document