The fine structure of the constructible hierarchy
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
- Organic and tight
- Ordinal machines and admissible recursion theory
- Infinite combinatorics and the foundations of regular variation
- More fine structural global square sequences
- Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- S-forcing. I: a black-box theorem for morasses, with applications to super-Souslin trees
- Uncountable admissibles. II: Compactness
- Disjointness conditions for free products of -groups
- Aronszajn trees and partitions
- The basic theory of partial -recursive operators
- Corrigendum to ``Generalized Martin's axiom and Souslin's hypothesis for higher cardinals
- On the width of ordered sets and Boolean algebras
- Strong coding
- Partitioning pairs of countable ordinals
- Regularity of ultrafilters and the core model
- Minimal coding
- Number of models in \(L_{\infty,\omega_1}\) theories. II
- A counter-example in the partition calculus for an uncountable ordinal
- Post's problem without admissibility
- Darstellung von Ringen als Endomorphismenringe
- Fast freie Abelsche Gruppen mit Endomorphismenring Z
- Every cotorsion-free algebra is an endomorphism algebra
- Projecting precipitousness
- Forcing axioms and stationary sets
- Endomorphism rings of Abelian groups as isomorphic restrictions of full endomorphism rings. II
- Colouring without triangles and partition relation
- Infinite Abelian groups, Whitehead problem and some constructions
- Partition relations for uncountable ordinals
- Categoricity in \(\aleph_1\) of sentences in \(L_{\omega_1\omega}(Q)\)
- Simple complete Boolean algebras
- Singular cohomology in \(L\)
- Disjointness conditions in free products of lattices
- Decomposing uncountable squares to countably many chains
- The structure of Ext\((A,\mathbb{Z})\) and \(V=L\)
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
- Groups cannot be Souslin ordered
- On constructing indecomposable groups in L
- The irregular and non-hyperregular -r.e. degrees
- Number of models in \(L_{\infty,\omega_1}\)-theories
- On Shelah's compactness of cardinals
- A Banach space with few operators
- Is there a set of reals not in \(K(\mathbb{R})\)?
- Butler groups of arbitrary cardinality
- Stationary cardinals
- A differentiable manifold with noncoinciding dimensions
- A simpler proof of Jensen's coding theorem
- -languages for sets and LOGSPACE computable graph transformers
- \(\alpha\)-Specker spaces
- Local coherence.
- On strong chains of uncountable functions
- The core model for almost linear iterations
- Almost compatible functions and infinite length games
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory
- Magidor cardinals
- Tiltan
- Stationary sets added when forcing squares
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
- Diamond, square, and level by level equivalence
- On the \(p\)-rank of Ext
- Minimal model of \(\aleph ^ L_ 1\) is countable and definable reals
- Non-special Aronszajn trees on \(\aleph _{\omega +1}\)
- A functorial \(\pi ^ 1_ 2\) singleton
- Indexed squares
- The real core model and its scales
- Combinatorial principles in the core model for one Woodin cardinal
- The consistency strength of projective absoluteness
- On finite-dimensional nonmetrizable manifolds
- Chang's conjecture and weak square
- A characterization of \(\square(\kappa^{+})\) in extender models
- The nonabsoluteness of model existence in uncountable cardinals for \(L_{\omega_{1},\omega}\)
- does not imply the existence of a Suslin tree
- Inner model operators in \(L(\mathbb{R})\)
- Smooth categories and global
- A global version of a theorem of Ben-David and Magidor
- Diagonal supercompact Radin forcing
- The Ostaszewski square and homogeneous Souslin trees
- Forcing a \(\square(\kappa)\)-like principle to hold at a weakly compact cardinal
- Ramsey theory for highly connected monochromatic subgraphs
- Double weakness
- Telgársky's conjecture may fail
- Successive failures of approachability
- Towers and clubs
- Long Borel games
- The first omega alephs: from simplices to trees of trees to higher walks
- Fake reflection
- Was Ulam right? I: basic theory and subnormal ideals
- A guessing principle from a Souslin tree, with applications to topology
- The lost melody theorem for infinite time Blum-Shub-Smale machines
- The dual Baer criterion for non-perfect rings
- Freely indecomposable almost free groups with free abelianization
- A characterization of \(\Sigma_1^1\)-reflecting ordinals
- The basic theory of infinite time register machines
- Construction with opposition: cardinal invariants and games
- The weakly compact reflection principle need not imply a high order of weak compactness
- Square below a non-weakly compact cardinal
- Determinacy separations for class games
- The semi-weak square principle
- More notions of forcing add a Souslin tree
- Adding a nonreflecting weakly compact set
This page was built for publication: The fine structure of the constructible hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672886)