The combinatorics of the splitting theorem

DOI10.2307/2275739zbMath0876.03021OpenAlexW2017962157MaRDI QIDQ4338322

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)

Related Items (1)

\(\Sigma_2\)-constructions and \(\text{I}\Sigma_1\)

Cites Work

• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• TOPOLOGICAL FRAMEWORK FOR FINITE INJURY
• Topological Framework for Non‐Priority
• Unnamed Item

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