Pyramidal structure of constructibility degrees

DOI10.1007/BF02311261MaRDI QIDQ1280673zbMATH OpenFDO

Authors Vladimir Kanovei, Jindřich Zapletal

Publication date 23 August 1999

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02311261

zbMATH Keywords

degrees of constructibilitymodified iterated Sacks forcingSacks model

Mathematics Subject Classification ID

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

Review text

The authors construct a ZFC-model \(L[G]\) such that the degrees of constructibility include (i) degrees \(0< a_0< a_1<\cdots\); (ii) a degree \(b\), incomparable with any of the \(a_n\); (iii) \(a_0b< a_1b<\cdots\); and (iv) if \(x\in L[G]\) and \(x\not\in L[a_0,\dots, a_n,b]\) for any \(n\), then \(G\in L[x]\). This is done with the help of a modified iterated Sacks forcing.

Recommendations

• as an initial segment of the c-degrees
• Lattices of c-degrees
• Applications of iterated perfect set forcing
• Forcing Minimal Degree of Constructibility

Cites work

• Iterated perfect-set forcing
• On non-wellfounded iterations of the perfect set forcing

Cited in

(1)

• scientific article; zbMATH DE number 218598 (Why is no real title available?)

This page was built for publication: Pyramidal structure of constructibility degrees

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