## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

## If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

# Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis

Zlatan Damnjanovic
The Journal of Symbolic Logic
Vol. 60, No. 4 (Dec., 1995), pp. 1208-1241
DOI: 10.2307/2275884
Stable URL: http://www.jstor.org/stable/2275884
Page Count: 34
Preview not available

## Abstract

A new method of "minimal" realizability is proposed and applied to show that the definable functions of Heyting arithmetic (HA)--functions f such that HA $\vdash \forall x\exists!yA(x, y)\Rightarrow$ for all m, A(m, f(m)) is true, where A(x, y) may be an arbitrary formula of L(HA) with only x, y free--are precisely the provably recursive functions of the classical Peano arithmetic (PA), i.e., the $< \varepsilon_0$-recursive functions. It is proved that, for prenex sentences provable in HA, Skolem functions may always be chosen to be $< \varepsilon_0$-recursive. The method is extended to intuitionistic finite-type arithmetic, HAω0, and elementary analysis. Generalized forms of Kreisel's characterization of the provably recursive functions of PA and of the no-counterexample-interpretation for PA are consequently derived.

• 1208
• 1209
• 1210
• 1211
• 1212
• 1213
• 1214
• 1215
• 1216
• 1217
• 1218
• 1219
• 1220
• 1221
• 1222
• 1223
• 1224
• 1225
• 1226
• 1227
• 1228
• 1229
• 1230
• 1231
• 1232
• 1233
• 1234
• 1235
• 1236
• 1237
• 1238
• 1239
• 1240
• 1241