Andere Kunden interessierten sich auch für
![Primitive Recursive Arithmetic]( "Primitive Recursive Arithmetic")
Primitive Recursive Arithmetic25,99 €![Primitive Recursive Function]( "Primitive Recursive Function")
Primitive Recursive Function29,99 €![Primitive Recursive Function]( "Primitive Recursive Function")
Primitive Recursive Function25,99 €![Recursive Languages and Sets]( "Recursive Languages and Sets")
Recursive Languages and Sets32,99 €![Primitive Equations]( "Primitive Equations")
Primitive Equations25,99 €![Primitive Root Modulo N]( "Primitive Root Modulo N")
Primitive Root Modulo N19,99 €![Primitive Equations]( "Primitive Equations")
Primitive Equations25,99 €
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 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.