Primitive Recursive Arithmetic

Name: Primitive Recursive Arithmetic
SKU: eb30a1666a1344ab62a65f446d28a8b1
Price: 156 EUR
Availability: InStock

1/1

Prijzen vanaf

156,00

Uitgelicht

	156,00	Naar shop
VERGELIJK ALLE AANBIEDERS (1)

Beschrijving

Bol 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.

Lees meer

Vergelijk aanbieders (1)

Sorteren op:

€ 156,00 Gratis verzending

Beschrijving (1)

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.

Lees meer