Infinite time decidable equivalence relation theory

DOI10.1215/00294527-1306199zbMath1233.03050arXiv0910.4616OpenAlexW1983809139MaRDI QIDQ540407

Joel David Hamkins, Samuel Coskey

Publication date: 3 June 2011

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.4616

zbMATH Keywords

equivalence relationsdescriptive set theoryinfinite-time computation

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65)

Related Items (6)

Descriptive set theory, from Cantor to Wadge and beyond ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ The classification of countable models of set theory ⋮ On computably enumerable structures ⋮ The recognizability strength of infinite time Turing machines with ordinal parameters ⋮ Graphs realised by r.e. equivalence relations

This page was built for publication: Infinite time decidable equivalence relation theory