The Sacks density theorem and Σ2-bounding

DOI10.2307/2275670zbMath0858.03047OpenAlexW2162272192MaRDI QIDQ4894721

Theodore A. Slaman, Michael E. Mytilinaios, Marcia J. Groszek

Publication date: 19 March 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275670

zbMATH Keywords

densityrecursively enumerable degreemodels of arithmeticpriority methodTuring degreesSacks Density Theoremsubsystems of first order arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory, \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator, \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture, \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\), Coding a family of sets

Cites Work

• The recursively enumerable degrees are dense
• On the degrees less than 0'
• The recursively enumerable α-degrees are dense
• The α-finite injury method