Iterating ordinal definability

DOI10.1016/0168-0072(83)90008-8MaRDI QIDQ791523zbMATH OpenOpenAlexWikidataFDO

Authors Włodzimierz Zadrożny

Publication date 1983

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(83)90008-8

zbMATH Keywords

hereditarily ordinal definable setsHODhomogeneous forcing

Mathematics Subject Classification ID

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

Review text

This paper gives a large variety of results concerning HOD (the class of hereditarily ordinal definable sets) and its iterated versions \((HOD_{\alpha +1}=HOD^{HOD_{\alpha}};\quad HOD_{\lambda}=\cap_{\beta<\lambda}HOD_{\beta}).\) Some old results are stated and proved: this is used to present the key ideas and technical details (essentially McAloon's method of coding) of the new results. The old theorems are: \(\forall M \exists N\) generic extension s.t. \(HOD^ N=M\); \(\forall M \exists N\) generic extension s.t. \(N\vDash ZFC+V=HOD\) (Roguski); \(cons(ZF)\to cons(ZF+\forall n\quad HOD_ n\neq HOD_{n+1}\pm(AC)^{HOD_{\omega}})\) (McAloon). The new ones are: \(cons(ZF)\to cons(ZF+HOD_{\omega}\nvDash ZF)\) (unpublished from Harrington); \(\forall M \exists N\) generic extension s.t. \(HOD_{on}=M+\forall \alpha \quad HOD_{\alpha +1}\neq HOD_{\alpha}; \forall M\), \(\alpha\in M\), \(\exists N\) generic extension s.t. \((HOD_{\alpha +1})^ N=M+\forall \beta<\alpha \quad HOD_{\beta}\neq HOD_{\beta +1}.\) The paper is self contained. It is very well written and pleasant to read. A nice survey of the subject.

Recommendations

• Cardinals and iterations of HOD
• Ordinal definability in Jensen's model
• scientific article; zbMATH DE number 1296809
• HOD in inner models with Woodin cardinals
• On Russell typicality in set theory

Cites work

• A generalization of Gödel's notion of constructibility
• Cardinal collapsing and ordinal definability
• Consistency results about ordinal definability
• Embedding theorems for boolean algebras and consistency results on ordinal definable sets
• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• scientific article; zbMATH DE number 3745151 (Why is no real title available?)
• scientific article; zbMATH DE number 3782969 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3531384 (Why is no real title available?)
• scientific article; zbMATH DE number 3563084 (Why is no real title available?)
• scientific article; zbMATH DE number 3582147 (Why is no real title available?)
• scientific article; zbMATH DE number 3604882 (Why is no real title available?)
• scientific article; zbMATH DE number 3358472 (Why is no real title available?)
• On the sequence of models HOD_n
• Ordinal definability in Jensen's model
• Some applications of Jensen's coding theorem
• Transfinite descending sequences of models HODα

Cited in

(13)

• Typicality à la Russell in set theory
• Set-theoretic geology
• scientific article; zbMATH DE number 4016884 (Why is no real title available?)
• Cardinals and iterations of HOD
• Ordinal definability in Jensen's model
• scientific article; zbMATH DE number 3991491 (Why is no real title available?)
• Inner mantles and iterated HOD
• The HOD dichotomy
• On Russell typicality in set theory
• ITERATING THE COFINALITY- CONSTRUCTIBLE MODEL
• Generalizations of the Kunen inconsistency
• Usuba's theorem is optimal
• Lifting elementary embeddings \(j : V_{\lambda } \rightarrow V_{\lambda }\)

This page was built for publication: Iterating ordinal definability

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