Some applications of Jensen's coding theorem

DOI10.1016/0003-4843(82)90020-1zbMath0489.03021OpenAlexW1967055349MaRDI QIDQ3950556

No author found.

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

ordinalsadmissible setsZF set theorytransitive models

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ Some recent developments in higher recursion theory ⋮ A functorial \(\pi ^ 1_ 2\) singleton ⋮ Iterating ordinal definability

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