Fragments of Heyting arithmetic

Journal of Symbolic Logic 65 (3):1223-1240 (2000)
We define classes Φ n of formulae of first-order arithmetic with the following properties: (i) Every φ ∈ Φ n is classically equivalent to a Π n -formula (n ≠ 1, $\Phi_1:=\Sigma_1)$ . (ii) $\bigcup_{n\in \omega} \Phi_n = \mathscr L_A$ . (iii) IΠ n and iΦ n (i.e., Heyting arithmetic with induction schema restricted to Φ n - formulae) prove the same Π 2 -formulae. We further generalize a result by Visser and Wehmeier, namely that prenex induction within intuitionistic arithmetic is rather weak: After closing Φ n both under existential and universal quantification (we call these classes Θ n ) the corresponding theories iΘ n still prove the same Π 2 -formulae. In a second part we consider iΔ 0 plus collection-principles. We show that both the provably recursive functions and the provably total functions of iΔ 0 + {∀ x ≤ a ∃ y φ(x,y) → ∃ z ∀ x ≤ a ∃ y ≤ z φ(x,y) ∣ φ ∈ L A } are polynomially bounded. Furthermore we show that the contrapositive of the collection-schema gives rise to instances of the law of excluded middle and hence $i\Delta_0 + \{B\varphi, C\varphi \mid \varphi \in \mathscr L_A\} \vdash PA$
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586698
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,831
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Geoffrey E. Ostrin & Stanley S. Wainer (2005). Elementary Arithmetic. Annals of Pure and Applied Logic 133 (1):275-292.
Toshiyasu Arai (2011). Quick Cut-Elimination for Strictly Positive Cuts. Annals of Pure and Applied Logic 162 (10):807-815.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

5 ( #359,010 of 1,724,771 )

Recent downloads (6 months)

4 ( #167,193 of 1,724,771 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.