Some applications of Jensen's coding theorem

DOI10.1016/0003-4843(82)90020-1MaRDI QIDQ3950556zbMATH OpenOpenAlexFDO

Authors

Publication date 1982

Published in Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0003-4843(82)90020-1

zbMATH Keywords

admissible setsordinalstransitive modelsZF set theory

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Other aspects of forcing and Boolean-valued models (03E40)

Cited in

(7)

• A functorial \(\pi ^ 1_ 2\) singleton
• Some recent developments in higher recursion theory
• A guide to “Coding the universe” by Beller, Jensen, Welch
• A combinatorial forcing for coding the universe by a real when there are no sharps
• Pointwise definable models of set theory
• Generic absoluteness
• Iterating ordinal definability

This page was built for publication: Some applications of Jensen's coding theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3950556)