Splitting an α-Recursively Enumerable Set
From MaRDI portal
Publication:4063424
DOI10.2307/1997349zbMath0306.02034OpenAlexW4244610869MaRDI QIDQ4063424
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
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)
Related Items
The basic theory of partial \(\alpha\)-recursive operators ⋮ Power set recursion ⋮ 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 ⋮ Discrete Transfinite Computation ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs ⋮ Inverting the Half-Jump ⋮ Tabular degrees in \(\alpha\)-recursion theory ⋮ The irregular and non-hyperregular \(\alpha\)-r.e. degrees ⋮ Cohesive Sets: Countable and Uncountable ⋮ The atomic model theorem and type omitting ⋮ \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\) ⋮ Global and local admissibility. II. Major subsets and automorphisms
