Primitive recursive functions

DOI10.1090/S0002-9904-1947-08911-4MaRDI QIDQ5792036zbMATH OpenFDO

Authors Raphael M. Robinson

Publication date 1947

Published in Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9904-1947-08911-4

zbMATH Keywords

Philosophy and foundations of mathematics

Cited in

(26)

• Primitive iteration and unary functions
• General iteration and unary functions
• Wittgenstein and finitism
• Bases for algebras of recursive functions
• Bases in algebras of partially recursive functions
• Subrecursive programming languages. II. On program size
• Recursive functions of large scope
• Arithmetical representation of recursively enumerable sets
• A classification of the one-argument primitive recursive functions
• Another simplification of the recursion scheme
• A flow diagram composition of Markov's normal algorithms without concluding formulas
• In Memoriam: Raphael Mitchel Robinson
• Definitional schemes for primitive recursive and computable functions
• On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
• List Objects with Algebraic Structure
• Primitive recursive arithmetic and its role in the foundations of arithmetic: historical and philosophical reflections
• Iteration on notation and unary functions
• Unary primitive recursive functions
• A reduction of the recursion scheme
• Recursive Functions of One Variable
• A system of implicit quantification
• Simplifications of the recursion scheme
• A problem in recursive function theory
• Succinct iterative characterizations of primitive computable unary functions
• Consistent ultrafinitist logic
• Closure functions and general iterates as reflectors

This page was built for publication: Primitive recursive functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5792036)