The combinatorics of the splitting theorem

DOI10.2307/2275739zbMATH Open0876.03021OpenAlexW2017962157MaRDI QIDQ4338322FDOQ4338322

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

Recommendations

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

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)

Cites Work

• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Title not available (Why is that?)
• Topological Framework for Non‐Priority
• TOPOLOGICAL FRAMEWORK FOR FINITE INJURY

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)