Journal of Symbolic Logic 59 (4):1210-1227 (1994)
|Abstract||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 Σ 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|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Robert A. Di Paola (1981). A Lift of a Theorem of Friedberg: A Banach-Mazur Functional That Coincides with No Α-Recursive Functional on the Class of Α-Recursive Functions. Journal of Symbolic Logic 46 (2):216 - 232.
Lars Birkedal (2002). A General Notion of Realizability. Bulletin of Symbolic Logic 8 (2):266-282.
Charles Sayward (2000). Remarks on Peano Arithmetic. Russell 20:27-32.
Jaap Van Oosten (1990). Lifschitz' Realizability. Journal of Symbolic Logic 55 (2):805 - 821.
Joachim Lambek & Philip Scott (2005). An Exactification of the Monoid of Primitive Recursive Functions. Studia Logica 81 (1):1 - 18.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Zlatan Damnjanovic (1998). Strictly Primitive Recursive Realizability, II. Completeness with Respect to Iterated Reflection and a Primitive Recursive $\Omega$ -Rule. Notre Dame Journal of Formal Logic 39 (3):363-388.
Zlatan Damnjanovic (1997). Elementary Realizability. Journal of Philosophical Logic 26 (3):311-339.
Eric Funkhouser (2007). Multiple Realizability. Philosophy Compass 2 (2):303–315.
Added to index2009-01-28
Total downloads19 ( #64,458 of 549,754 )
Recent downloads (6 months)1 ( #63,425 of 549,754 )
How can I increase my downloads?