Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Derivation-Bounded Groups.
Die mit Nestedstackautomaten berechenbaren Funktionen sind elementar.
E. T. a infinitární Churchova teze
Eine Funktionalinterpretation der prädikativen Analysis.
Extended primitive recursive functions
Finite alogorithmic procedures and computation theories.
Functions provably total in
Functions provably total in
Goodstein's function.
Hierarchien primitiv-rekursiver Funktionen im Transfiniten.
Horn clause programs and recursive functions defined by systems of equations
Infinitary Simultaneous Recursion Theorem.
Isomorphism of index sets of discrete families of general recursive functions.
Jede mit Stackautomaten berechenbare Funktion ist elementar.
La fonction d'Ackermann : un nouveau mode de dérécursivation
Limiting recursion and the arithmetic hierarchy
New recursive characterizations of the elementary functions and the functions computable in polynomial space.
We formulate recursive characterizations of the class of elementary functions and the class of functions computable in polynomial space that do not require any explicit bounded scheme. More specifically, we use functions where the input variables can occur in different kinds of positions ?normal and safe? in the vein of the Bellantoni and Cook's characterization of the polytime functions.
Non recursive functions have transcendental generating series
On certain decompositions of Gödel numberings.