Constructible universe

Definition

In mathematics, in set theory, the constructible universe, denoted by is a particular class of sets that can be described entirely in terms of simpler sets. is the union of the constructible hierarchy . It was introduced by Kurt Gödel in his 1938 paper "The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis". In this paper, he proved that the constructible universe is an inner model of ZF set theory, and also that the axiom of choice and the generalized continuum hypothesis are true in the constructible universe. This shows that both propositions are consistent with the basic axioms of set theory, if ZF itself is consistent. Since many other theorems only hold in systems in which one or both of the propositions is true, their consistency is an important result.

Related concepts

Abraham Fraenkel Abstract logic Ackermann set theory Aleph number Algebraic logic Almost Alphabet (formal languages)Alternative set theory Amorphous set Argument Arithmetical hierarchy Arity Atomic formula Atomic model (mathematical logic)Atomic sentence Automata theory Automated theorem proving Axiom Axiom of adjunction Axiom of choice Axiom of constructibility Axiom of countable choice Axiom of dependent choice Axiom of determinacy Axiom of empty set Axiom of extensionality Axiom of global choice Axiom of infinity Axiom of limitation of size Axiom of pairing Axiom of power set Axiom of projective determinacy Axiom of regularity Axiom of replacement Axiom of separation Axiom of union Axiom schema Axiom schema of replacement Axiom schema of specification Axiomatic set theory Axiomatic system Axiomatization of Boolean algebras Banach–Tarski paradox Bertrand Russell Bijection Binary operation Boolean algebra Boolean algebras canonically defined Boolean function Bounded quantifiers Burali-Forti paradox Cantor's diagonal argument Cantor's paradox Cantor's theorem Cardinal number Cardinality Cartesian product Categorical theory Category (mathematics)Category of sets Category theory Church encoding Church–Kleene ordinal Church–Turing thesis Class (set theory)Classical logic Club set Codomain Compactness theorem Complement (set theory)Complete theory Computability theory Computable function Computable set Computably enumerable set Concrete category Condensation lemma Conservative extension Consistency Consistent Construction of the real numbers Constructive set theory Continuum hypothesis Countable set De Morgan's laws Decidability (logic)Decision problem Dedekind-infinite set Deductive system Descriptive set theory Diagram (mathematical logic)Disjoint union Domain of a function Element (mathematics)Elementary diagram Elementary embedding Elementary equivalence Elementary function arithmetic Empty set Enumeration Equiconsistency Equinumerous Equivalence relation Ernst Zermelo Euclid's Elements Euclidean geometry Existential quantification Expression (mathematics)Extension by definitions Extension by new constant and function names Extensionality Family of sets Filter on a set Finitary relation Finite-valued logic Finite model theory Finite set First-order logic Fixed-point logic Forcing (mathematics)Formal grammar Formal language Formal proof Formal semantics (logic)Formal system Formation rule Formula (mathematical logic)Foundations of geometry Foundations of mathematics Free logic Free variables and bound variables Function (mathematics)Functional predicate Fuzzy set General set theory Generalized continuum hypothesis Georg Cantor Grothendieck universe Ground expression Ground formula Gödel's completeness theorem Gödel's incompleteness theorems Gödel metric Gödel numbering Gödel operation Halting problem Hereditarily countable set Hereditarily finite set Hereditary set Higher-order logic Hilbert's axioms Hilbert system History of logic History of mathematical logic Hyperarithmetical hierarchy Image (mathematics)Inaccessible cardinal Independence (mathematical logic)Indiscernible Indiscernibles Inference Infinite-valued logic Infinite set Information theory Inhabited set Initial ordinal Injective function Inner model Interpretation (logic)Interpretation (model theory)Interpretation function Intersection (set theory)Isomorphism John von Neumann Jon Barwise Keith Devlin Kolmogorov complexity Kripke's theory of truth Kripke–Platek set theory Kurt Gödel L(R)Lambda calculus Large cardinal Lemma (mathematics)Lexicographic ordering Limit cardinal Limit ordinal Lindström's theorem List of Hilbert systems List of axioms List of first-order theories List of formal systems List of large cardinal properties List of mathematical theories List of set identities and relations List of statements independent of ZFC Logic Logical biconditional Logical conjunction Logical connective Logical consequence Logical constant Logical disjunction Logical equality Logical equivalence Logical truth Logicism Lévy hierarchy Löwenheim–Skolem theorem Mahlo cardinal Many-valued logic Map (mathematics)Martin's axiom Material conditional Mathematical logic Mathematical object Mathematics Measurable cardinal Metalanguage Minimal axioms for Boolean algebra Minimal model (set theory)Model complete theory Model theory Monadic predicate calculus Monadic second-order logic Morse–Kelley set theory Mostowski collapse lemma NP (complexity)Naive set theory Natural deduction Negation New Foundations Non-Euclidean geometry Non-logical symbol Non-standard model Non-standard model of arithmetic Open formula Operation (mathematics)Ordered pair Ordinal analysis Ordinal definable Ordinal number P (complexity)P versus NP problem Paradoxes of set theory Parameters Partition of a set Paul Bernays Paul Cohen Peano axioms Philosophy of mathematics Piergiorgio Odifreddi Power set Predicate (mathematical logic)Predicate logic Predicate variable Prime model Primitive recursive arithmetic Primitive recursive function Principia Mathematica Proceedings of the National Academy of Sciences of the United States of America Proof of impossibility Proof theory Proposition Propositional calculus Propositional formula Propositional variable Quantifier (logic)Quantifier rank Recursion Recursive set Reflection principle Regular ordinal Relation (mathematics)Reverse mathematics Richard Dedekind Robinson arithmetic Ronald Jensen Rule of inference Russell's paradox Satisfiability Saturated model Schröder–Bernstein theorem Second-order arithmetic Second-order logic Self-verifying theories Semantic theory of truth Semantics of logic Sentence (mathematical logic)Sequent calculus Set-builder notation Set (mathematics)Set theory Signature (logic)Singleton (mathematics)Skolem arithmetic Soundness Spectrum of a sentence Spectrum of a theory Square of opposition Statements true in L Strength (mathematical logic)String (formal languages)Structure (mathematical logic)Subset Substitution (logic)Substructure (mathematics)Successor ordinal Supertask Surjective function Suslin's problem Syllogism Symbol (formal)Symmetric difference Syntax (logic)T-schema Tarski's axiomatization of the reals Tarski's axioms Tarski's theory of truth Tarski's undefinability theorem Tarski–Grothendieck set theory Tautology (logic)Term (logic)Term logic Theorem Theories of truth Theory (mathematical logic)Thomas Jech Thoralf Skolem Three-valued logic Timeline of mathematical logic Transfer principle Transfinite induction Transfinite recursion Transitive class Transitive closure (set)Transitive model Transitive set True arithmetic Truth predicate Truth table Truth value Tuple Turing machine Type (model theory)Type theory Ultrafilter (set theory)Ultrafilter on a set Ultraproduct Uncountable set Undecidable problem Uninterpreted function Union (set theory)Uniqueness quantification Universal quantification Universal set Universe (mathematics)Urelement Validity (logic)Variable (mathematics)Venn diagram Von Neumann universe Von Neumann–Bernays–Gödel set theory Well-formed formula Well-founded relation Willard Van Orman Quine Zermelo set theory Zermelo–Fraenkel set theory Zero sharp

143 concepts already in your glossary