Intermediate submodels and generic extensions in set theory

From MaRDI portal
Publication:1218423

DOI10.2307/1970935zbMath0308.02060OpenAlexW2315572811MaRDI QIDQ1218423

Serge Grigorieff

Publication date: 1975

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1970935




Related Items

On Russell typicality in set theoryRestrictions on forcings that change cofinalitiesOrdinal definability in Jensen's modelInjectivity, Projectivity, and the Axiom of ChoiceEquivalence of genericsThe Bristol model: An abyss called a Cohen realPartition properties for simply definable colouringsAbsoluteness of the Solovay set \(\Sigma \)-definability at higher cardinals: Thin sets, almost disjoint families and long well-ordersBounding 2d functions by products of 1d functionsRemarks on Gitik's model and symmetric extensions on products of the Lévy collapseFodor's lemma can fail everywhereThe classification of countable models of set theoryCombinatorial properties and dependent choice in symmetric extensions based on Lévy collapseFactoring Solovay-random extensions, with application to the reduction propertyA characterization of permutation models in terms of forcingITERATING SYMMETRIC EXTENSIONSBorel reducibility and symmetric modelsPrefaceOn the Set-Generic MultiverseA generic property of the Solovay set \(\Sigma\)Countable OD sets of reals belong to the ground modelSymmetric submodels of a Cohen generic extensionModels of set theory with definable ordinalsEmbedding theorems for boolean algebras and consistency results on ordinal definable setsStandardization principle of nonstandard universesSet-theoretic geologyA result of relative consistency about the predicate WO(δ, x)REALIZING REALIZABILITY RESULTS WITH CLASSICAL CONSTRUCTIONSSurrealist landscape with figures (a survey of recent results in set theory)DEPENDENT CHOICE, PROPERNESS, AND GENERIC ABSOLUTENESSThe model of set theory generated by countably many generic realsChoiceless Löwenheim-Skolem property and uniform definability of groundsChoiceless chain conditionsBoolean-valued class forcingGeneralization of one construction by Solovay