{"id":"https://openalex.org/W2070125090","doi":"https://doi.org/10.1002/malq.19990450405","title":"On a Class of Recursively Enumerable Sets","display_name":"On a Class of Recursively Enumerable Sets","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2070125090","doi":"https://doi.org/10.1002/malq.19990450405","mag":"2070125090"},"language":"en","primary_location":{"id":"doi:10.1002/malq.19990450405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19990450405","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/A5112456454","display_name":"Farzad Didehvar","orcid":null},"institutions":[{"id":"https://openalex.org/I3145578848","display_name":"Institute for Cognitive Science Studies","ror":"https://ror.org/0378cd528","country_code":"IR","type":"facility","lineage":["https://openalex.org/I3145578848"]},{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Farzad Didehvar","raw_affiliation_strings":["Institute for Studies in Theoretical Physics and Mathematics, Niavaran Building, P.O. Box 19395-5746 Tehran, Iran","Institute for Studies in Theoretical Physics and Mathematics, Niavaran Building, P.O. Box 19395\u20105746 Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Studies in Theoretical Physics and Mathematics, Niavaran Building, P.O. Box 19395-5746 Tehran, Iran","institution_ids":["https://openalex.org/I3145578848","https://openalex.org/I4210146419"]},{"raw_affiliation_string":"Institute for Studies in Theoretical Physics and Mathematics, Niavaran Building, P.O. Box 19395\u20105746 Tehran, Iran","institution_ids":["https://openalex.org/I3145578848","https://openalex.org/I4210146419"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112456454"],"corresponding_institution_ids":["https://openalex.org/I3145578848","https://openalex.org/I4210146419"],"apc_list":{"value":2900,"currency":"USD","value_usd":2900},"apc_paid":null,"fwci":0.468,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66304865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"45","issue":"4","first_page":"467","last_page":"470"},"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/T11567","display_name":"semigroups and automata theory","score":0.9851999878883362,"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.9765999913215637,"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/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.9706072807312012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7692089080810547},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.7306993007659912},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.7285420298576355},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.7030744552612305},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.6756137013435364},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5316344499588013},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.5088479518890381},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4192322790622711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3789866268634796},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.2155393362045288},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15240612626075745},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10267385840415955},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.06347361207008362},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.03270295262336731}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9706072807312012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7692089080810547},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.7306993007659912},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.7285420298576355},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.7030744552612305},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.6756137013435364},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5316344499588013},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.5088479518890381},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4192322790622711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3789866268634796},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2155393362045288},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15240612626075745},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10267385840415955},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.06347361207008362},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.03270295262336731},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/malq.19990450405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/malq.19990450405","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W4232277851"],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W2135152748","https://openalex.org/W2069987267","https://openalex.org/W1973052363","https://openalex.org/W1972481159","https://openalex.org/W1980641386","https://openalex.org/W2112189052","https://openalex.org/W2146755812","https://openalex.org/W2007089758","https://openalex.org/W2092992954"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"define":[2],"a":[3,9],"class":[4],"of":[5,12],"so\u2010called":[6],"\u2211(n)\u2010sets":[7],"as":[8],"natural":[10],"closure":[11],"recursively":[13],"enumerable":[14],"sets":[15],"Wn":[16],"under":[17],"the":[18],"relation":[19],"\u201c\u2208\u201d":[20],"and":[21],"study":[22],"its":[23],"properties.":[24]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}