Primitive recursive function

Definition

In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all "for" loops. Primitive recursive functions form a strict subset of those general recursive functions that are also total functions.

Related concepts

Abstract logic Ackermann function Ackermann set theory Addition Albert R. Meyer Aleph number Algebraic logic Alphabet (formal languages)Argument Arity Atomic formula Atomic model (mathematical logic)Atomic sentence Automata theory Automated theorem proving Axiom Axiom of choice Axiom schema Axiomatic system Axiomatization of Boolean algebras Banach–Tarski paradox Bijection Binary operation BlooP and FlooP Boolean algebra Boolean algebras canonically defined Boolean function Bulletin of the American Mathematical Society Cantor's diagonal argument Cantor's paradox Cantor's theorem Cardinality Cartesian product Categorical theory Category (mathematics)Category of sets Category theory Church encoding Church–Turing thesis Class (set theory)Classical logic Codomain Compactness theorem Complement (set theory)Complete theory Computability theory Computable function Computable set Computably enumerable set Computational complexity theory Computer program Concrete category Conservative extension Consistency Consistency proof Constructible universe Construction of the real numbers Constructive set theory Continuum hypothesis Countable set Course-of-values recursion Cristopher Moore Decidability (logic)Decision problem Deductive system Dennis M. Ritchie Dennis Ritchie Diagonal lemma Diagram (mathematical logic)Disjunction Division (mathematics)Domain of a function Double recursion Douglas Hofstadter Element (mathematics)Elementary diagram Elementary equivalence Elementary function arithmetic Empty set Enumeration Equiconsistency Equivalence relation Euclid's Elements Euclidean geometry Existential quantification Exponential function Exponentiation Expression (mathematics)Extension by definitions Extension by new constant and function names Extensionality Factorial Field (mathematics)Finitary relation Finite-valued logic Finite model theory Finite set Finitism First-order logic Fixed-point logic For loop Forcing (mathematics)Formal grammar Formal language Formal proof Formal semantics (logic)Formal system Formation rule Foundations of geometry Foundations of mathematics Free logic Free variables and bound variables Function (mathematics)Function composition Functional predicate Fuzzy set GOTO General recursive function General set theory George Boolos Goodstein function Grothendieck universe Ground expression Ground formula Grzegorczyk hierarchy Gödel's completeness theorem Gödel's incompleteness theorem Gödel's incompleteness theorems Gödel, Escher, Bach Gödel number Gödel numbering Halting problem Henk Barendregt Hereditary set Higher-order logic Hilbert's axioms Hilbert system History of logic History of mathematical logic Identity function If and only if Image (mathematics)Inaccessible cardinal Independence (mathematical logic)Indicator function Inference Infinite-valued logic Infinite set Information theory Inhabited set Injective function Interpretation (logic)Interpretation (model theory)Interpretation function Intersection (set theory)Isomorphism Jan van Leeuwen Jean van Heijenoort John P. Burgess Juris Hartmanis Kolmogorov complexity Kripke's theory of truth Kripke–Platek set theory LOOP (programming language)Lambda calculus Large cardinal Lemma (mathematics)Lindström's theorem List of Hilbert systems List of axioms List of first-order theories List of formal systems List of mathematical theories List of set identities and relations List of statements independent of ZFC Logic Logical biconditional Logical conjunction Logical connective Logical consequence Logical constant Logical disjunction Logical equality Logical equivalence Logical truth Logicism Loop (programming)Löwenheim–Skolem theorem MIT Press Machine that always halts Many-valued logic Map (mathematics)Material conditional Mathematical logic Mathematical object Metalanguage Minimal axioms for Boolean algebra Model complete theory Model theory Monadic predicate calculus Monadic second-order logic Monus Morse–Kelley set theory Mu-operator Mu operator Mutual recursion NP (complexity)Naive set theory Natural deduction Natural number Negation New Foundations Non-Euclidean geometry Non-logical symbol Non-standard model Non-standard model of arithmetic North-Holland Publishing Company Number theory Open formula Operation (mathematics)Ordinal analysis Ordinal number PR (complexity)P (complexity)P versus NP problem Pairing function Paradoxes of set theory Paris–Harrington theorem Partial function Partial recursive function Partition of a set Peano arithmetic Peano axioms Peano postulates Philosophy of mathematics Power set Predicate (mathematical logic)Predicate logic Predicate variable Primality test Prime model Primitive recursive arithmetic Primitive recursive functional Primitive recursive ordinal function Primitive recursive set function Principia Mathematica Proof of impossibility Proof theory Proposition Propositional calculus Propositional formula Propositional variable Quantifier (logic)Quantifier rank Rational number Recursion Recursion (computer science)Recursive definition Recursive set Recursively enumerable Recursively enumerable set Relation (mathematics)Reverse mathematics Richard Dedekind Richard Jeffrey Robert I. Soare Robinson arithmetic Rule of inference Russell's paradox Rózsa Péter Satisfiability Saturated model Schröder–Bernstein theorem Second-order arithmetic Second-order logic Self-verifying theories Semantic theory of truth Semantics of logic Sentence (mathematical logic)Sequent calculus Set (mathematics)Set theory Signature (logic)Singleton (mathematics)Skolem arithmetic Soundness Spectrum of a sentence Spectrum of a theory Square of opposition Stephen Cole Kleene Strength (mathematical logic)String (formal languages)Structure (mathematical logic)Subset Substitution (logic)Substructure (mathematics)Sudan function Supertask Surjective function Syllogism Symbol (formal)Syntax (logic)T-schema Tail call Tarski's axiomatization of the reals Tarski's axioms Tarski's theory of truth Tarski's undefinability theorem Tarski–Grothendieck set theory Tautology (logic)Term (logic)Term logic The Journal of Symbolic Logic Theorem Theories of truth Theory (mathematical logic)Thoralf Skolem Three-valued logic Time complexity Timeline of mathematical logic Total function Total recursive function Transfer principle Transitive set True arithmetic Truth predicate Truth table Truth value Turing-complete language Turing completeness Turing machine Type (model theory)Type theory Ultrafilter (set theory)Ultraproduct Unary operation Uncountable set Undecidable problem Uninterpreted function Union (set theory)Uniqueness quantification Universal quantification Universal set Universe (mathematics)Urelement Validity (logic)Variable (mathematics)Venn diagram Von Neumann universe Von Neumann–Bernays–Gödel set theory Well-formed formula While loop Wilhelm Ackermann Zermelo–Fraenkel set theory

138 concepts already in your glossary