{"id":"https://openalex.org/W2028774010","doi":"https://doi.org/10.2307/2270617","title":"On the indexing of classes of recursively enumerable sets","display_name":"On the indexing of classes of recursively enumerable sets","publication_year":1966,"publication_date":"1966-03-01","ids":{"openalex":"https://openalex.org/W2028774010","doi":"https://doi.org/10.2307/2270617","mag":"2028774010"},"language":"en","primary_location":{"id":"doi:10.2307/2270617","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2270617","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/A5045989401","display_name":"A. H. Lachlan","orcid":null},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"A. H. Lachlan","raw_affiliation_strings":["The University of Newcastle upon Tyne","The University of Newcastle, Upon Tyne"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Newcastle upon Tyne","institution_ids":["https://openalex.org/I84884186"]},{"raw_affiliation_string":"The University of Newcastle, Upon Tyne","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045989401"],"corresponding_institution_ids":["https://openalex.org/I84884186"],"apc_list":null,"apc_paid":null,"fwci":2.3077,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.87969029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"1","first_page":"10","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9944999814033508,"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"}},"topics":[{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9944999814033508,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9897000193595886,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9747999906539917,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7564138174057007},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.7379589080810547},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6931630969047546},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.684302568435669},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.5155510902404785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5107324123382568},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4898166358470917},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4457281529903412},{"id":"https://openalex.org/keywords/terminology","display_name":"Terminology","score":0.4269043207168579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3722691535949707},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1841481626033783},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.11784067749977112}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7564138174057007},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.7379589080810547},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6931630969047546},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.684302568435669},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.5155510902404785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5107324123382568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4898166358470917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4457281529903412},{"id":"https://openalex.org/C547195049","wikidata":"https://www.wikidata.org/wiki/Q1725664","display_name":"Terminology","level":2,"score":0.4269043207168579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3722691535949707},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1841481626033783},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.11784067749977112},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2270617","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2270617","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/1183735294","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183735294","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":3,"referenced_works":["https://openalex.org/W2086326215","https://openalex.org/W4232725639","https://openalex.org/W4253210619"],"related_works":["https://openalex.org/W1972481159","https://openalex.org/W2037833610","https://openalex.org/W1973052363","https://openalex.org/W2094468224","https://openalex.org/W1980641386","https://openalex.org/W2132512348","https://openalex.org/W2135152748","https://openalex.org/W4249600134","https://openalex.org/W2757989085","https://openalex.org/W1988158368"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,91,142],"follow":[4],"up":[5],"our":[6,108],"work":[7],"in":[8,36,85,105,115,125],"[2]":[9,89,126],"on":[10],"standard":[11,45,58,79,99,129,148],"classes":[12,100],"of":[13,30,39,56,61,68,88,132,146,156],"recursively":[14],"enumerable":[15],"sets,":[16],"and":[17,66,90,154],"it":[18],"will":[19,110],"be":[20,111],"supposed":[21],"that":[22,38,75,127],"the":[23,31,54,86,94,112,121],"reader":[24],"is":[25,51,77,82,139,151],"familiar":[26],"with":[27],"[2].":[28,106,116],"One":[29],"main":[32],"problems":[33],"left":[34],"open":[35],"[2],":[37],"determining":[40],"whether":[41],"or":[42],"not":[43,83,152],"every":[44],"class":[46,59,80,130,149],"has":[47],"a":[48,57,78,147],"least":[49],"member":[50],"resolved":[52],"by":[53],"construction":[55],"all":[60,131,155],"whose":[62,69,133,157],"members":[63,70,134,158],"are":[64,71],"non-empty,":[65],"two":[67],"disjoint.":[72],"This":[73],"shows":[74],"there":[76],"which":[81,101,150],"p.r.":[84,104],"sense":[87],"now":[92],"prefer":[93],"adjective":[95],"sequential":[96,153],"for":[97],"those":[98],"were":[102],"called":[103],"Otherwise":[107],"terminology":[109],"same":[113],"as":[114],"We":[117],"shall":[118],"also":[119],"prove":[120],"theorem":[122],"only":[123],"stated":[124],"any":[128],"have":[135,159],"cardinality":[136,160],"<":[137,161],"3":[138],"sequential.":[140],"Further,":[141],"give":[143],"an":[144],"example":[145],"4.":[162]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}