On the derivability of instantiation properties

Journal of Symbolic Logic 42 (4):506-514 (1977)
Every recursively enumerable extension of arithmetic which obeys the disjunction property obeys the numerical existence property [Fr, 1]. The requirement of recursive enumerability is essential. For extensions of intuitionistic second order arithmetic by means of sentences (in its language) with no existential set quantifiers, the numerical existence property implies the set existence property. The restriction on existential set quantifiers is essential. The numerical existence property cannot be eliminated, but in the case of finite extensions of HAS, can be replaced by a weaker form of it. As a consequence, the set existence property for intuitionistic second order arithmetic can be proved within itself
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2271871
 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: 23,209
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

Add more references

Citations of this work BETA
Jaap van Oosten (1997). Extensional Realizability. Annals of Pure and Applied Logic 84 (3):317-349.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

20 ( #232,613 of 1,941,073 )

Recent downloads (6 months)

4 ( #225,913 of 1,941,073 )

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.