Countable thin \(\Pi^0_1\) classes

DOI10.1016/0168-0072(93)90001-TzbMath0909.03039MaRDI QIDQ1208080

Douglas Cenzer, Richard A. Shore, Carl G. jun. Jockusch, Rodney G. Downey

Publication date: 16 May 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

Cantor-Bendixson ranklattice of recursively enumerable setsrecursive Boolean algebrasmaximal setspaths in a recursive infinite treepropositional theoriesundecidability degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items

A rank one cohesive set ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Members of thin Π₁⁰ classes and generic degrees ⋮ Initial segments of the lattice of Π₁⁰ classes ⋮ Effectively closed sets and enumerations ⋮ Automorphisms of the lattice of $\Pi _1^0$ classes; perfect thin classes and anc degrees ⋮ The upward closure of a perfect thin class ⋮ Immunity for Closed Sets ⋮ Computability of countable subshifts in one dimension ⋮ The uniform Martin’s conjecture for many-one degrees ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Index sets for \(\Pi^0_1\) classes ⋮ The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees ⋮ On the Cantor-Bendixon rank of recursively enumerable sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
• Countable algebra and set existence axioms
• Members of countable \(\Pi ^ 0_ 1\) classes
• Maximal theories
• Polynomial-time versus recursive models
• On \(\Pi{}^ 0_ 1\) classes and their ranked points
• Recursively presented games and strategies
• Some properties of the constructivization of Boolean algebras
• Initial segments of the degrees of unsolvability
• Degrees of members of \(\Pi_ 1^ 0\) classes
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• On Recursive Trees with a Unique Infinite Branch
• Retraceable Sets
• Effective aspects of profinite groups
• Recursively Enumerable Sets and Retracing Functions
• Effective content of field theory
• Recursively enumerable Boolean algebras
• On the ranked points of a Π₁⁰ set
• Abstract dependence, recursion theory, and the lattice of recursively enumerable filters
• On the Lattice of Recursively Enumerable Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Relationships Between Reducibilities
• Semirecursive Sets and Positive Reducibility
• Axiomatizable theories with few axiomatizable extensions
• The Degrees of Hyperimmune Sets
• Hierarchies of Boolean algebras
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)