Plain bases for classes of primitive recursive functions
From MaRDI portal
Publication:2776813
DOI10.1002/1521-3870(200201)48:1%3C93::AID-MALQ93%3E3.0.CO;2-8zbMATH Open1017.03018WikidataQ56387838 ScholiaQ56387838MaRDI QIDQ2776813FDOQ2776813
Authors: S. Mazzanti
Publication date: 24 August 2003
Published in: Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
Cited In (17)
- Arithmetization of register machines with counters
- Operation of bound prefix concatenation and finite superposition bases
- Generating some classes of recursive functions by superpositions of simple arithmetic functions
- On the class of Skolem elementary functions
- Super-exponentials nonprimitive recursive, but rudimentary
- New substitution bases for complexity classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- An example of a simple quasi-universal function in the class ε 2 of the Grzegorczyk hierarchy
- Title not available (Why is that?)
- On the Algebraic Structure of Primitive Recursive Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A classification of the one-argument primitive recursive functions
- Title not available (Why is that?)
- On Closed Classes of Primitive Recursive Functions, II
- Elementary functions and loop programs
This page was built for publication: Plain bases for classes of primitive recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776813)