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

 
9786130341916: Primitive Recursive Arithmetic: Primitive Recursive Arithmetic, Quantification, Thoralf Skolem, Finitism, Foundations of Mathematics, Ordinal Analysis, Peano Axioms, Natural Number
Softcover
ISBN 10: 6130341911 ISBN 13: 9786130341916
Verlag: Betascript Publishers, 2010

Inhaltsangabe

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. The language of PRA can express arithmetic propositions involving natural numbers and any primitive recursive function, including the operations of addition, multiplication, and exponentiation. PRA cannot explicitly quantify over the domain of natural numbers. PRA is often taken as the basic metamathematical formal system for proof theory, in particular for consistency proofs such as Gentzen''s consistency proof of first-order arithmetic.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

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. The language of PRA can express arithmetic propositions involving natural numbers and any primitive recursive function, including the operations of addition, multiplication, and exponentiation. PRA cannot explicitly quantify over the domain of natural numbers. PRA is often taken as the basic metamathematical formal system for proof theory, in particular for consistency proofs such as Gentzen''s consistency proof of first-order arithmetic.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Betascript Publishers
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6130341911
ISBN 13 
9786130341916
Einband
Tapa blanda
Anzahl der Seiten
112
Herausgeber
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar

Weitere beliebte Ausgaben desselben Titels

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

Vorgestellte Ausgabe

ISBN 10:  6130346743 ISBN 13:  9786130346744
Verlag: Betascript Publishers, 2010
Softcover