35 relations: Axiom of constructibility, Baire space (set theory), Cardinal number, Cardinality, Chang's conjecture, Cofinal (mathematics), Cofinality, Constructible universe, Donald A. Martin, Erdős cardinal, Forcing (mathematics), Gödel numbering, Generic filter, Hereditarily finite set, Indiscernibles, Ineffable cardinal, Jack Silver, Jensen's covering theorem, Large cardinal, Leo Harrington, Lightface analytic game, Measurable cardinal, Ramsey cardinal, Regular cardinal, Robert M. Solovay, Ronald Jensen, Set theory, Springer Science+Business Media, Tarski's undefinability theorem, Transactions of the American Mathematical Society, Turing degree, Uncountable set, Well-formed formula, Zermelo–Fraenkel set theory, Zero dagger.
The axiom of constructibility is a possible axiom for set theory in mathematics that asserts that every set is constructible.
In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets.
In mathematics, the cardinality of a set is a measure of the "number of elements of the set".
In model theory, a branch of mathematical logic, Chang's conjecture, attributed to Chen Chung Chang by, states that every model of type (ω2,ω1) for a countable language has an elementary submodel of type (ω1, ω).
In mathematics, let A be a set and let ≤ be a binary relation on A. Then a subset B of A is said to be cofinal if it satisfies the following condition: This definition is most commonly applied when A is a partially ordered set or directed set under the relation ≤. Cofinal subsets are very important in the theory of directed sets and nets, where “cofinal subnet” is the appropriate generalization of “subsequence”.
In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A. This definition of cofinality relies on the axiom of choice, as it uses the fact that every non-empty set of cardinal numbers has a least member.
In mathematics, in set theory, the constructible universe (or Gödel's constructible universe), denoted L, is a particular class of sets that can be described entirely in terms of simpler sets.
Donald A. Martin (born December 24, 1940), also known as Tony Martin, is an American set theorist and philosopher of mathematics at UCLA, where he is a member of the faculty of mathematics and philosophy.
In mathematics, an Erdős cardinal, also called a partition cardinal is a certain kind of large cardinal number introduced by.
In the mathematical discipline of set theory, forcing is a technique for proving consistency and independence results.
In mathematical logic, a Gödel numbering is a function that assigns to each symbol and well-formed formula of some formal language a unique natural number, called its Gödel number.
In the mathematical field of set theory, a generic filter is a kind of object used in the theory of forcing, a technique used for many purposes, but especially to establish the independence of certain propositions from certain formal theories, such as ZFC.
In mathematics and set theory, hereditarily finite sets are defined as finite sets whose elements are all hereditarily finite sets.
In mathematical logic, indiscernibles are objects which cannot be distinguished by any property or relation defined by a formula.
In the mathematics of transfinite numbers, an ineffable cardinal is a certain kind of large cardinal number, introduced by.
Jack Howard Silver (23 April 1942 – 22 December 2016) was a set theorist and logician at the University of California, Berkeley.
In set theory, Jensen's covering theorem states that if 0# does not exist then every uncountable set of ordinals is contained in a constructible set of the same cardinality.
In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers.
Leo Anthony Harrington (born May 17, 1946) is a professor of mathematics at the University of California, Berkeley who works in recursion theory, model theory, and set theory.
In descriptive set theory, a lightface analytic game is a game whose payoff set A is a \Sigma^1_1 subset of Baire space; that is, there is a tree T on \omega\times\omega which is a computable subset of (\omega\times\omega)^.
In mathematics, a measurable cardinal is a certain kind of large cardinal number.
In mathematics, a Ramsey cardinal is a certain kind of large cardinal number introduced by and named after Frank P. Ramsey.
In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality.
Robert Martin Solovay (born December 15, 1938) is an American mathematician specializing in set theory.
Ronald Björn Jensen (born April 1, 1936) is an American mathematician active in Europe, primarily known for his work in mathematical logic and set theory.
Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1936, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics.
The Transactions of the American Mathematical Society is a monthly peer-reviewed scientific journal of mathematics published by the American Mathematical Society.
In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set.
In mathematics, an uncountable set (or uncountably infinite set) is an infinite set that contains too many elements to be countable.
In mathematics, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox.
In set theory, 0† (zero dagger) is a particular subset of the natural numbers, first defined by Robert M. Solovay in unpublished work in the 1960s.
0 sharp, 0-sharp, 0♯, Sharp (set theory), Silver indiscernible, Zero Sharp, Zero-sharp.