Strong coding

DOI10.1016/0168-0072(87)90057-1zbMath0634.03048OpenAlexW4213299914MaRDI QIDQ1096623

Sy-David Friedman

Publication date: 1987

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(87)90057-1

zbMATH Keywords

class forcingclass-generic realinaccessible ordinals

Mathematics Subject Classification ID

Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45)

Related Items (3)

A simpler proof of Jensen's coding theorem ⋮ Admissibility spectra through \(\omega _ 1\) ⋮ A functorial \(\pi ^ 1_ 2\) singleton

Cites Work

• Aspects of constructibility
• Simplified morasses with linear limits
• Uncountable Admissibles I: Forcing
• The fine structure of the constructible hierarchy
• The α-finite injury method
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong coding