{"id":"https://openalex.org/W2167819410","doi":"https://doi.org/10.2307/2272849","title":"Minimal pairs and high recursively enumerable degrees","display_name":"Minimal pairs and high recursively enumerable degrees","publication_year":1974,"publication_date":"1974-12-01","ids":{"openalex":"https://openalex.org/W2167819410","doi":"https://doi.org/10.2307/2272849","mag":"2167819410"},"language":"en","primary_location":{"id":"doi:10.2307/2272849","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272849","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/A5076862599","display_name":"S. Barry Cooper","orcid":"https://orcid.org/0000-0001-5103-0400"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"S. B. Cooper","raw_affiliation_strings":["University of California, Berkeley, California 94720","University of Leeds, Leeds, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, California 94720","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of Leeds, Leeds, England","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076862599"],"corresponding_institution_ids":["https://openalex.org/I130828816","https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.2987436,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"39","issue":"4","first_page":"655","last_page":"660"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9882000088691711,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9787999987602234,"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.9584897756576538},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.753079891204834},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.7036275863647461},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6401922106742859},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.5191473364830017},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5009033679962158},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4562796354293823},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.43910741806030273},{"id":"https://openalex.org/keywords/tower","display_name":"Tower","score":0.42893242835998535},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3346762955188751},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.18273749947547913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09963297843933105},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.05613836646080017}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9584897756576538},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.753079891204834},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7036275863647461},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6401922106742859},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.5191473364830017},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5009033679962158},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4562796354293823},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.43910741806030273},{"id":"https://openalex.org/C2777831296","wikidata":"https://www.wikidata.org/wiki/Q12518","display_name":"Tower","level":2,"score":0.42893242835998535},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3346762955188751},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.18273749947547913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09963297843933105},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.05613836646080017},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","level":1,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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":2,"locations":[{"id":"doi:10.2307/2272849","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2272849","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"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183739271","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183739271","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1984887166","https://openalex.org/W2006726677","https://openalex.org/W2051601785","https://openalex.org/W2143629347","https://openalex.org/W6652101068","https://openalex.org/W6681110080"],"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/W2757989085"],"abstract_inverted_index":{"A.":[0],"H.":[1],"Lachlan":[2,21,157,165],"[2]":[3,166],"and":[4,22,126,142,249],"C.":[5],"E.":[6],"M.":[7],"Yates":[8],"[4]":[9],"independently":[10],"showed":[11],"that":[12,28,71,130,206,234],"minimal":[13,37,60,79,158],"pairs":[14],"of":[15,39,98,182,199],"recursively":[16,108,121],"enumerable":[17,109,122],"(r.e.)":[18],"degrees":[19,41,123],"exist.":[20],"Richard":[23],"Ladner":[24],"have":[25],"shown":[26,69],"(unpublished)":[27],"there":[29,119],"is":[30,49,68,84,153,260],"no":[31],"uniform":[32],"method":[33],"for":[34,111,137,244],"producing":[35],"a":[36,43,58,77,92,105,107,113,136,178,185,232],"pair":[38,160],"r.e.":[40,46,55,59,74,78,82,159,179],"below":[42],"given":[44],"nonzero":[45,54],"degree.":[47],"It":[48],"not":[50],"known":[51],"whether":[52],"every":[53,72,210],"degree":[56,75,83,110,184],"bounds":[57,76],"pair,":[61],"but":[62],"in":[63,95,230],"the":[64,96,156,183],"present":[65],"paper":[66],"it":[67,90],"(uniformly)":[70],"high":[73,88,93],"pair.":[80],"(A":[81],"said":[85],"to":[86,202],"be":[87,106],"if":[89],"contains":[91],"set":[94],"sense":[97],"Robert":[99],"W.":[100],"Robinson":[101,173],"[3].)":[102],"Theorem.":[103],"Let":[104],"which":[112],"\u2032":[114],"=":[115,148],"0":[116,125,131,144,149],"\u2033.":[117],"Then":[118],"are":[120],"b":[124,127,133,143,146],"1":[128,147,240],"such":[129,205,231],"<":[132,135],"i":[134,139,224,236,254],"each":[138,245],"\u2264":[140,225,255],"1,":[141,226,256],"\u22c2":[145],".":[150],"The":[151],"proof":[152],"based":[154],"on":[155],"construction.":[161],"For":[162],"notation":[163],"see":[164],"or":[167],"S.":[168],"B.":[169],"Cooper":[170],"[1].":[171],"By":[172],"[3]":[174],"we":[175],"can":[176],"choose":[177],"representative":[180],"A":[181,192,203,208],",":[186,194,204,223,237,248],"with":[187],"uniformly":[188,261],"recursive":[189,211],"tower":[190],"{":[191,250],"s":[193,196,227,238,247,257],"\u2223":[195,253],"\u2265":[197,228,258],"0}":[198,259],"finite":[200,219],"approximations":[201],"C":[207],"dominates":[209],"function":[212],"where":[213],"We":[214],"define,":[215],"stage":[216],"by":[217],"stage,":[218],"sets":[220],"B":[221,235,242,251],"i,s":[222,243,252],"0,":[229],"way":[233],"+":[239],"\u2287":[241],"i,":[246],"recursive.":[262]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}