The combinatorics of the splitting theorem

DOI10.2307/2275739MaRDI QIDQ4338322zbMATH OpenOpenAlexFDO

Authors Kyriakos Kontostathis

Publication date 30 October 1997

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

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

zbMATH Keywords

recursively enumerable degreesSplitting TheoremProof theory of priority arguments

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Complexity of proofs (03F20)

Recommendations

• scientific article; zbMATH DE number 749930
• Non-uniformity and generalised Sacks splitting
• scientific article; zbMATH DE number 1421069

Cites work

• scientific article; zbMATH DE number 4150132 (Why is no real title available?)
• TOPOLOGICAL FRAMEWORK FOR FINITE INJURY
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Topological Framework for Non‐Priority

Cited in

(9)

• A splitting theorem for blocks
• Splitting theorems in recursion theory
• Combinatorial aspects of the splitting number
• \(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\)
• Lower Bounds for Splittings by Linear Combinations
• scientific article; zbMATH DE number 1101532 (Why is no real title available?)
• scientific article; zbMATH DE number 1786785 (Why is no real title available?)
• Combinatorics for the dominating and unsplitting numbers
• Combinatorial g-conjecture for interval subdivisions

This page was built for publication: The combinatorics of the splitting theorem

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