A generalization of the limit lemma and clopen games

DOI10.2307/2274051zbMath0613.03016OpenAlexW4256461678MaRDI QIDQ3753992

Peter Clote

Publication date: 1986

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

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

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)

Related Items (2)

On revision operators ⋮ Optimal bounds for ordinal comparison maps

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