Primitive recursive notations for infinitary formulas
Kenneth A. Bowen (1974)
Colloquium Mathematicae
Similarity:
Displaying similar documents to “Comparisons between some generalizations of recursion theory”
Primitive recursive notations for infinitary formulas
Extension of an effectively generated class of functions by enumeration
S. Kleene (1958)
Colloquium Mathematicae
Similarity:
Deduction-preserving "Recursive Isomorphisms" between theories
Marian Pour-El, Saul Kripke (1967)
Fundamenta Mathematicae
Similarity:
Primitive recursive categories and machines
Yves Lafont (1989)
Diagrammes
Similarity:
General recursive functionals of finite type and hierarchies of functions
R. O. Gandy (1967)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Examples of sets definable by means of two and three quantifiers
Andrzej Mostowski (1955)
Fundamenta Mathematicae
Similarity:
A complete characterization of primitive recursive intensional behaviours
P. Valarcher (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
We give a complete characterization of the class of functions that are the intensional behaviours of (PR) algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on the set of positive integers.
Recursion in total functionals of finite type
Solomon Feferman (1977)
Compositio Mathematica
Similarity:
Extended primitive recursive functions
P. Mentrasti, M. Protasi (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: