{"id":"https://openalex.org/W2012510970","doi":"https://doi.org/10.1305/ndjfl/1093883046","title":"Constructively nonpartial recursive functions.","display_name":"Constructively nonpartial recursive functions.","publication_year":1980,"publication_date":"1980-04-01","ids":{"openalex":"https://openalex.org/W2012510970","doi":"https://doi.org/10.1305/ndjfl/1093883046","mag":"2012510970"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093883046","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883046","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-21/issue-2/Constructively-nonpartial-recursive-functions/10.1305/ndjfl/1093883046.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-21/issue-2/Constructively-nonpartial-recursive-functions/10.1305/ndjfl/1093883046.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072582637","display_name":"Bruce M. Horowitz","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bruce M. Horowitz","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072582637"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.15353353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.7687000036239624,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.7687000036239624,"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/T10820","display_name":"Fuzzy Logic and Control Systems","score":0.7038000226020813,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.6854000091552734,"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/mathematics","display_name":"Mathematics","score":0.4031808078289032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3930946886539459},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.36861300468444824},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.0914640724658966}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4031808078289032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3930946886539459},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.36861300468444824},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0914640724658966},{"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/1093883046","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883046","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-21/issue-2/Constructively-nonpartial-recursive-functions/10.1305/ndjfl/1093883046.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/1093883046","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093883046","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/1093883046","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883046","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-21/issue-2/Constructively-nonpartial-recursive-functions/10.1305/ndjfl/1093883046.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/W2012510970.pdf","grobid_xml":"https://content.openalex.org/works/W2012510970.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W2131821154"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053"],"abstract_inverted_index":{"called":[0],"a":[1,34],"total":[2],"function":[3,11,28,36],"f(x)":[4,37,61],"constructively":[5,40,63],"nonrecursive":[6],"iff":[7,43],"for":[8,18,44,55],"some":[9,45],"recursive":[10,27,42,46,65],"g{x),":[12],"f{g(n))":[13],"n":[14,16,22,49],"(g(":[15],"))":[17],"all":[19],"neN,":[20],"where":[21,51],"(x)":[23],"is":[24,53,62],"the":[25],"partial":[26,35,56],"with":[29],"index":[30],"n.":[31],"We":[32,58],"define":[33],"to":[38],"be":[39],"nonpartial":[41,64],"g(x),":[47],"f(g(n))":[48],"(g(n)),":[50],"^":[52],"equality":[54],"functions.":[57],"say":[59],"that":[60],"viagix).":[66]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}