{"id":"https://openalex.org/W1514076924","doi":"https://doi.org/10.2307/2271094","title":"\u03a0<sub>1</sub><sup>1</sup> Sets, \u03c9-Sets, and metacompleteness","display_name":"\u03a0<sub>1</sub><sup>1</sup> Sets, \u03c9-Sets, and metacompleteness","publication_year":1969,"publication_date":"1969-07-25","ids":{"openalex":"https://openalex.org/W1514076924","doi":"https://doi.org/10.2307/2271094","mag":"1514076924"},"language":"en","primary_location":{"id":"doi:10.2307/2271094","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2271094","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":1.5197,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85141563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"2","first_page":"194","last_page":"204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.996999979019165,"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.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7872353792190552},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.7309310436248779},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.7294454574584961},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.7043047547340393},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6168384552001953},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.6128062605857849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5362861156463623},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5199033617973328},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.4983632564544678},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4907711446285248},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4588192105293274},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4454939663410187},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.43667811155319214},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11249899864196777}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7872353792190552},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.7309310436248779},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.7294454574584961},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7043047547340393},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6168384552001953},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.6128062605857849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5362861156463623},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5199033617973328},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.4983632564544678},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4907711446285248},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4588192105293274},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4454939663410187},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.43667811155319214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11249899864196777},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2271094","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2271094","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":[{"id":"https://metadata.un.org/sdg/10","score":0.5199999809265137,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1999737391","https://openalex.org/W2020644113","https://openalex.org/W2053099695","https://openalex.org/W2092093189","https://openalex.org/W2315610131","https://openalex.org/W4236845086","https://openalex.org/W6650195917","https://openalex.org/W6673501150","https://openalex.org/W6809209440"],"related_works":["https://openalex.org/W2394135826","https://openalex.org/W2037833610","https://openalex.org/W1548215338","https://openalex.org/W2112189052","https://openalex.org/W2332645982","https://openalex.org/W1980641386","https://openalex.org/W1973052363","https://openalex.org/W2027425687","https://openalex.org/W4249197406","https://openalex.org/W1514076924"],"abstract_inverted_index":{"An":[0],"\u03c9-set":[1],"is":[2,17,68,80,156,159],"a":[3,61,82,89,143,151],"subset":[4,152],"of":[5,32,44,50,91,102,116,128,133,145,153],"the":[6,14,30,42,45,51,86,100,113,122,129,146,154],"recursive":[7,15],"ordinals":[8,16],"whose":[9],"complement":[10],"with":[11,48],"respect":[12],"to":[13,36],"unbounded":[18],"and":[19,104,135],"has":[20,26],"order":[21],"type":[22],"\u03c9.":[23],"This":[24],"concept":[25],"proved":[27],"fruitful":[28],"in":[29,34,71],"study":[31],"sets":[33,46],"relation":[35,84],"metarecursion":[37],"theory.":[38],"We":[39,54,120],"prove":[40],"that":[41,76],"metadegrees":[43],"coincide":[47],"those":[49],"meta-r.e.":[52],"\u03c9-sets.":[53],"then":[55,74],"show":[56],"that,":[57],"given":[58],"any":[59],"set,":[60],"metacomplete":[62],"set":[63],"can":[64],"be":[65],"found":[66],"which":[67],"weakly":[69],"metarecursive":[70],"it.":[72],"It":[73],"follows":[75],"weak":[77,117],"relative":[78,118],"metarecursiveness":[79],"not":[81],"transitive":[83,114],"on":[85],"sets,":[87],"extending":[88],"result":[90],"G.":[92],"Driscoll":[93],"[2,":[94],"Theorem":[95],"3.1].":[96],"Coincidentally,":[97],"we":[98,108],"discuss":[99],"notions":[101],"total":[103],"complete":[105],"regularity.":[106],"Finally,":[107],"solve":[109],"Post's":[110],"problem":[111],"for":[112],"closure":[115],"metarecursiveness.":[119],"recommend":[121],"reader":[123],"look":[124],"at":[125],"pp.":[126],"324\u2013328":[127],"fundamental":[130],"article":[131],"[6]":[132],"Kreisel":[134],"Sacks":[136],"before":[137],"proceeding.":[138],"He":[139],"will":[140],"find":[141],"there":[142],"proof":[144],"following":[147],"very":[148],"basic":[149],"fact:":[150],"integers":[155],"iff":[157],"it":[158],"metarecursively":[160],"enumerable":[161],"(metafinite).":[162]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}