Iterating ordinal definability

Abstract

AbstractThe paper presents a uniform way of obtaining by forcing descending sequences of the iterations of HOD and describes their structure. Among other things the following results are proved:Theorem. Any model M of ZFC can be obtained by the transfinite iteration of HOD in some generic extension N of M, i.e. M=(HODOn)N.Theorem (ZFC). For any ordinal α there is a complete Boolean algebra B with a decreasing sequence of derivatives of length α.Moreover some other results about ordinal definability are reproved using the introduced method. This method is a refinement of the classical method of coding introduced by McAloon in [11]

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

https://s3.amazonaws.com/prod-... (external link)

https://s3-eu-west-1.amazonaws... (external link)