Articles liés à Tiered Arithmetic and its Applications: Tiered arithmetic,...

Tiered Arithmetic and its Applications: Tiered arithmetic, its functional interpretation and slow growing bounds - Couverture souple

Ça?man, Naim; S. Wainer, Stan

 
9783838365619: Tiered Arithmetic and its Applications: Tiered arithmetic, its functional interpretation and slow growing bounds
Couverture souple
ISBN 10 : 3838365615 ISBN 13 : 9783838365619
Editeur : LAP LAMBERT Academic Publishing, 2010

Synopsis

This book is first author's dissertation that is submitted in accordance with the requirements for the degree of Doctor of Philosophy to The University of Leeds, Department of Pure Mathematics in January 2000 under the direction of second author with the title "Tiered Arithmetic, its Functional Interpretation and Slow Growing Bounds". A two-sorted version of Peano Arithmetic is developed, with proof-rules corresponding to the normal/safe recursion schemes of Bellantoni and Cook. Classical methods of proof theory still apply, but now the provably recursive functions are brought down to more computationally realistic levels than in the single-sorted case, since the bounding functions turn out to be "slow growing" rather than "fast growing". Result very similar to earlier ones of Leivant are obtained characterizing Grzegorczyk?s classes (in the existential fragment) and (in the full theory).

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

This book is first author's dissertation that is submitted in accordance with the requirements for the degree of Doctor of Philosophy to The University of Leeds, Department of Pure Mathematics in January 2000 under the direction of second author with the title "Tiered Arithmetic, its Functional Interpretation and Slow Growing Bounds". A two-sorted version of Peano Arithmetic is developed, with proof-rules corresponding to the normal/safe recursion schemes of Bellantoni and Cook. Classical methods of proof theory still apply, but now the provably recursive functions are brought down to more computationally realistic levels than in the single-sorted case, since the bounding functions turn out to be "slow growing" rather than "fast growing". Result very similar to earlier ones of Leivant are obtained characterizing Grzegorczyk?s classes (in the existential fragment) and (in the full theory).

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
3838365615
ISBN 13 
9783838365619
Reliure
Broché
Nombre de pages
108
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne