-
Anglický jazyk
Primitive Recursive Arithmetic
Autor: Lambert M. Surhone
High Quality Content by WIKIPEDIA articles! 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,... Viac o knihe
Na objednávku
152.38 €
bežná cena: 160.40 €
O knihe
High Quality Content by WIKIPEDIA articles! 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 e0, 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.
- Vydavateľstvo: OmniScriptum
- Rok vydania: 2026
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9786130346744
