Countable retracing functions and \(\Pi_2^0\) predicates

DOI10.2140/pjm.1969.30.67zbMath0181.30602OpenAlexW2004998346MaRDI QIDQ2534881

Thomas G. McLaughlin, Carl G. jun. Jockusch

Publication date: 1969

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1969.30.67

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (20)

The Medvedev lattice of computably closed sets ⋮ Π₀¹-classes and Rado's selection principle ⋮ A theory of nonmonotonic rule systems. II ⋮ On Recursive Trees with a Unique Infinite Branch ⋮ Lower bounds on degrees of game-theoretic structures ⋮ Π₁¹ relations and paths through ⋮ Ramsey's theorem and recursion theory ⋮ Simple structures with complex symmetry ⋮ Embeddings between well-orderings: computability-theoretic reductions ⋮ Π₁⁰ classes and strong degree spectra of relations ⋮ On the degree spectrum of a $\Pi ^0_1$ class ⋮ Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes ⋮ The polarized Ramsey's theorem ⋮ Double jumps of minimal degrees ⋮ On the ranked points of a Π₁⁰ set ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Computing and dominating the Ryll-Nardzewski function ⋮ Computability of Subsets of Metric Spaces ⋮ Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers ⋮ A recursion theoretic analysis of the clopen Ramsey theorem

This page was built for publication: Countable retracing functions and \(\Pi_2^0\) predicates