Items related to 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 - Softcover
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.
"About this title" may belong to another edition of this title.
- PublisherBetascript Publishing
- Publication date2010
- ISBN 10 6130346743
- ISBN 13 9786130346744
- BindingTapa blanda
- LanguageEnglish
- Number of pages112
- EditorSurhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want