Π01-classes and Rado's selection principle
From MaRDI portal
Publication:3984442
DOI10.2307/2274710zbMath0744.03046OpenAlexW2162499956MaRDI QIDQ3984442
Andrew E. M. Lewis, Carl G. jun. Jockusch, Jeffery B. Remmel
Publication date: 27 June 1992
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274710
choice functionsRado's selection principleeffective Rado familypaths in a finitely branching recursive tree
Related Items
The complexity of recursive constraint satisfaction problems, On degree-preserving homeomorphisms between trees in computable topology, The weakness of being cohesive, thin or free in reverse mathematics, A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points, Index sets for \(\Pi^0_1\) classes, Learning to win process-control games watching game-masters
Cites Work
- Unnamed Item
- Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
- Countable retracing functions and \(\Pi_2^0\) predicates
- Degrees of members of \(\Pi_ 1^ 0\) classes
- A selection lemma
- Selective families of sets
- Variants of RADO'S Selection Lemma and their Applications
- Selectivity and Weakly Compact Cardinals
- Arithmetical Sets and Retracing Functions
- Class groups of integral group rings
- Axiomatic Treatment of Rank in Infinite Sets