{"id":"https://openalex.org/W2017254147","doi":"https://doi.org/10.1017/s0022481200029042","title":"<i>\u03a3<sub>2</sub></i>-collection and the infinite injury priority method","display_name":"<i>\u03a3<sub>2</sub></i>-collection and the infinite injury priority method","publication_year":1988,"publication_date":"1988-03-01","ids":{"openalex":"https://openalex.org/W2017254147","doi":"https://doi.org/10.1017/s0022481200029042","mag":"2017254147"},"language":"en","primary_location":{"id":"doi:10.1017/s0022481200029042","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0022481200029042","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011939365","display_name":"Michael E. Mytilinaios","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]},{"id":"https://openalex.org/I4210166639","display_name":"Dartmouth Hospital","ror":"https://ror.org/02j3qj605","country_code":"GB","type":"healthcare","lineage":["https://openalex.org/I4210166639"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Michael E. Mytilinaios","raw_affiliation_strings":["Department of Mathematics and Computer Science, Dartmouth CollegeHanover, New Hampshire 03755","Dartmouth College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Dartmouth CollegeHanover, New Hampshire 03755","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Dartmouth College","institution_ids":["https://openalex.org/I4210166639","https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056375116","display_name":"Theodore A. Slaman","orcid":"https://orcid.org/0000-0002-1719-2630"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Theodore A. Slaman","raw_affiliation_strings":["Department of Mathematics, University of Chicago, Chicago, Illinois 60637","University-of Chicago"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Chicago, Chicago, Illinois 60637","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"University-of Chicago","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7504,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.9355035,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"53","issue":"1","first_page":"212","last_page":"221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9797000288963318,"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/T11567","display_name":"semigroups and automata theory","score":0.9700999855995178,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.9539691805839539},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.8373207449913025},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6025198101997375},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5462666153907776},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.5375376343727112},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5113934874534607},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.506334662437439},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4954320192337036},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.4734879434108734},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4536917805671692},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4408462941646576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32899266481399536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.302376389503479}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9539691805839539},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.8373207449913025},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6025198101997375},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5462666153907776},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.5375376343727112},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5113934874534607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.506334662437439},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4954320192337036},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4734879434108734},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4536917805671692},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4408462941646576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32899266481399536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.302376389503479},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0022481200029042","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0022481200029042","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W13300039","https://openalex.org/W159724961","https://openalex.org/W1268767236","https://openalex.org/W1972685794","https://openalex.org/W2031067254","https://openalex.org/W2056414301","https://openalex.org/W2065518830","https://openalex.org/W4232277851","https://openalex.org/W4242335196","https://openalex.org/W6658470190","https://openalex.org/W6824751650"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W2089792255","https://openalex.org/W2135152748","https://openalex.org/W2069987267","https://openalex.org/W1973052363","https://openalex.org/W1972481159","https://openalex.org/W2112189052","https://openalex.org/W1980641386","https://openalex.org/W4249600134","https://openalex.org/W798745779"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"show":[2],"that":[3,81,114],"the":[4,23,63,73,112,115,126],"existence":[5,74],"of":[6,26,62,75,107],"a":[7,46,59],"recursively":[8,52,78,127],"enumerable":[9,53,79,128],"set":[10,54,80],"whose":[11],"Turing":[12],"degree":[13],"is":[14,82],"neither":[15,83],"low":[16,84,119],"nor":[17,86],"complete":[18],"cannot":[19,93],"be":[20,56,94],"proven":[21],"from":[22],"basic":[24],"axioms":[25],"first":[27,108],"order":[28,109],"arithmetic":[29,110],"(":[30,39],"P":[31,97],"\u2212":[32,98],")":[33],"together":[34],"with":[35],"\u03a3":[36,41],"2":[37,42],"-collection":[38],"B":[40],").":[43],"In":[44],"contrast,":[45],"high":[47,87,116],"(hence,":[48],"not":[49],"low)":[50],"incomplete":[51,77],"can":[55],"assembled":[57],"by":[58],"standard":[60],"application":[61],"infinite":[64],"injury":[65],"priority":[66],"method.":[67],"Similarly,":[68],"for":[69],"each":[70],"n":[71,85,88,117,120],",":[72,90],"an":[76],"-1":[89],"while":[91],"true,":[92],"established":[95],"in":[96],"+":[99],"B\u03a3":[100],"n+1":[101],".":[102],"Consequently,":[103],"no":[104],"bounded":[105],"fragment":[106],"establishes":[111],"facts":[113],"and":[118],"jump":[121],"hierarchies":[122],"are":[123],"proper":[124],"on":[125],"degrees.":[129]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}