{"id":"https://openalex.org/W2021977968","doi":"https://doi.org/10.1215/00294527-1960488","title":"Galvin\u2019s \u201cRacing Pawns\u201d Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle","display_name":"Galvin\u2019s \u201cRacing Pawns\u201d Game, Internal Hyperarithmetic Comprehension, and the Law of Excluded Middle","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2021977968","doi":"https://doi.org/10.1215/00294527-1960488","mag":"2021977968"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-1960488","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1960488","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-54/issue-2/Galvins-Racing-Pawns-Game-Internal-Hyperarithmetic-Comprehension-and-the-Law/10.1215/00294527-1960488.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-54/issue-2/Galvins-Racing-Pawns-Game-Internal-Hyperarithmetic-Comprehension-and-the-Law/10.1215/00294527-1960488.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042709157","display_name":"Chris J. Conidis","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chris Conidis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027573689","display_name":"Noam Greenberg","orcid":"https://orcid.org/0000-0003-2917-3848"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Noam Greenberg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056888455","display_name":"Daniel Turetsky","orcid":"https://orcid.org/0000-0002-4154-4800"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Turetsky","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042709157"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09136638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"54","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13400","display_name":"Mathematical and Theoretical Analysis","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/transfinite-number","display_name":"Transfinite number","score":0.856096625328064},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.6902543306350708},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.648505687713623},{"id":"https://openalex.org/keywords/comprehension","display_name":"Comprehension","score":0.6188287734985352},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.501319169998169},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.49818992614746094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48843565583229065},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.41599106788635254},{"id":"https://openalex.org/keywords/white","display_name":"White (mutation)","score":0.4145814776420593},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2774011194705963},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22447222471237183},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08602145314216614},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.08393332362174988}],"concepts":[{"id":"https://openalex.org/C147358099","wikidata":"https://www.wikidata.org/wiki/Q1069891","display_name":"Transfinite number","level":2,"score":0.856096625328064},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.6902543306350708},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.648505687713623},{"id":"https://openalex.org/C511192102","wikidata":"https://www.wikidata.org/wiki/Q5156948","display_name":"Comprehension","level":2,"score":0.6188287734985352},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.501319169998169},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.49818992614746094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48843565583229065},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.41599106788635254},{"id":"https://openalex.org/C56273599","wikidata":"https://www.wikidata.org/wiki/Q3122841","display_name":"White (mutation)","level":3,"score":0.4145814776420593},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2774011194705963},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22447222471237183},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08602145314216614},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.08393332362174988},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1215/00294527-1960488","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1960488","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-54/issue-2/Galvins-Racing-Pawns-Game-Internal-Hyperarithmetic-Comprehension-and-the-Law/10.1215/00294527-1960488.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1361454976","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1361454976","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1215/00294527-1960488","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1960488","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-54/issue-2/Galvins-Racing-Pawns-Game-Internal-Hyperarithmetic-Comprehension-and-the-Law/10.1215/00294527-1960488.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5600000023841858,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G7437914223","display_name":"conidis PDF proposal for reasearch in computability theory","funder_award_id":"373817-2009","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G7644183785","display_name":null,"funder_award_id":"PDF 373817-2009","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320335369","display_name":"Marsden Fund","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2021977968.pdf","grobid_xml":"https://content.openalex.org/works/W2021977968.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1556453281","https://openalex.org/W1976584681","https://openalex.org/W2081624356","https://openalex.org/W2162168838","https://openalex.org/W2486526350","https://openalex.org/W2598651983"],"related_works":["https://openalex.org/W3125250027","https://openalex.org/W1524249063","https://openalex.org/W1998092208","https://openalex.org/W1672266275","https://openalex.org/W2498020965","https://openalex.org/W3094338803","https://openalex.org/W2473730886","https://openalex.org/W4294167392","https://openalex.org/W1485702188","https://openalex.org/W2086359902"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,5],"the":[3,6,28,32,44],"fact":[4],"first":[7],"player":[8],"(\u201cwhite\u201d)":[9],"wins":[10],"every":[11],"instance":[12],"of":[13,38,43,46],"Galvin\u2019s":[14],"\u201cracing":[15],"pawns\u201d":[16],"game":[17],"(for":[18],"countable":[19],"trees)":[20],"is":[21],"equivalent":[22],"to":[23],"arithmetic":[24],"transfinite":[25],"recursion.":[26],"Along":[27],"way":[29],"we":[30],"analyze":[31],"satisfaction":[33],"relation":[34],"for":[35,49],"infinitary":[36],"formulas,":[37],"\u201cinternal\u201d":[39],"hyperarithmetic":[40],"comprehension,":[41],"and":[42],"law":[45],"excluded":[47],"middle":[48],"such":[50],"formulas.":[51]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}