No label defined (Q4247035)

The author focuses on the iterative conception of set where ``sets are the objects in any member of the hierarchy of domains obtained from the null domain by iterating the power set operation \(\mathcal P\).'' In his discussion the author considers formulas of set theory of finite type and their relativizations to domains. \(\text{RF}(n,m,k)\) denotes the reflection principle, \(\forall X[\varphi(X,\ldots,Y)\rightarrow\exists\beta\varphi^\beta(X^\beta, \ldots,Y^\beta)]\), where \(\varphi\) is \(\Pi_m^n\) and \(k\) is the maximum order of its free variables; \(\varphi^\beta\) is the relativization of \(\varphi\) to the rank universe \(R(\beta)\). The author discusses the relative strengths of the first and second order reflection principles \(\text{RF}(1,m,1)\) and \(\text{RF}(1,m,2)\) and the relation of such principles to the iterative conception. Domains themselves are explicated as a species of type, which serves to distinguish them from sets. The problem of constructing domains is then one of constructing systems of ordinals. The paper ends with a discussion of higher order reflection principles. For the entire collection see [Zbl 0901.00023].