{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:17:40Z","timestamp":1774588660238,"version":"3.50.1"},"reference-count":22,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[2011,4,1]]},"DOI":"10.1215\/00294527-1306199","type":"journal-article","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T13:02:18Z","timestamp":1303995738000},"source":"Crossref","is-referenced-by-count":9,"title":["Infinite Time Decidable Equivalence Relation Theory"],"prefix":"10.1215","volume":"52","author":[{"given":"Samuel","family":"Coskey","sequence":"first","affiliation":[]},{"given":"Joel David","family":"Hamkins","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Adams, S., and A. S. Kechris, \"Linear algebraic groups and countable Borel equivalence relations\", <i>Journal of the American Mathematical Society<\/i>, vol. 13 (2000), pp. 909\u201343.","DOI":"10.1090\/S0894-0347-00-00341-6"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Feldman, J., and C. C. Moore, \"Ergodic equivalence relations, cohomology, and von Neumann algebras. I\", <i>Transactions of the American Mathematical Society<\/i>, vol. 234 (1977), pp. 289\u2013324.","DOI":"10.1090\/S0002-9947-1977-0578656-4"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] Friedman, H., and L. Stanley, \"A Borel reducibility theory for classes of countable structures\", <i>The Journal of Symbolic Logic<\/i>, vol. 54 (1989), pp. 894\u2013914.","DOI":"10.2307\/2274750"},{"key":"4","unstructured":"[4] Gao, S., <i>Invariant Descriptive Set Theory<\/i>, Pure and Applied Mathematics (Boca Raton). CRC Press, Boca Raton, 2009."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] Hamkins, J. D., R. Miller, D. Seabold, and S. Warner, \"Infinite time computable model theory\", pp. 521\u201357 in <i>New Computational Paradigms: Changing Conceptions of What Is Computable<\/i>, edited by S. B. Cooper, B. L\u00f6we, and A. Sorbi, Springer, 2007,","DOI":"10.1007\/978-0-387-68546-5_20"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] Hamkins, J. D., \"A simple maximality principle\", <i>The Journal of Symbolic Logic<\/i>, vol. 68 (2003), pp. 527\u201350.","DOI":"10.2178\/jsl\/1052669062"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] Hamkins, J. D., and A. Lewis, \"Post's problem for supertasks has both positive and negative solutions\", <i>Archive for Mathematical Logic<\/i>, vol. 41 (2002), pp. 507\u201323.","DOI":"10.1007\/s001530100112"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Hamkins, J. D., and A. Lewis, \"Infinite time Turing machines\", <i>The Journal of Symbolic Logic<\/i>, vol. 65 (2000), pp. 567\u2013604.","DOI":"10.2307\/2586556"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Harrington, L. A., A. S. Kechris, and A. Louveau, \"A Glimm-Effros dichotomy for Borel equivalence relations\", <i>Journal of the American Mathematical Society<\/i>, vol. 3 (1990), pp. 903\u201328.","DOI":"10.1090\/S0894-0347-1990-1057041-5"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Hjorth, G., <i>Classification and Orbit Equivalence Relations<\/i>, vol. 75 of <i>Mathematical Surveys and Monographs<\/i>, American Mathematical Society, Providence, 2000.","DOI":"10.1090\/surv\/075\/05"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Hjorth, G., and A. S. Kechris, \"Borel equivalence relations and classifications of countable models\", <i>Annals of Pure and Applied Logic<\/i>, vol. 82 (1996), pp. 221\u201372.","DOI":"10.1016\/S0168-0072(96)00006-1"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Jackson, S., A. S. Kechris, and A. Louveau, \"Countable Borel equivalence relations\", <i>Journal of Mathematical Logic<\/i>, vol. 2 (2002), pp. 1\u201380.","DOI":"10.1142\/S0219061302000138"},{"key":"13","unstructured":"[13] Jech, T., <i>Set Theory<\/i>, 3d millennium edition, Springer Monographs in Mathematics. Springer-Verlag, Berlin, 2003."},{"key":"14","unstructured":"[14] Kanamori, A., <i>The Higher Infinite. Large Cardinals in Set Theory from Their Beginnings<\/i>, 2d edition, Springer Monographs in Mathematics. Springer-Verlag, Berlin, 2003."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Kanove\u012d, V. G., and M. Reeken, \"Some new results on the Borel irreducibility of equivalence relations\", <i>Rossi\u012d skaya Akademiya Nauk. Izvestiya. Seriya Matematicheskaya<\/i>, vol. 67 (2003), pp. 59\u201382.","DOI":"10.1070\/IM2003v067n01ABEH000418"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] Kechris, A. S., <i>Classical Descriptive Set Theory<\/i>, vol. 156 of <i>Graduate Texts in Mathematics<\/i>, Springer-Verlag, New York, 1995.","DOI":"10.1007\/978-1-4612-4190-4"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Knight, J. F., S. Miller, and M. Vanden Boom, \"Turing computable embeddings\", <i>The Journal of Symbolic Logic<\/i>, vol. 72 (2007), pp. 901\u201318.","DOI":"10.2178\/jsl\/1191333847"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] Stavi, J., and J. V\u00e4\u00e4n\u00e4nen, \"Reflection principles for the continuum\", pp. 59\u201384 in <i>Logic and Algebra<\/i>, vol. 302 of <i>Contemporary Mathematics<\/i>, American Mathematical Society, Providence, 2002.","DOI":"10.1090\/conm\/302\/05082"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] Welch, P., \"Minimality arguments for infinite time Turing degrees\", pp. 425\u201336 in <i>Sets and Proofs (Leeds, 1997)<\/i>, edited by S. B. Cooper et al., vol. 258 of <i>London Mathematical Society Lecture Note Series<\/i>, Cambridge University Press, Cambridge, 1999.","DOI":"10.1017\/CBO9781107325944.018"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] Welch, P., \"Eventually infinite time Turing machine degrees: Infinite time decidable reals\", <i>The Journal of Symbolic Logic<\/i>, vol. 65 (2000), pp. 1193\u2013203.","DOI":"10.2307\/2586695"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] Welch, P., \"The length of infinite time Turing machine computations\", <i>The Bulletin of the London Mathematical Society<\/i>, vol. 32 (2000), pp. 129\u201336.","DOI":"10.1112\/S0024609399006657"},{"key":"19","unstructured":"[19] Thomas, S., \"Martin's conjecture and strong ergodicity\", preprint, 2008."}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1215\/00294527-1306199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:57:40Z","timestamp":1706648260000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-52\/issue-2\/Infinite-Time-Decidable-Equivalence-Relation-Theory\/10.1215\/00294527-1306199.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,1]]},"references-count":22,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2011,4,1]]}},"URL":"https:\/\/doi.org\/10.1215\/00294527-1306199","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[2011,4,1]]}}}