|
Von Neumann–Bernays–Gödel Set Theory
In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of Zermelo–Fraenkel–choice set theory (ZFC). NBG introduces the notion of class, which is a collection of sets defined by a formula whose quantifiers range only over sets. NBG can define classes that are larger than sets, such as the class of all sets and the class of all ordinals. Morse–Kelley set theory (MK) allows classes to be defined by formulas whose quantifiers range over classes. NBG is finitely axiomatizable, while ZFC and MK are not. A key theorem of NBG is the class existence theorem, which states that for every formula whose quantifiers range only over sets, there is a class consisting of the sets satisfying the formula. This class is built by mirroring the step-by-step construction of the formula with classes. Since all set-theoretic formulas are constructed from two kinds of atomic formulas (membership and equality ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Foundations Of Mathematics
Foundations of mathematics are the mathematical logic, logical and mathematics, mathematical framework that allows the development of mathematics without generating consistency, self-contradictory theories, and to have reliable concepts of theorems, proof (mathematics), proofs, algorithms, etc. in particular. This may also include the philosophy of mathematics, philosophical study of the relation of this framework with reality. The term "foundations of mathematics" was not coined before the end of the 19th century, although foundations were first established by the ancient Greek philosophers under the name of Aristotle's logic and systematically applied in Euclid's Elements, Euclid's ''Elements''. A mathematical assertion is considered as truth (mathematics), truth only if it is a theorem that is proved from true premises by means of a sequence of syllogisms (inference rules), the premises being either already proved theorems or self-evident assertions called axioms or postulat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Axiom Of Global Choice
In mathematics, specifically in class theories, the axiom of global choice is a stronger variant of the axiom of choice that applies to proper classes of sets as well as sets of sets. Informally it states that one can simultaneously choose an element from every non-empty set. Statement The axiom of global choice states that there is a global choice function τ, meaning a function such that for every non-empty set ''z'', τ(''z'') is an element of ''z''. The axiom of global choice cannot be stated directly in the language of Zermelo–Fraenkel set theory (ZF) with the axiom of choice (AC), known as ZFC, as the choice function τ is a proper class and in ZFC one cannot quantify over classes. It can be stated by adding a new function symbol τ to the language of ZFC, with the property that τ is a global choice function. This is a conservative extension of ZFC: every provable statement of this extended theory that can be stated in the language of ZFC is already provable in ZFC ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Transitive (set Theory)
In set theory, a branch of mathematics, a set A is called transitive if either of the following equivalent conditions holds: * whenever x \in A, and y \in x, then y \in A. * whenever x \in A, and x is not an urelement, then x is a subset of A. Similarly, a class M is transitive if every element of M is a subset of M. Examples Using the definition of ordinal numbers suggested by John von Neumann, ordinal numbers are defined as hereditarily transitive sets: an ordinal number is a transitive set whose members are also transitive (and thus ordinals). The class of all ordinals is a transitive class. Any of the stages V_\alpha and L_\alpha leading to the construction of the von Neumann universe V and Gödel's constructible universe L are transitive sets. The universes V and L themselves are transitive classes. This is a complete list of all finite transitive sets with up to 20 brackets: * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * \, * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Ordinal Number
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, th, etc.) aimed to extend enumeration to infinite sets. A finite set can be enumerated by successively labeling each element with the least natural number that has not been previously used. To extend this process to various infinite sets, ordinal numbers are defined more generally using linearly ordered greek letter variables that include the natural numbers and have the property that every set of ordinals has a least or "smallest" element (this is needed for giving a meaning to "the least unused element"). This more general definition allows us to define an ordinal number \omega (omega) to be the least element that is greater than every natural number, along with ordinal numbers , , etc., which are even greater than . A linear order such that every non-empty subset has a least element is called a well-order. The axiom of choice implies that every set can be well-orde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Axiom Of Global Choice
In mathematics, specifically in class theories, the axiom of global choice is a stronger variant of the axiom of choice that applies to proper classes of sets as well as sets of sets. Informally it states that one can simultaneously choose an element from every non-empty set. Statement The axiom of global choice states that there is a global choice function τ, meaning a function such that for every non-empty set ''z'', τ(''z'') is an element of ''z''. The axiom of global choice cannot be stated directly in the language of Zermelo–Fraenkel set theory (ZF) with the axiom of choice (AC), known as ZFC, as the choice function τ is a proper class and in ZFC one cannot quantify over classes. It can be stated by adding a new function symbol τ to the language of ZFC, with the property that τ is a global choice function. This is a conservative extension of ZFC: every provable statement of this extended theory that can be stated in the language of ZFC is already provable in ZFC ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Choice Function
Let ''X'' be a set of sets none of which are empty. Then a choice function (selector, selection) on ''X'' is a mathematical function ''f'' that is defined on ''X'' such that ''f'' is a mapping that assigns each element of ''X'' to one of its elements. An example Let ''X'' = . Then the function ''f'' defined by ''f''() = 7, ''f''() = 9 and ''f''() = 2 is a choice function on ''X''. History and importance Ernst Zermelo (1904) introduced choice functions as well as the axiom of choice (AC) and proved the well-ordering theorem, which states that every set can be well-ordered. AC states that every set of nonempty sets has a choice function. A weaker form of AC, the axiom of countable choice (ACω) states that every countable set of nonempty sets has a choice function. However, in the absence of either AC or ACω, some sets can still be shown to have a choice function. *If X is a finite set of nonempty sets, then one can construct a choice function for X by picking on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Generalized Continuum Hypothesis
In mathematics, specifically set theory, the continuum hypothesis (abbreviated CH) is a hypothesis about the possible sizes of infinite sets. It states: Or equivalently: In Zermelo–Fraenkel set theory with the axiom of choice (ZFC), this is equivalent to the following equation in aleph numbers: 2^=\aleph_1, or even shorter with beth numbers: \beth_1 = \aleph_1. The continuum hypothesis was advanced by Georg Cantor in 1878, and establishing its truth or falsehood is the first of Hilbert's 23 problems presented in 1900. The answer to this problem is independent of ZFC, so that either the continuum hypothesis or its negation can be added as an axiom to ZFC set theory, with the resulting theory being consistent if and only if ZFC is consistent. This independence was proved in 1963 by Paul Cohen, complementing earlier work by Kurt Gödel in 1940. The name of the hypothesis comes from the term '' continuum'' for the real numbers. History Cantor believed the continuum hy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
