{"id":"https://openalex.org/W2404520472","doi":null,"title":"Recursion Theory I.","display_name":"Recursion Theory I.","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2404520472","mag":"2404520472"},"language":"en","primary_location":{"id":"mag:2404520472","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/afp/afp2008.html#Nedzelsky08","pdf_url":null,"source":{"id":"https://openalex.org/S4306502771","display_name":"Arch. Formal Proofs","issn_l":"2150-914X","issn":["2150-914X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Archive of formal proofs","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5008645444","display_name":"Michael Nedzelsky","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael Nedzelsky","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5008645444"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2008","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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":9.999999747378752e-05,"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/computability","display_name":"computability","score":0.9750000238418579},{"id":"https://openalex.org/keywords/turing-computability","display_name":"Turing computability","score":0.7450000047683716},{"id":"https://openalex.org/keywords/computably-enumerable-sets","display_name":"computably enumerable sets","score":0.7850000262260437},{"id":"https://openalex.org/keywords/turing-degrees","display_name":"Turing degrees","score":0.5580000281333923},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"recursive functions","score":0.4620000123977661}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7798706293106079},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7309021353721619},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5683673620223999},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39298662543296814}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2404520472","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/afp/afp2008.html#Nedzelsky08","pdf_url":null,"source":{"id":"https://openalex.org/S4306502771","display_name":"Arch. Formal Proofs","issn_l":"2150-914X","issn":["2150-914X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Archive of formal proofs","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2056414301"],"related_works":["https://openalex.org/W7098125809","https://openalex.org/W1526907582","https://openalex.org/W4246723850","https://openalex.org/W1895123280","https://openalex.org/W613474278","https://openalex.org/W2231845269","https://openalex.org/W1505497945","https://openalex.org/W6986862838","https://openalex.org/W2213947234","https://openalex.org/W7095728119"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-10-31T12:09:11.096373","created_date":"2016-06-24T00:00:00"}