scientific article; zbMATH DE number 3358471
From MaRDI portal
Publication:5632568
zbMath0226.02047MaRDI QIDQ5632568
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Inner models, including constructibility, ordinal definability, and core models (03E45) Other degrees and reducibilities in computability and recursion theory (03D30) Other aspects of forcing and Boolean-valued models (03E40)
Related Items (29)
Upper bounds for the arithmetical degrees ⋮ Lattices of c-degrees ⋮ Finite groups of OD-conjugates ⋮ Applications of iterated perfect set forcing ⋮ Initial segments of the degrees of constructibility ⋮ Minimal coding ⋮ Preserving levels of projective determinacy by tree forcings ⋮ Unnamed Item ⋮ Determinacy in the difference hierarchy of co-analytic sets ⋮ On slow minimal reals I ⋮ Sacks forcing does not always produce a minimal upper bound ⋮ Selective ultrafilters on FIN ⋮ HL ideals and Sacks indestructible ultrafilters ⋮ Countable admissible ordinals and hyperdegrees ⋮ An oracle builder's toolkit ⋮ Perfect tree forcings for singular cardinals ⋮ PRODUCTS OF HUREWICZ SPACES IN THE LAVER MODEL ⋮ Independence of Boolean algebras and forcing. ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Minimal collapsing extensions of models of ZFC ⋮ Borel partitions of infinite subtrees of a perfect tree ⋮ Turing degrees of reals of positive effective packing dimension ⋮ Unnamed Item ⋮ Mad families, forcing and the Suslin hypothesis ⋮ On the consistency of Borel's conjecture ⋮ THE IMPLICITLY CONSTRUCTIBLE UNIVERSE ⋮ Selection principles in the Laver, Miller, and Sacks models ⋮ On the independence of core-equivalence results from Zermelo-Fraenkel set theory ⋮ Some conservation results on weak König's lemma
This page was built for publication:
