{"doi":"10.1145/74074.74089","title":"Primitive recursion without implicit predecessor","abstract":"<jats:p>\n            The\n            <jats:italic>primitive recursive functions</jats:italic>\n            are the least class of functions on the natural numbers containing the constant, successor, and projection functions, and closed under composition and the rule of primitive recursion. A weakened rule of primitive recursion, lacking implicit predecessor, is shown nevertheless to be adequate for defining all of the primitive recursive functions. However, it is conjectured that the still weaker rule of iteration is not adequate, and it is shown that an easily characterized class of 1-Place functions that includes predecessor cannot be defined when only 0- and 1-place intermediate functions are allowed.\n          </jats:p>","journal":"ACM SIGACT News","year":1989,"id":26560,"datarank":0.0,"base_score":0.0,"endowment":0.0,"self_citation_contribution":0.0,"citation_network_contribution":0.0,"self_endowment_contribution":0.0,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":0,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":153389,"name":"E. Fischer","orcid":null,"position":1,"is_corresponding":false},{"id":153390,"name":"R. Beigel","orcid":null,"position":2,"is_corresponding":false},{"id":153388,"name":"M. J. Fischer","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":0.0,"endowment":0.0,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W2074941524","authors":[],"funders":[],"total_grants":0,"fwci":0.0,"citation_percentile":0.22702703,"influential_citations":0,"citation_trend":[],"oa_status":"closed","license":null,"oa_locations":[{"url":"https://dl.acm.org/doi/pdf/10.1145/74074.74089","host_type":"publisher"},{"url":"https://doi.org/10.1145/74074.74089","host_type":"journal"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.8108","host_type":""}],"fields_of_study":["Numerical Methods and Algorithms","Computability, Logic, AI Algorithms","Logic, programming, and type systems","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Primitive recursive function","Recursion (computer science)","Successor cardinal","Double recursion","Class (philosophy)","Mathematics","Constant (computer programming)","Mutual recursion","Projection (relational algebra)","Computer science","Algebra over a field","Discrete mathematics","Pure mathematics","Algorithm","Programming language","Artificial intelligence"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Reduced inequalities"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T14:53:30.355646Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}