No label defined (Q4944918)

The author definess a notion of \(\Sigma\)-definability of one model of KPU over another model of KPU (both models are assumed to be well-founded ones). The definition requires existence of a special kind of isomorphic `embedding' of the first model onto the second. To justify the notion of \(\Sigma\)-definability, the author proves an Adequacy Lemma which states that the image of a \(\Sigma\)-subset of the first model with respect to the above-mentioned isomorphism is a \(\Sigma\)-subset of the second one. Let \(A\) be an admissible set and \(o(A)\) be its ordinal. Denote the group of all permutations of \(o(A)\) \(\Sigma\)-definable over \(A\) by \(G[A]\). The author proves, particularly, that if \(A\) and \(B\) are admissible sets and \(B\) is \(\Sigma\)-definable over \(A\) then \(G[B] \sqsubseteq G[A]\). A series of other relations (with various additional conditions) of that type are proved. The author proves that if \(\alpha\) is an admissible ordinal and an admissible set \(A\) is \(\Sigma\)-definable in the constructive part \(L(\alpha)\) of a model of KPU of the set-theoretic universe constructed up to step \(\alpha\) in terms of \textit{J. Barwise}'s book [Admissible sets and structures. Springer-Verlag, Berlin, Göttingen, Heidelberg (1975; Zbl 0316.02047)], then \(A\) is well-founded and \(o(A)=\alpha\). For the entire collection see [Zbl 0932.00038].