Iterated trees of strategies and priority arguments

DOI10.1007/S001530050067zbMath0899.03030OpenAlexW2031489436MaRDI QIDQ1387095

Manuel Lerman, Steffen Lempp

Publication date: 2 November 1998

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050067

zbMATH Keywords

degrees of unsolvabilitypriority argumentstree of strategies

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (2)

On a question of Kalimullin ⋮ Turing reducibility in the fine hierarchy

This page was built for publication: Iterated trees of strategies and priority arguments