scientific article; zbMATH DE number 1531928
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computable structure theory, computable model theory (03C57) Models of arithmetic and set theory (03C62) Theory of numerations, effectively presented structures (03D45) Nonstandard models of arithmetic (03H15)
This is a brief and very readable survey of results concerning completions \(T\) of PA, families of sets representable in \(T\), degrees of models of \(T\), and degrees of enumerations of their Scott sets. The novelty are the results of A. Arana on degrees of fragments of the elementary diagram of a model, which extend Solovay's characterization of degrees of models of \(T\) (no proofs). There is also a proof that for any non-computable set \(X\) there is a completion \(T\) of PA such that \(X\not\leq_T T\) and \(T' \leq_T X\oplus \emptyset'\). This contrasts with a result of Kucera who showed that there is a Scott set \(\mathcal S\) with a non-computable \(X\) in \(\mathcal S\) such that for all completions \(T\) of PA in \(\mathcal S\), \(X\leq_T T\). Open problems are listed, and a conjecture is made. For the entire collection see [Zbl 0945.00017].
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 Q4513971)