{"id":"https://openalex.org/W2153437969","doi":"https://doi.org/10.1002/malq.19960420116","title":"Strong Minimal Covers for Recursively Enumerable Degrees","display_name":"Strong Minimal Covers for Recursively Enumerable Degrees","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W2153437969","doi":"https://doi.org/10.1002/malq.19960420116","mag":"2153437969"},"language":"en","primary_location":{"id":"doi:10.1002/malq.19960420116","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19960420116","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0044-3050","issn":["0044-3050","0942-5616","1521-3870"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Logic Quarterly","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"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"S. Barry Cooper","raw_affiliation_strings":["School of Mathematics, University of Leeds, Leeds LS2 9JT, England"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Leeds, Leeds LS2 9JT, England","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076862599"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":{"value":2630,"currency":"USD","value_usd":2630},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24444242,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"42","issue":"1","first_page":"191","last_page":"196"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9970999956130981,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.988099992275238,"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.9746724963188171},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7257247567176819},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.6961280107498169},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.6680946350097656},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.5381859540939331},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5022900104522705},{"id":"https://openalex.org/keywords/mathematics-subject-classification","display_name":"Mathematics Subject Classification","score":0.47368577122688293},{"id":"https://openalex.org/keywords/subject","display_name":"Subject (documents)","score":0.46030500531196594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4335615038871765},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41711798310279846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1805317997932434},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.07112547755241394},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.03154808282852173}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9746724963188171},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7257247567176819},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.6961280107498169},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.6680946350097656},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.5381859540939331},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5022900104522705},{"id":"https://openalex.org/C2778778035","wikidata":"https://www.wikidata.org/wiki/Q967960","display_name":"Mathematics Subject Classification","level":2,"score":0.47368577122688293},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.46030500531196594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4335615038871765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41711798310279846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1805317997932434},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.07112547755241394},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.03154808282852173},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/malq.19960420116","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19960420116","pdf_url":null,"source":{"id":"https://openalex.org/S172351290","display_name":"Mathematical logic quarterly","issn_l":"0044-3050","issn":["0044-3050","0942-5616","1521-3870"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Logic Quarterly","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6600000262260437,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W623765668","https://openalex.org/W1483777631","https://openalex.org/W2031067254","https://openalex.org/W2060075008","https://openalex.org/W2068010537","https://openalex.org/W2145265838","https://openalex.org/W2500837594","https://openalex.org/W4241435086","https://openalex.org/W4242335196","https://openalex.org/W4245791855"],"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/W2000487993","https://openalex.org/W1980641386","https://openalex.org/W798745779"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"that":[3],"there":[4],"exists":[5],"a":[6,13],"nonzero":[7],"recursively":[8],"enumerable":[9],"Turing":[10],"degree":[11],"possessing":[12],"strong":[14],"minimal":[15],"cover.":[16],"Mathematics":[17],"Subject":[18],"Classification:":[19],"03D30.":[20]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}