Elementary arithmetic
From MaRDI portal
Publication:1772782
DOI10.1016/j.apal.2004.10.012zbMath1065.03040MaRDI QIDQ1772782
G. E. Ostrin, Stanley S. Wainer
Publication date: 21 April 2005
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2004.10.012
03D15: Complexity of computation (including implicit computational complexity)
03F05: Cut-elimination and normal-form theorems
03F30: First-order arithmetic and fragments
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07, An arithmetic for polynomial-time computation, Inductive definitions over a predicative arithmetic, Pointwise Transfinite Induction and a Miniaturized Predicativity
Cites Work