The model of set theory generated by countably many generic reals

DOI10.2307/2273223zbMath0482.03022OpenAlexW1989586176MaRDI QIDQ3939795

Andreas Blass

Publication date: 1981

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

dependent choiceCohen forcingsymmetric modelsrelative constructibilityCohen-Halpern-Levy modelCohen-generic realsFeferman modelrelative definability

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Axiom of choice and related propositions (03E25) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (5)

Borel reducibility and symmetric models ⋮ On extensions of countable filterbases to ultrafilters and ultrafilter compactness ⋮ Symmetric submodels of a Cohen generic extension ⋮ The existence of free ultrafilters on ω does not imply the extension of filters on ω to ultrafilters ⋮ Generic Families and Models of Set Theory with the Axiom of Choice

Cites Work

• Unnamed Item
• Intermediate submodels and generic extensions in set theory
• Pointless axiomatic set theory
• A model of set-theory in which every set of reals is Lebesgue measurable
• Iterated Cohen extensions and Souslin's problem
• Victoria symposium on nonstandard analysis. University of Victoria 1972

This page was built for publication: The model of set theory generated by countably many generic reals