Enumerations of Turing ideals with applications

DOI10.1305/NDJFL/1093635587MaRDI QIDQ2277253zbMATH OpenOpenAlexFDO

Authors David Marker

Publication date 1990

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093635587

zbMATH Keywords

enumerationsmodel theory of first and second order arithmetical systemsTuring idealTuring reducibility

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Other degrees and reducibilities in computability and recursion theory (03D30)

Review text

A Turing ideal is a collection of sets of integers closed under Turing reducibility and join. The author studies enumerations of such objects with an eye to applications in the model theory of first and second order arithmetical systems such as \(WKL_ 0\) and \(RCA_ 0\). The techniques are Cohen and Sacks forcing, and coding techniques such as those of \textit{J. Harrison} [Thesis, Stanford 1966].

Recommendations

• Upper bounds on ideals in the computably enumerable Turing degrees
• Completions of PA: Models and enumerations of representable sets
• Enumerations, countable structures and Turing degrees
• scientific article; zbMATH DE number 2144532
• Definability in the enumeration degrees

Cited in

(2)

• scientific article; zbMATH DE number 3862444 (Why is no real title available?)
• Direct construction of Scott ideals

This page was built for publication: Enumerations of Turing ideals with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277253)