{"id":"https://openalex.org/W1980476861","doi":"https://doi.org/10.2307/421206","title":"Definable Encodings in the Computably Enumerable Sets","display_name":"Definable Encodings in the Computably Enumerable Sets","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W1980476861","doi":"https://doi.org/10.2307/421206","mag":"1980476861"},"language":"en","primary_location":{"id":"doi:10.2307/421206","is_oa":false,"landing_page_url":"https://doi.org/10.2307/421206","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"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":"Bulletin 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/A5062882161","display_name":"Peter Cholak","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peter A. Cholak","raw_affiliation_strings":["Department of Mathematics, University Of Notre Dame, Notre Dame, IN 46556-5683, USA E-mail:","University of Notre Dame"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University Of Notre Dame, Notre Dame, IN 46556-5683, USA E-mail:","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"University of Notre Dame","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103437344","display_name":"Leo Harrington","orcid":null},"institutions":[{"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"]},{"id":"https://openalex.org/I2803209242","display_name":"University of California System","ror":"https://ror.org/00pjdza24","country_code":"US","type":"education","lineage":["https://openalex.org/I2803209242"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leo A. Harrington","raw_affiliation_strings":["Department of Mathematics, University Of California, Berkeley, CA 94720-3840, USA E-mail:","University of California"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University Of California, Berkeley, CA 94720-3840, USA E-mail:","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California","institution_ids":["https://openalex.org/I2803209242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062882161"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.9369,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.74704579,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"6","issue":"2","first_page":"185","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.9998000264167786,"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.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9538999795913696,"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9531000256538391,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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.8088488578796387},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.6463839411735535},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.560185432434082},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.5200245380401611},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.49331608414649963},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.49073326587677},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.44359642267227173},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27358561754226685}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8088488578796387},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.6463839411735535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.560185432434082},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.5200245380401611},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.49331608414649963},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.49073326587677},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.44359642267227173},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27358561754226685}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2307/421206","is_oa":false,"landing_page_url":"https://doi.org/10.2307/421206","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"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":"Bulletin of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.bsl/1182353686","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.bsl/1182353686","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.140.6369","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.6369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nd.edu/~cholak/papers/bsl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.6252","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6252","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nd.edu/~cholak/./papers/bsl.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W27019768","https://openalex.org/W1496446432","https://openalex.org/W1510551874","https://openalex.org/W1595904906","https://openalex.org/W1965251765","https://openalex.org/W1975466840","https://openalex.org/W1983705661","https://openalex.org/W1991182213","https://openalex.org/W1992701385","https://openalex.org/W2005402036","https://openalex.org/W2029116149","https://openalex.org/W2039559454","https://openalex.org/W2049442092","https://openalex.org/W2056414301","https://openalex.org/W2073407285","https://openalex.org/W2101746971","https://openalex.org/W2130173926","https://openalex.org/W2150311525","https://openalex.org/W2168058676","https://openalex.org/W2315181607","https://openalex.org/W2914247088","https://openalex.org/W4232277851"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W1972481159","https://openalex.org/W1973052363","https://openalex.org/W2000487993","https://openalex.org/W2094468224","https://openalex.org/W1980641386","https://openalex.org/W2132512348","https://openalex.org/W2089792255","https://openalex.org/W943848606","https://openalex.org/W2914940747"],"abstract_inverted_index":{"The":[0,77],"purpose":[1],"of":[2,21,33,48,51,58,72,159,169,185,216,221],"this":[3],"communication":[4],"is":[5,44,79,85,164,173,175,180,199],"to":[6,195,211],"announce":[7],"some":[8,124],"recent":[9],"results":[10,40],"on":[11],"the":[12,23,29,34,46,49,62,70,73,130,152,157,213,219],"computably":[13,35,63,74,92,101],"enumerable":[14,36,64,75,93,102],"sets.":[15,37,65,76,223],"There":[16],"are":[17,112,187],"two":[18],"disjoint":[19],"sets":[20,89,95],"results;":[22],"first":[24],"involves":[25,31],"invariant":[26],"classes":[27],"and":[28,96,103,110,114,126,144],"second":[30],"automorphisms":[32],"What":[38],"these":[39,52],"have":[41],"in":[42,69,141,177],"common":[43],"that":[45],"guts":[47],"proofs":[50],"theorems":[53],"uses":[54],"a":[55,165,191],"new":[56],"form":[57],"definable":[59,166,176],"coding":[60],"for":[61],"We":[66,148,208],"will":[67,90,99,120,149],"work":[68],"structure":[71,84,154,168],"language":[78],"just":[80],"inclusion,":[81],"\u2286.":[82],"This":[83],"called":[86],"\u03b5.":[87],"All":[88],"be":[91,100],"non-computable":[94,206],"all":[97,183],"degrees":[98],"non-computable,":[104],"unless":[105],"otherwise":[106],"noted.":[107],"Our":[108],"notation":[109,127],"definitions":[111,125],"standard":[113],"follow":[115,140],"Soare":[116,135],"[1987];":[117],"however":[118],"we":[119],"warm":[121],"up":[122],"with":[123],"issues":[128],"so":[129],"reader":[131],"need":[132],"not":[133],"consult":[134],"[1987].":[136],"Some":[137],"historical":[138],"remarks":[139],"Section":[142,146],"2.1":[143],"throughout":[145],"3.":[147],"also":[150],"consider":[151],"quotient":[153,167],"\u03b5":[155,170],"modulo":[156],"ideal":[158,220],"finite":[160,222],"sets,":[161],"\u03b5*.":[162],"\u03b5*":[163],"since":[171],"\u201c\u03a7":[172,179],"finite\u201d":[174,181],"\u03b5;":[178],"iff":[182],"subsets":[184],"\u03a7":[186,198,202],"computable":[188],"(it":[189],"takes":[190],"little":[192],"computability":[193],"theory":[194],"show":[196],"if":[197],"infinite":[200,205],"then":[201],"has":[203],"an":[204],"subset).":[207],"use":[209],"A*":[210],"denote":[212],"equivalent":[214],"class":[215],"A":[217],"under":[218]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}