Splitting an α-Recursively Enumerable Set

DOI10.2307/1997349MaRDI QIDQ4063424zbMATH OpenOpenAlexFDO

Authors Richard A. Shore

Publication date 1975

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited in

(15)

• Global and local admissibility. II. Major subsets and automorphisms
• The basic theory of partial -recursive operators
• Tabular degrees in \(\alpha\)-recursion theory
• The irregular and non-hyperregular -r.e. degrees
• \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\)
• Power set recursion
• \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator
• Fragments of Kripke-Platek set theory and the metamathematics of -recursion theory
• The atomic model theorem and type omitting
• Inverting the Half-Jump
• Cohesive Sets: Countable and Uncountable
• \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
• Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
• Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
• Notes on Sacks' splitting theorem

This page was built for publication: Splitting an α-Recursively Enumerable Set

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