A classification of an iterative hierarchy.
A classification of the one-argument primitive recursive functions.
A classification of the ordinal recursive functions.
A combinatorial analysis of functions provably recursive in
A complete characterization of primitive recursive intensional behaviours
We give a complete characterization of the class of functions that are the intensional behaviours of primitive recursive (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 N the set of positive integers.
A few results on the complexity of classes of identifiable recursive function sets
A hierarchy of primitive recursive sequence functions
A nonstandard approach to arithmetic.
A Note on Contraproduction Domains.
Aleatoreidad e inmunidad.
By introducing the concept of randomness through notions of recursion theory, the set of the random numbers is effectively immune. The proof of this well-known result makes an essential use of the recursion theorem. In this paper, randomness is introduced starting from the more common notion of definability in Robinson's arithmetic and the same result is obtained using an extension of the fixed-point theorem, which we prove at the end of the paper. Finally we define a recursive function dominating...
Algorithmization of algebras and relational structures
An algorithm for the word problem in extensions and the dependence of its complexity on the group representation
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.
Anmerkungen zum Rekursionstheorem.
Another simplification of the recursion scheme.
Arithmetical classification of the set of all provably recursive functions
The set of all indices of all functions provably recursive in any reasonable theory is shown to be recursively isomorphic to , where is -complete set.
Arithmetische Prädikate über einem Bereich endlicher Automaten.
Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie.
Built-up systems of fundamental sequences and hierarchies of number-theoretic functions.
Catégories de Peano et catégories algorithmiques, récursivité