Direct construction of Scott ideals

DOI10.1007/978-3-031-36978-0_3MaRDI QIDQ6149027zbMATH OpenOpenAlexFDO

Authors Russell Miller

Publication date 12 January 2024

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-36978-0_3

zbMATH Keywords

computability theoryTuring degreeTuring reducibilityPA-degreeScott ideal\( \varPi^0_1\)-classuniform low basis theorem

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Recommendations

• Upper bounds on ideals in the computably enumerable Turing degrees
• Low upper bounds in the Turing degrees revisited
• scientific article; zbMATH DE number 2144532
• scientific article; zbMATH DE number 4033714
• Enumerations of Turing ideals with applications

Cites work

• scientific article; zbMATH DE number 5838313 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• Closed choice and a uniform low basis theorem
• Degrees of models
• Effective Galois theory
• Effective aspects of profinite groups
• Effective content of field theory
• On degrees of recursive unsolvability
• Slicing the truth. On the computable and reverse mathematics of combinatorial principles
• The upper semi-lattice of degrees of recursive unsolvability
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Direct construction of Scott ideals

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