{"id":"https://openalex.org/W2001675196","doi":"https://doi.org/10.1305/ndjfl/1093888011","title":"Recursive and recursively enumerable manifolds. II.","display_name":"Recursive and recursively enumerable manifolds. II.","publication_year":1977,"publication_date":"1977-07-01","ids":{"openalex":"https://openalex.org/W2001675196","doi":"https://doi.org/10.1305/ndjfl/1093888011","mag":"2001675196"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093888011","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888011","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-18/issue-3/Recursive-and-recursively-enumerable-manifolds-II/10.1305/ndjfl/1093888011.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-18/issue-3/Recursive-and-recursively-enumerable-manifolds-II/10.1305/ndjfl/1093888011.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046787543","display_name":"Vladeta Vu\u010dkovi\u0107","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vladeta Vu\u010dkovi\u0107","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046787543"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13706086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9531000256538391,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9531000256538391,"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/T10588","display_name":"Mathematical Dynamics and Fractals","score":0.9381999969482422,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T10304","display_name":"Geometric and Algebraic Topology","score":0.9301999807357788,"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.9455167651176453},{"id":"https://openalex.org/keywords/recursively-enumerable-set","display_name":"Recursively enumerable set","score":0.49313682317733765},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.48641014099121094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48536765575408936},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.320734441280365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31045812368392944},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12078902125358582}],"concepts":[{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.9455167651176453},{"id":"https://openalex.org/C52703633","wikidata":"https://www.wikidata.org/wiki/Q676835","display_name":"Recursively enumerable set","level":3,"score":0.49313682317733765},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.48641014099121094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48536765575408936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.320734441280365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31045812368392944},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12078902125358582},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093888011","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888011","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-18/issue-3/Recursive-and-recursively-enumerable-manifolds-II/10.1305/ndjfl/1093888011.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093888011","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093888011","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":{"id":"doi:10.1305/ndjfl/1093888011","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093888011","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-18/issue-3/Recursive-and-recursively-enumerable-manifolds-II/10.1305/ndjfl/1093888011.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2001675196.pdf","grobid_xml":"https://content.openalex.org/works/W2001675196.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2037833610","https://openalex.org/W2135152748","https://openalex.org/W1972481159","https://openalex.org/W2069987267","https://openalex.org/W1973052363","https://openalex.org/W1980641386","https://openalex.org/W2112189052","https://openalex.org/W4249600134","https://openalex.org/W2007089758","https://openalex.org/W2142539551"],"abstract_inverted_index":{"The":[0],"most":[1],"unpleasant":[2],"feature":[3],"of":[4,7,12,57,66,82,89,98,106],"the":[5,74,80],"Theory":[6],"REM's":[8,58],"is":[9,52,85,94],"that":[10],"compositions":[11],"recursive":[13,29,38],"maps":[14,39],"are":[15],"not":[16],"necessarily":[17],"recursive.":[18],"I":[19,69],"shall":[20],"remedy":[21],"this":[22,50],"situation":[23],"by":[24],"considering":[25],"some":[26],"more":[27,61],"restricted":[28],"maps,":[30,60],"morphisms.":[31],"Obviously,":[32],"morphisms":[33],"will":[34],"reduce":[35],"to":[36,53,78],"classical":[37,75],"in":[40,49],"case":[41],"we":[42],"consider":[43],"enumerated":[44,90],"sets":[45],"only.":[46],"My":[47],"aim":[48],"chapter*":[51],"start":[54],"a":[55],"classification":[56,88,105],"using":[59],"exactly:":[62],"morphisms,":[63],"between":[64],"pairs":[65],"REM's.":[67,107],"Here,":[68],"have":[70],"no":[71],"analogy":[72],"with":[73],"enumeration":[76],"theory":[77],"follow:":[79],"content":[81],"Chapter":[83],"III":[84],"sufficient":[86],"for":[87,96,104],"sets;":[91],"however,":[92],"it":[93],"useless":[95],"comparison":[97],"atlases":[99],"on":[100],"disjoint":[101],"sets,":[102],"and":[103]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}