Coding lemmata in L(V_+1)

DOI10.1007/S00153-003-0204-0MaRDI QIDQ1879321zbMATH OpenOpenAlexWikidataFDO

Authors George Kafkoulis

Publication date 22 September 2004

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-003-0204-0

zbMATH Keywords

codingelementary embeddinginner modelelementary projectumprewellorderingstrong regularity of cardinals

Mathematics Subject Classification ID

Large cardinals (03E55) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• Lifting elementary embeddings \(j : V_{\lambda } \rightarrow V_{\lambda }\)
• Coding over a measurable cardinal
• Codings and strongly inaccessible cardinals
• Coding into 𝐾 by reasonable forcing
• Strong coding

Cited in

(6)

• I0 and rank-into-rank axioms
• A partially non-proper ordinal beyond \(L(V_{\lambda +1})\)
• Generic at
• Totally non-proper ordinals beyond \(L(V_{\lambda +1})\)
• Certain very large cardinals are not created in small forcing extensions
• Berkeley cardinals and the structure of \(L(V_{\delta+1})\)

This page was built for publication: Coding lemmata in \(L(V_{\lambda+1})\)

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