{"id":"https://openalex.org/W2160161200","doi":"https://doi.org/10.2307/2273299","title":"Recursive constructions in topological spaces","display_name":"Recursive constructions in topological spaces","publication_year":1979,"publication_date":"1979-12-01","ids":{"openalex":"https://openalex.org/W2160161200","doi":"https://doi.org/10.2307/2273299","mag":"2160161200"},"language":"en","primary_location":{"id":"doi:10.2307/2273299","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273299","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/A5001735536","display_name":"Iraj Kalantari","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iraj Kalantari","raw_affiliation_strings":["University of California, Santa Barbara, California 93106"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, California 93106","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087397010","display_name":"Allen Retzlaff","orcid":null},"institutions":[{"id":"https://openalex.org/I103497121","display_name":"Purchase College","ror":"https://ror.org/057trrr89","country_code":"US","type":"education","lineage":["https://openalex.org/I103497121"]},{"id":"https://openalex.org/I117942362","display_name":"Western Illinois University","ror":"https://ror.org/02sshz518","country_code":"US","type":"education","lineage":["https://openalex.org/I117942362"]},{"id":"https://openalex.org/I1327163397","display_name":"State University of New York","ror":"https://ror.org/01q1z8k08","country_code":"US","type":"education","lineage":["https://openalex.org/I1327163397"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Allen Retzlaff","raw_affiliation_strings":["State University of New York, Purchase, New York 10577","Western Illinois University, Macomb, Illinois 61455"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State University of New York, Purchase, New York 10577","institution_ids":["https://openalex.org/I103497121","https://openalex.org/I1327163397"]},{"raw_affiliation_string":"Western Illinois University, Macomb, Illinois 61455","institution_ids":["https://openalex.org/I117942362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2449,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.79513733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"44","issue":"4","first_page":"609","last_page":"625"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987000226974487,"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.9987000226974487,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9908000230789185,"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.9024280309677124},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8379726409912109},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.7562798261642456},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.5871878266334534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5575963854789734},{"id":"https://openalex.org/keywords/topological-space","display_name":"Topological space","score":0.4899136424064636},{"id":"https://openalex.org/keywords/open-set","display_name":"Open set","score":0.4740041196346283},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4515085816383362},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4396286904811859},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.4123508334159851},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.39553266763687134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29946160316467285},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17406883835792542}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9024280309677124},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8379726409912109},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.7562798261642456},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.5871878266334534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5575963854789734},{"id":"https://openalex.org/C81332173","wikidata":"https://www.wikidata.org/wiki/Q179899","display_name":"Topological space","level":2,"score":0.4899136424064636},{"id":"https://openalex.org/C42357961","wikidata":"https://www.wikidata.org/wiki/Q213363","display_name":"Open set","level":2,"score":0.4740041196346283},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4515085816383362},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4396286904811859},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.4123508334159851},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.39553266763687134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29946160316467285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17406883835792542},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.2307/2273299","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2273299","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/1183740469","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183740469","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":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W237194509","https://openalex.org/W1816556148","https://openalex.org/W1975466840","https://openalex.org/W2044827312","https://openalex.org/W2045033949","https://openalex.org/W2059568104","https://openalex.org/W2062135743","https://openalex.org/W2063706894","https://openalex.org/W2086873580","https://openalex.org/W2117832390","https://openalex.org/W2136958030","https://openalex.org/W2149628667","https://openalex.org/W2168321497","https://openalex.org/W2318717756","https://openalex.org/W2530006810","https://openalex.org/W2911772531","https://openalex.org/W3046397786","https://openalex.org/W6665536099","https://openalex.org/W6758896923"],"related_works":["https://openalex.org/W1972481159","https://openalex.org/W2037833610","https://openalex.org/W1973052363","https://openalex.org/W1980641386","https://openalex.org/W2094468224","https://openalex.org/W2132512348","https://openalex.org/W2135152748","https://openalex.org/W4249600134","https://openalex.org/W2467957161","https://openalex.org/W2160161200"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"study":[2],"topological":[3,20],"constructions":[4,25],"in":[5,47,79],"the":[6,11],"recursion":[7,34],"theoretic":[8,35],"framework":[9],"of":[10,13,18,57,71],"lattice":[12],"recursively":[14,28,54,67],"enumerable":[15,29,55,68],"open":[16,30,41,59,73],"subsets":[17],"a":[19,52,66],"space":[21],"X":[22,80],".":[23,81],"Various":[24],"produce":[26],"complemented":[27],"sets":[31,60,74],"with":[32],"additional":[33],"properties,":[36],"as":[37,39],"well":[38],"noncomplemented":[40],"sets.":[42],"In":[43],"contrast":[44],"to":[45,65],"techniques":[46],"classical":[48],"topology,":[49],"we":[50],"construct":[51],"disjoint":[53,69],"collection":[56,70],"basic":[58,72],"which":[61],"cannot":[62],"be":[63],"extended":[64],"whose":[75],"union":[76],"is":[77],"dense":[78]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}