Surrealist landscape with figures (a survey of recent results in set theory)
From MaRDI portal
Publication:754865
metric spacesurveystationary setsSouslin treesingular measurable and supercompact cardinalsSilver machinesset theories with urelementsscalesrelative consistencyprojective hierarchyNew FoundationsNeumann-Gödel-Bernays set theoryMoore spacemodels of set theoryaxiom of choicelarge cardinalsKurepa's conjectureindiscerniblesindependence resultsforcingfine structuredescriptive set theorycontinuum hypothesisconstructibilityChang's conjectureaxiom systems of set theoryaxiom of determinacy
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Descriptive set theory (03E15) Axiom of choice and related propositions (03E25) Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Continuum hypothesis and Martin's axiom (03E50) Large cardinals (03E55) Determinacy principles (03E60) Other set-theoretic hypotheses and axioms (03E65) Nonclassical and second-order set theories (03E70) Set theory (03Exx)
Cites work
- A Boolean view of sequential compactness
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
- A consequence of the axiom of choice
- A geometric form of the axiom of choice
- A model of set-theory in which every set of reals is Lebesgue measurable
- A Nonconstructible Δ 1 3 Set of Integers
- A note on a problem of Erdős and Hajnal
- A Translation of the Normal Moore Space Conjecture
- Ackermann's set theory equals ZF
- An independence result concerning the axiom of choice
- Aronszajn trees and the independence of the transfer property
- Aspects of constructibility
- Boolean extensions and measurable cardinals
- Borel determinacy
- Combinatorics on ideals and forcing
- Consistency results about ordinal definability
- Countable Paracompactness and Souslin's Problem
- Decomposable cardinals.
- Finite axioms of choice
- Forcing with trees and ordinal definability
- From accessible to inaccessible cardinals (Results holding for all accessible cardinal numbers and the problem of their extension to inaccessible ones)
- Gaps in the contructable universe
- Higher set theory and mathematical practice
- How large is the first strongly compact cardinal? or a study on identity crises
- scientific article; zbMATH DE number 3568699 (Why is no real title available?)
- scientific article; zbMATH DE number 3440435 (Why is no real title available?)
- Incompactness in languages with infinitely long expressions
- Inequalities for cardinal powers
- Infinitary compactness without strong inaccessibility
- Infinite Abelian groups, Whitehead problem and some constructions
- Intermediate submodels and generic extensions in set theory
- Internal cohen extensions
- Iterated Cohen extensions and Souslin's problem
- Lectures in set theory with particular emphasis on the method of forcing
- Limitations on the Fraenkel-Mostowski method of independence proofs
- Long projective wellorderings
- Los' Theorem and the Boolean Prime Ideal Theorem Imply the Axiom of Choice
- Measurable cardinals and \(\Delta^1_3\) well-orderings
- Measurable cardinals and the continuum hypothesis
- Measure and category in effective descriptive set theory
- Models of set theory containing many perfect sets
- Models of ZF-set theory
- Natural models and Ackermann-type set theories
- Nonregular Ultrafilters and Large Cardinals
- Normal Moore Spaces in the Constructible Universe
- Omitting Types: Application to Descriptive Set Theory
- On a problem of Gillman and Keisler
- On a theorem of Silver
- On Countably Compact, Perfectly Normal Spaces
- On projective ordinals
- On sequences generic in the sense of Prikry
- On strong compactness and supercompactness
- On successors in cardinal arithmetic
- On the consistency of a slight (?) modification of Quine's 'New Foundations'
- On the decomposition of sets of reals to borel sets
- On the relationship between weak compactness inL ω 1 ω,L ω 1 ω 1, and restricted second-order languages
- On the sequence of models HOD_n
- On Σ1 well-orderings of the universe
- One hundred and two problems in mathematical logic
- Recursive Pseudo-Well-Orderings
- Regularity of ultrafilters
- Rowbottom cardinals and Jonsson cardinals are almost the same
- Sets constructible from sequences of ultrafilters
- Some applications of iterated ultrapowers in set theory
- Some applications of model theory in set theory
- Some combinatorial problems concerning uncountable cardinals
- Some properties of \sum\nolimits₁¹- and \prod\nolimits₁¹-sets in N^N
- Some strong axioms of infinity incompatible with the axiom of constructibility
- Some weak versions of large cardinal axioms
- Strong axioms of infinity and elementary embeddings
- Strong compactness and other cardinal sins
- Support structures for the axiom of choice
- The consistency problem for NF
- The countable chain condition versus separability - applications of Martin's Axiom
- The equivalence of Boolean prime ideal theorem and a theorem of functional analysis
- The fine structure of the constructible hierarchy
- The Theory of Countable Analytical Sets
- The universal properties of Dedekind finite cardinals
- Trees
- Two theorems of functional analysis effectively equivalent to choice axioms
- Whitehead's Problem is Undecidable
- Zermelo-Fraenkel consistency results by Fraenkel-Mostowski methods
Cited in
(17)- A Souslin operation for ^1_2
- There are no P-points in Silver extensions
- Set theory and the analyst
- On the reducibility of \(\Pi_ 1^ 1\) sets
- Mathias and set theory
- Proofs of the compactness theorem
- Dependences between definitions of finiteness
- A Basis Theorem for Perfect Sets
- Singular Cardinals and the PCF Theory
- Models of set theory in which the separation theorem fails
- On the ‘definability of definable’ problem of Alfred Tarski, Part II
- Forcing the Σ31-separation property
- A Property of Arithmetic Sets
- A good lightface \(\varDelta_n^1\) well-ordering of the reals does not imply the existence of boldface \(\mathbf{\Delta}_{n - 1}^1\) well-orderings
- Independence of the comprehension schema in second-order arithmetic from the parameter-free countable choice
- Parameterfree comprehension does not imply full comprehension in second order Peano arithmetic
- On the consistency strength of accessible Jonsson cardinals and of the weak Chang conjecture
This page was built for publication: Surrealist landscape with figures (a survey of recent results in set theory)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754865)
