Logic and existence: Ian Rumfitt

Abstract
[Ian Rumfitt] Frege's logicism in the philosophy of arithmetic consisted, au fond, in the claim that in justifying basic arithmetical axioms a thinker need appeal only to methods and principles which he already needs to appeal in order to justify paradigmatically logical truths and paradigmatically logical forms of inference. Using ideas of Gentzen to spell out what these methods and principles might include, I sketch a strategy for vindicating this logicist claim for the special case of the arithmetic of the finite cardinals. /// [Timothy Williamson]The paper defends the intelligibility of unrestricted quantification. For any natural number n, 'There are at least n individuals' is logically true, when the quantifier is unrestricted. In response to the objection that such sentences should not count as logically true because existence is contingent, it is argued by consideration of cross-world counting principles that in the relevant sense of 'exist' existence is not contingent. A tentative extension of the upward Löwenheim-Skolem theorem to proper classes is used to argue that a sound and complete axiomatization of the logic of unrestricted universal quantification results from adding all sentences of the form 'There are at least n individuals' as axioms to a standard axiomatization of the first-order predicate calculus
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
Options
 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: 10,273
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.

Citations of this work BETA
Neil Tennant (2004). A General Theory of Abstraction Operators. Philosophical Quarterly 54 (214):105-133.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

48 ( #32,059 of 1,096,360 )

Recent downloads (6 months)

8 ( #21,534 of 1,096,360 )

How can I increase my downloads?

My notes
Sign in to use this feature


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