Strictly Primitive Recursive Realizability, I

Damnjanovic, Zlatan

J. Symbolic Logic, Tome 59 (1994) no. 1, p. 1210-1227 / Harvested from Project Euclid

Résumé

A realizability notion that employs only primitive recursive functions is defined, and, relative to it, the soundness of the fragment of Heyting Arithmetic (HA) in which induction is restricted to $\Sigma^0_1$ formulae is proved. A dual concept of falsifiability is proposed and an analogous soundness result is established for a further restricted fragment of HA.

Publié le : 1994-12-14
Classification:

@article{1183744620,
     author = {Damnjanovic, Zlatan},
     title = {Strictly Primitive Recursive Realizability, I},
     journal = {J. Symbolic Logic},
     volume = {59},
     number = {1},
     year = {1994},
     pages = { 1210-1227},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183744620}
}

Damnjanovic, Zlatan. Strictly Primitive Recursive Realizability, I. J. Symbolic Logic, Tome 59 (1994) no. 1, pp.  1210-1227. http://gdmltest.u-ga.fr/item/1183744620/