A generalization of the limit lemma and clopen games

DOI10.2307/2274051zbMATH Open0613.03016OpenAlexW4256461678MaRDI QIDQ3753992FDOQ3753992

Peter Clote

Publication date: 1986

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274051

Recommendations

• A recursion theoretic analysis of the clopen Ramsey theorem
• Generalized Hyperarithmetic Theory
• Finite level Borel games and a problem concerning the jump hierarchy
• scientific article; zbMATH DE number 3875257
• scientific article; zbMATH DE number 3929926

zbMATH Keywords

well-founded treehyperarithmetic hierarchyordinal heighthyperarithmetic setslimit lemmaclopen gameclopen determinacyTuring degree of a winning strategy

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Determinacy principles (03E60)

Cited In (4)

• On revision operators
• Finite level Borel games and a problem concerning the jump hierarchy
• Optimal bounds for ordinal comparison maps
• Generalized Hyperarithmetic Theory

This page was built for publication: A generalization of the limit lemma and clopen games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753992)