{"id":"https://openalex.org/W2075824323","doi":"https://doi.org/10.1305/ndjfl/1093956080","title":"Functionals defined by recursion.","display_name":"Functionals defined by recursion.","publication_year":1967,"publication_date":"1967-07-01","ids":{"openalex":"https://openalex.org/W2075824323","doi":"https://doi.org/10.1305/ndjfl/1093956080","mag":"2075824323"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093956080","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956080","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-8/issue-3/Functionals-defined-by-recursion/10.1305/ndjfl/1093956080.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-8/issue-3/Functionals-defined-by-recursion/10.1305/ndjfl/1093956080.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050888128","display_name":"Luis E. Sanchis","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Luis Elpidio Sanchis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050888128"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":43,"citation_normalized_percentile":{"value":0.12364839,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"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/T10142","display_name":"Formal Methods in Verification","score":0.9757000207901001,"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.972599983215332,"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/recursion","display_name":"Recursion (computer science)","score":0.8168874979019165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4761093556880951},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.45474502444267273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3757745027542114},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3539629578590393},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.308758020401001},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22229844331741333},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.08019837737083435}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8168874979019165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4761093556880951},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.45474502444267273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3757745027542114},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3539629578590393},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.308758020401001},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22229844331741333},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.08019837737083435},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093956080","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956080","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-8/issue-3/Functionals-defined-by-recursion/10.1305/ndjfl/1093956080.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/1093956080","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093956080","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/1093956080","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093956080","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-8/issue-3/Functionals-defined-by-recursion/10.1305/ndjfl/1093956080.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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2075824323.pdf","grobid_xml":"https://content.openalex.org/works/W2075824323.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1604506695","https://openalex.org/W1997417106","https://openalex.org/W2064184161","https://openalex.org/W2147234020","https://openalex.org/W4250432112","https://openalex.org/W4256131047","https://openalex.org/W6600049259","https://openalex.org/W6604444102"],"related_works":["https://openalex.org/W3106133691","https://openalex.org/W4249580765","https://openalex.org/W2096753949","https://openalex.org/W1985218657","https://openalex.org/W1557945163","https://openalex.org/W2963341196","https://openalex.org/W2023661790","https://openalex.org/W3124205579","https://openalex.org/W2073994398","https://openalex.org/W3134646037"],"abstract_inverted_index":{"Recursive":[0],"functionals":[1,17,41,46],"of":[2,16,25,55,58],"finite":[3,26],"type":[4,27],"have":[5],"been":[6],"studied":[7,42],"by":[8,22,43,48,65],"several":[9],"authors":[10],"in":[11,61,67],"recent":[12],"years.":[13],"The":[14],"class":[15],"that":[18],"can":[19],"be":[20],"defined":[21,47],"primitive":[23],"recursion":[24,49],"is":[28],"certainly":[29],"more":[30,34],"constructive":[31],"than":[32],"other":[33],"inclusive":[35],"classes,":[36],"as":[37],"the":[38,53,62],"general":[39],"recursive":[40],"Kleene.":[44],"Moreover":[45],"are":[50],"sufficient":[51],"for":[52],"interpretation":[54],"formal":[56],"systems":[57],"number":[59],"theory":[60],"manner":[63],"described":[64],"Godel":[66]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}