2002
DOI: 10.1002/1521-3870(200201)48:1<93::aid-malq93>3.0.co;2-8
|View full text |Cite
|
Sign up to set email alerts
|

Plain Bases for Classes of Primitive Recursive Functions

Abstract: A basis for a set C of functions on natural numbers is a set F of functions such that C is the closure with respect to substitution of the projection functions and the functions in F . This paper introduces three new bases, comprehending only common functions, for the Grzegorczyk classes E n with n ≥ 3. Such results are then applied in order to show that E n+1 = Kn for n ≥ 2, where {Kn} n∈N is the Axt hierarchy.Mathematics Subject Classification: 03D20, 03D55, 03B70, 68Q15.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Proposition 13. (Mazzanti [12]) All elementary functions can be generated from the following four functions by composition:…”
Section: A Non-elementary Real Numbermentioning
confidence: 99%
See 1 more Smart Citation
“…Proposition 13. (Mazzanti [12]) All elementary functions can be generated from the following four functions by composition:…”
Section: A Non-elementary Real Numbermentioning
confidence: 99%
“…Let D ⊂ R ℓ be a basic open semi-algebraic subset as in (12). Now we assume that D is bounded and contained in a large cube [0, r] ℓ , r > 0.…”
Section: Riemann Summentioning
confidence: 99%