scientific article; zbMATH DE number 4023263
The paper assumes projective determinacy in the frame of a ZFC model. For \({\mathcal R}=N^ N\), the following results are proven: Theorem A. For every positive integer n, there exists a partial \(\Pi^ 1_{2n+1}\) \((\Sigma^ 1_{2n+2})\) function \(f: {\mathcal R}\to {\mathcal R}\) which cannot be extended to a \(\Delta^ 1_{2n+1}\) \((\Delta^ 1_{2n+2})\) function. Theorem B. There exists a \(\Sigma^ 1_{2n+2}\) \((\Pi^ 1_{2n+1})\) subset of \({\mathcal R}\times {\mathcal R}\) having all the sections countable which cannot be covered with a countable family of graphs of partial functions. The paper is highly not self contained and requires a serious training in foundations of mathematics. \textit{J. R. Shoenfield}'s book [Mathematical logic (1967; Zbl 0155.011)] is required even to be able to understand the statements, not to mention the proofs.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765762)