Elementary arithmetic (Q1772782): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 05:38, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Elementary arithmetic |
scientific article |
Statements
Elementary arithmetic (English)
0 references
21 April 2005
0 references
The paper under review is a contribution to the search for syntactically simple theories, without explicitely imposed bounds on quantifiers, whose provably recursive functions form ``more feasible'' complexity classes. A quite different, alternative treatment of Leivant's results is developed. The characterization is extended to the first level of exponential complexity in the hierarchy between Grzegorczyk's \(E^{2}\) and \(E^{3}\). The emphasis is on cut elimination in ``traditional'' theories based on unary numerals, so complexity in the end is measured in terms of the numerical input itself rather than its binary length.
0 references
syntactically simple theories
0 references
provably recursive functions
0 references
complexity classes
0 references
cut elimination
0 references