{"id":"https://openalex.org/W2108832968","doi":"https://doi.org/10.2307/2270513","title":"The Meta-R.E. sets, but not the \u03a0<sub>1</sub><sup>1</sup> sets, can be enumerated without repetition","display_name":"The Meta-R.E. sets, but not the \u03a0<sub>1</sub><sup>1</sup> sets, can be enumerated without repetition","publication_year":1970,"publication_date":"1970-06-01","ids":{"openalex":"https://openalex.org/W2108832968","doi":"https://doi.org/10.2307/2270513","mag":"2108832968"},"language":"en","primary_location":{"id":"doi:10.2307/2270513","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2270513","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/A5033606691","display_name":"James C. Owings","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James C. Owings","raw_affiliation_strings":["University of Maryland"],"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033606691"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.24327731,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"35","issue":"2","first_page":"223","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9929999709129333,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9929999709129333,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.987500011920929,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9621999859809875,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/enumeration","display_name":"Enumeration","score":0.7707021832466125},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.7515335083007812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6608474850654602},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6585789918899536},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6449618339538574},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.6122693419456482},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5525045394897461},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5503416061401367},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.49869537353515625},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.49248751997947693},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43063318729400635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20247584581375122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19538062810897827}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7707021832466125},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.7515335083007812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6608474850654602},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6585789918899536},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6449618339538574},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.6122693419456482},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5525045394897461},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5503416061401367},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.49869537353515625},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.49248751997947693},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43063318729400635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20247584581375122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19538062810897827},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2270513","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2270513","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":1,"referenced_works":["https://openalex.org/W6809209440"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W2135152748","https://openalex.org/W2069987267","https://openalex.org/W1973052363","https://openalex.org/W1972481159","https://openalex.org/W1980641386","https://openalex.org/W2112189052","https://openalex.org/W4249600134","https://openalex.org/W2757989085","https://openalex.org/W2802459235"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"investigate":[4],"the":[5,12,38,52,71,97],"possibility":[6],"of":[7,11,30,126],"extending":[8],"Friedberg's":[9],"enumeration":[10],"recursively":[13],"enumerable":[14,40],"(r.e.)":[15],"sets":[16,42,64],"without":[17,46],"duplication":[18],"[1,":[19],"p.":[20],"312]":[21],"to":[22],"meta-recursion":[23],"theory.":[24],"It":[25],"turns":[26],"out":[27],"that":[28,99],"all":[29,51,75],"our":[31],"proposed":[32],"extensions":[33],"are":[34,55],"impossible":[35],"save":[36],"one:":[37],"metarecursively":[39],"(meta-r.e.)":[41],"can":[43],"be":[44,66],"enumerated":[45],"duplication,":[47],"but":[48],"only":[49],"if":[50,70],"recursive":[53,76],"ordinals":[54,77],"used":[56],"as":[57],"indices":[58],"(Theorems":[59,78],"1":[60],"and":[61,80,129,131],"2).":[62],"The":[63],"cannot":[65],"so":[67],"enumerated,":[68],"even":[69],"index":[72],"set":[73,102],"is":[74,88,105],"3":[79],"4).":[81],"As":[82],"a":[83],"corollary,":[84],"one":[85,107],"proves":[86],"there":[87,104],"no":[89],"predicate":[90],"P":[91,117],"(":[92,118],"n,":[93,119],"x":[94,115,120],")":[95],"with":[96],"property":[98],"for":[100,110],"each":[101],"A":[103,112],"exactly":[106],"integer":[108],"n":[109],"which":[111],"=":[113],"{":[114],"\u2223":[116],")}.":[121],"We":[122],"also":[123],"discuss":[124],"enumerations":[125],"nonempty,":[127],"infinite,":[128],"coinfinite":[130],"meta-r.e.":[132],"sets.":[133]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}