Articles liés à Primitive Recursive Arithmetic: Quantification, Thoralf...

Primitive Recursive Arithmetic: Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number, Primitive Recursive Function, Addition - Couverture souple

 
9786130346744: Primitive Recursive Arithmetic: Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number, Primitive Recursive Function, Addition

L'édition de cet ISBN n'est malheureusement plus disponible.

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Primitive recursive arithmetic, or PRA, is a quantifier-free formalization of the natural numbers. It was first proposed by Skolem as a formalization of his finitist conception of the foundations of arithmetic, and it is widely agreed that all reasoning of PRA is finitist. Many also believe that all of finitism is captured by PRA, but others believe finitism can be extended to forms of recursion beyond primitive recursion, up to ε0, which is the proof-theoretic ordinal of Peano arithmetic. PRA''s proof theoretic ordinal is ωω, where ω is the smallest transfinite ordinal. PRA is sometimes called Skolem arithmetic.

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

Présentation de l'éditeur

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Primitive recursive arithmetic, or PRA, is a quantifier-free formalization of the natural numbers. It was first proposed by Skolem as a formalization of his finitist conception of the foundations of arithmetic, and it is widely agreed that all reasoning of PRA is finitist. Many also believe that all of finitism is captured by PRA, but others believe finitism can be extended to forms of recursion beyond primitive recursion, up to ε0, which is the proof-theoretic ordinal of Peano arithmetic. PRA''s proof theoretic ordinal is ωω, where ω is the smallest transfinite ordinal. PRA is sometimes called Skolem arithmetic.

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

(Aucun exemplaire disponible)

Chercher:



Créez une demande

Vous ne trouvez pas le livre que vous recherchez ? Nous allons poursuivre vos recherches. Si l'un de nos libraires l'ajoute aux offres sur AbeBooks, nous vous le ferons savoir !

Créez une demande

Autres éditions populaires du même titre

9786130341916: Primitive Recursive Arithmetic: Primitive Recursive Arithmetic, Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number

Edition présentée

ISBN 10 :  6130341911 ISBN 13 :  9786130341916
Editeur : Betascript Publishing, 2010
Couverture souple