On the Consistency and Undecidability of Recursive Arithmetic
โ Scribed by H. E. Rose
- Publisher
- John Wiley and Sons
- Year
- 1961
- Tongue
- English
- Weight
- 556 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract A proof of the consistency of Heyting arithmetic formulated in natural deduction is given. The proof is a reduction procedure for derivations of falsity and a vector assignment, such that each reduction reduces the vector. By an interpretation of the expressions of the vectors as ordina
PA we define the rfcursively saturated part of XU by RS(9Jl) = ( a E $1: ( 3 8 < YJ?) ( a E )%I and 8 is recursively saturated)). We shall study various possibilities for the relationship between 912 and RS(XU). Tliii paper has grown out of our observation that it may happen that , D is a simple ex