scientific article; zbMATH DE number 1301815
arithmetical hierarchydefinabilityfirst-order arithmeticMartin's conjectureordering of real-valued functionsprojective hierarchysecond-order arithmeticsurvey
Hierarchies of computability and definability (03D55) Applications of computability and recursion theory (03D80) Inner models, including constructibility, ordinal definability, and core models (03E45) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35)
Slaman gives a rapid but brimming exposition of results and ideas about definability in first-order and (especially) second-order arithmetic. The array of observations and insights is a cornucopia. He reviews the arithmetical and projective hierarchies and surveys a wide range of applications. Among them: Shoenfield's result that \(\Pi^1_2\) statements are absolute between well-founded inner models of ZF, Gödel's result that there is a constructible \(\Sigma^1_2\) well-ordering of the constructible reals, the Jensen-Solovay proof of relative consistency of the existence of a nonconstructible \(\Delta^1_3\) real, and Solovay's proof that if \(0^\#\) exists it is a \(\Delta^1_3\) real and is the unique solution of a \(\Pi^1_2\) formula. The paper builds to consideration of Martin's conjecture about his ordering of real-valued functions. Its partial verification, by Steel, is ``strong evidence that there is only one hierarchy of definability: the one that we have been exploring. For the entire collection see [Zbl 0901.00023].
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 Q4247033)