{"id":"https://openalex.org/W2102130396","doi":"https://doi.org/10.2307/2269950","title":"A splitting theorem for simple \u03a0<sub>1</sub><sup>1</sup> Sets","display_name":"A splitting theorem for simple \u03a0<sub>1</sub><sup>1</sup> Sets","publication_year":1971,"publication_date":"1971-09-01","ids":{"openalex":"https://openalex.org/W2102130396","doi":"https://doi.org/10.2307/2269950","mag":"2102130396"},"language":"en","primary_location":{"id":"doi:10.2307/2269950","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2269950","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,College Park, Maryland 20742","University of Maryland College Park, Maryland 20742"],"affiliations":[{"raw_affiliation_string":"University of Maryland,College Park, Maryland 20742","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland College Park, Maryland 20742","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.5397,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67599661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"3","first_page":"433","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9977999925613403,"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.9977999925613403,"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.9934999942779541,"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/corollary","display_name":"Corollary","score":0.8601377606391907},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8277373313903809},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.734703779220581},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7244727611541748},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6573799252510071},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.6046971082687378},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5972257256507874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5909260511398315},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5445743203163147},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5045913457870483},{"id":"https://openalex.org/keywords/computability-theory","display_name":"Computability theory","score":0.4994199275970459},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46204066276550293},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.4293317198753357},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.4255506992340088},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4165729880332947},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1400500237941742},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10128802061080933}],"concepts":[{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.8601377606391907},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8277373313903809},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.734703779220581},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7244727611541748},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6573799252510071},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.6046971082687378},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5972257256507874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5909260511398315},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5445743203163147},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5045913457870483},{"id":"https://openalex.org/C111142201","wikidata":"https://www.wikidata.org/wiki/Q818930","display_name":"Computability theory","level":2,"score":0.4994199275970459},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46204066276550293},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.4293317198753357},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.4255506992340088},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4165729880332947},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1400500237941742},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10128802061080933},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2307/2269950","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2269950","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2070390550","https://openalex.org/W2092093189","https://openalex.org/W4236845086"],"related_works":["https://openalex.org/W4388310202","https://openalex.org/W2310420552","https://openalex.org/W2133902039","https://openalex.org/W1589207578","https://openalex.org/W2936847277","https://openalex.org/W167110062","https://openalex.org/W4247035339","https://openalex.org/W1161578261","https://openalex.org/W4597164","https://openalex.org/W90338445"],"abstract_inverted_index":{"As":[0,169],"was":[1,91,127],"first":[2],"mentioned":[3],"in":[4,129,153],"[3,":[5],"\u00a75],":[6],"if":[7],"A":[8,13,44,156,164],"is":[9,14,30,43,55,116,157],"any":[10,77,110],"\u2013":[11,20,147],"set,":[12],"the":[15,117,130,143,154,161,174],"union":[16,118],"of":[17,71,119,125,163],"two":[18,87,120],"disjoint":[19,121],"sets":[21,123,148],"B":[22,24],"(0),":[23],"(1).":[25],"In":[26,136],"metarecursion":[27],"theory":[28],"this":[29,137],"proven":[31,189],"as":[32],"follows.":[33],"Let":[34],"\u0192":[35],"be":[36,48,84],"a":[37,99,132,170,178],"one-to-one":[38],"metarecursive":[39,51],"function":[40],"whose":[41,53],"range":[42],",":[45],"let":[46],"R":[47],"an":[49],"unbounded":[50],"set":[52,59,82,115],"complement":[54,162],"also":[56],"unbounded,":[57],"and":[58],"B(0)":[60],"=":[61,64],"f(R),":[62],"B(1)":[63],"f":[65],"(":[66],").":[67],"The":[68],"corresponding":[69],"fact":[70,179],"ordinary":[72],"recursion":[73],"theory,":[74],"namely":[75],"that":[76,109],"r.e.":[78,111,122],"but":[79,112,150,187],"not":[80,113],"recursive":[81,114,128],"can":[83],"split":[85],"into":[86],"other":[88],"such":[89],"sets,":[90],"proved":[92],"by":[93,182,190],"Friedberg":[94],"[2,":[95],"Theorem":[96],"1],":[97,186],"using":[98],"clever":[100],"priority":[101],"argument.":[102],"Sacks":[103,183],"[7,":[104],"Corollary":[105,185],"2]":[106],"then":[107],"showed":[108],"neither":[124],"which":[126],"other,":[131],"much":[133],"stronger":[134],"result.":[135],"paper":[138],"we":[139,172],"attempt":[140],"to":[141],"prove":[142],"analogous":[144],"result":[145],"for":[146,192],"A,":[149],"succeed":[151],"only":[152,188],"case":[155],"simple":[158],";":[159],"i.e.,":[160],"contains":[165],"no":[166],"infinite":[167],"subset.":[168],"corollary":[171],"show":[173],"metadegrees":[175],"are":[176],"dense,":[177],"already":[180],"announced":[181],"[8,":[184],"him":[191],"nonzero":[193],"metadegrees.":[194]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}