{"id":"https://openalex.org/W1498614655","doi":"https://doi.org/10.1007/978-3-642-03409-1_5","title":"Independence Results for n-Ary Recursion Theorems","display_name":"Independence Results for n-Ary Recursion Theorems","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1498614655","doi":"https://doi.org/10.1007/978-3-642-03409-1_5","mag":"1498614655"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-03409-1_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03409-1_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5111850796","display_name":"John Case","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Case","raw_affiliation_strings":["Department of Computer & Information Sciences, University of Delaware, 101 Smith Hall, Newark, DE, 19716"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Sciences, University of Delaware, 101 Smith Hall, Newark, DE, 19716","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035681422","display_name":"Samuel E. Moelius","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samuel E. Moelius","raw_affiliation_strings":["Department of Computer & Information Sciences, University of Delaware, 101 Smith Hall, Newark, DE, 19716"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer & Information Sciences, University of Delaware, 101 Smith Hall, Newark, DE, 19716","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86501945"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.8068,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82912404,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"38","last_page":"49"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9940999746322632,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9919000267982483,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.9044711589813232},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.848649263381958},{"id":"https://openalex.org/keywords/double-recursion","display_name":"Double recursion","score":0.8039181232452393},{"id":"https://openalex.org/keywords/mutual-recursion","display_name":"Mutual recursion","score":0.6064968109130859},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5034064650535583},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.5012080669403076},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.45250922441482544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.450531005859375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3346433639526367},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2548040449619293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16781115531921387},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06951016187667847},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.06525281071662903}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.9044711589813232},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.848649263381958},{"id":"https://openalex.org/C139503435","wikidata":"https://www.wikidata.org/wiki/Q5300083","display_name":"Double recursion","level":3,"score":0.8039181232452393},{"id":"https://openalex.org/C124416688","wikidata":"https://www.wikidata.org/wiki/Q3454656","display_name":"Mutual recursion","level":3,"score":0.6064968109130859},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5034064650535583},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.5012080669403076},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.45250922441482544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.450531005859375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3346433639526367},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2548040449619293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16781115531921387},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06951016187667847},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.06525281071662903}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-03409-1_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-03409-1_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W182159370","https://openalex.org/W245191144","https://openalex.org/W1498102178","https://openalex.org/W1498614655","https://openalex.org/W1533976297","https://openalex.org/W1579083493","https://openalex.org/W1590000405","https://openalex.org/W1606278437","https://openalex.org/W1677489834","https://openalex.org/W1890162511","https://openalex.org/W1962674228","https://openalex.org/W1963812473","https://openalex.org/W1993449345","https://openalex.org/W1995925155","https://openalex.org/W1998555378","https://openalex.org/W2001685400","https://openalex.org/W2022959407","https://openalex.org/W2035004935","https://openalex.org/W2038703620","https://openalex.org/W2060162960","https://openalex.org/W2077694941","https://openalex.org/W2117439212","https://openalex.org/W2117832390","https://openalex.org/W2127316662","https://openalex.org/W2321664493","https://openalex.org/W2490632526","https://openalex.org/W2496648760","https://openalex.org/W2502634929","https://openalex.org/W2530006810","https://openalex.org/W2752853835","https://openalex.org/W2905135108","https://openalex.org/W4214629925","https://openalex.org/W4247557026"],"related_works":["https://openalex.org/W2006836388","https://openalex.org/W2896379815","https://openalex.org/W2155605358","https://openalex.org/W2374742784","https://openalex.org/W223586891","https://openalex.org/W1563586960","https://openalex.org/W560887346","https://openalex.org/W1509114718","https://openalex.org/W4246540581","https://openalex.org/W2065302945"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}