Π01-classes and Rado's selection principle

DOI10.2307/2274710zbMath0744.03046MaRDI 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

zbMATH Keywords

choice functions; Rado's selection principle; effective Rado family; paths in a finitely branching recursive tree

Mathematics Subject Classification ID

03D45: Theory of numerations, effectively presented structures

Related Items

The weakness of being cohesive, thin or free in reverse mathematics, The complexity of recursive constraint satisfaction problems, On degree-preserving homeomorphisms between trees in computable topology, Index sets for \(\Pi^0_1\) classes, A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points, 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