On the derivability of instantiation properties
Journal of Symbolic Logic 42 (4):506-514 (1977)
| Abstract | 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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesSonia Roca-Royes (2011). Essential Properties and Individual Essences. Philosophy Compass 6 (1):65-77.
Michael Zakharyaschev (1997). The Greatest Extension of S4 Into Which Intuitionistic Logic is Embeddable. Studia Logica 59 (3):345-358.
Marek Rosiak (2006). Formal and Existential Analysis of Subject and Properties. Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):285-299.
Sydney Shoemaker (2001). Realization and Mental Causation. In Carl Gillett & Barry M. Loewer (eds.), Physicalism and its Discontents. Cambridge University Press.
Michael E. Mytilinaios & Theodore A. Slaman (1988). Σ2-Collection and the Infinite Injury Priority Method. Journal of Symbolic Logic 53 (1):212 - 221.
Joel Katzav (2008). The Second-Order Property View of Existence. Pacific Philosophical Quarterly 89 (4):486-496.
Joseph Diekemper (2009). Thisness and Events. Journal of Philosophy 106 (5):255-276.
Stephan Wehner (1999). On Recursive Enumerability with Finite Repetitions. Journal of Symbolic Logic 64 (3):927-945.
Michael Rathjen (2005). The Disjunction and Related Properties for Constructive Zermelo-Fraenkel Set Theory. Journal of Symbolic Logic 70 (4):1233 - 1254.
Harvey Friedman & Michael Sheard (1989). The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic. Journal of Symbolic Logic 54 (4):1456-1459.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,507 of 548,951 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
