Degrees of members of \(\Pi_ 1^ 0\) classes
From MaRDI portal
Publication:2543461
DOI10.2140/pjm.1972.40.605zbMath0209.02201OpenAlexW2007915800MaRDI QIDQ2543461
Robert I. Soare, Carl G. jun. Jockusch
Publication date: 1972
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1972.40.605
Related Items (63)
The Medvedev lattice of computably closed sets ⋮ A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ Members of countable \(\Pi ^ 0_ 1\) classes ⋮ Maximal theories ⋮ Π01-classes and Rado's selection principle ⋮ A theory of nonmonotonic rule systems. II ⋮ Computability in Symbolic Dynamics ⋮ Lower bounds on degrees of game-theoretic structures ⋮ Weakly useful sequences ⋮ Degrees of Unsolvability: A Tutorial ⋮ Degrees containing members of thin Π10 classes are dense and co-dense ⋮ Members of thin Π₁⁰ classes and generic degrees ⋮ Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree ⋮ Orders on magmas and computability theory ⋮ STRONG JUMP-TRACEABILITY ⋮ Feasible Graphs and Colorings ⋮ Some New Lattice Constructions in High R. E. Degrees ⋮ Turing degrees of multidimensional SFTs ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Computational processes, observers and Turing incompleteness ⋮ An effectively closed set with no join property* ⋮ Ramsey-type graph coloring and diagonal non-computability ⋮ Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy ⋮ Classifying word problems of finitely generated algebras via computable reducibility ⋮ choice classes ⋮ Lowness for isomorphism, countable ideals, and computable traceability ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ The complexity of recursive constraint satisfaction problems ⋮ Almost local non-α-recursiveness ⋮ Demuth randomness and computational complexity ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Independence, relative randomness, and PA degrees ⋮ Degrees of difficulty of generalized r.e. separating classes ⋮ Degrees of Indiscernibles in Decidable Models ⋮ GENERALIZATIONS OF THE RECURSION THEOREM ⋮ Intermediate logics and factors of the Medvedev lattice ⋮ Recursively presented games and strategies ⋮ Immunity for Closed Sets ⋮ Medvedev Degrees of Generalized R.E. separating Classes ⋮ Computable analogs of cardinal characteristics: prediction and rearrangement ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Post's problem and his hypersimple set ⋮ Encodability of Kleene's O ⋮ Weakly useful sequences ⋮ The importance of Π10 classes in effective randomness ⋮ On the degree spectrum of a $\Pi ^0_1$ class ⋮ Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Recursively enumerable sets and degrees ⋮ On a conjecture of Dobrinen and Simpson concerning almost everywhere domination ⋮ Minimal Covers and Hyperdegrees ⋮ Fixed point theorems for precomplete numberings ⋮ Mass problems associated with effectively closed sets ⋮ On the ranked points of a Π10 set ⋮ Uniform almost everywhere domination ⋮ Index sets in computable analysis ⋮ Recursive Euler and Hamilton Paths ⋮ Index sets for \(\Pi^0_1\) classes ⋮ Logic programs, well-orderings, and forward chaining ⋮ Cone avoidance and randomness preservation ⋮ Effectively closed sets and graphs of computable real functions. ⋮ Π10 classes and Boolean combinations of recursively enumerable sets
This page was built for publication: Degrees of members of \(\Pi_ 1^ 0\) classes
