A Note On Formal Reasoning with Extensible Domain

The Reasoner 3 (7):5-6 (2009)
Abstract
Assuming the indefinite extensibility of any domain of quantification leads to reasoning with extensible domain semantics. It is showed that some theorems (e.g. Thomson's) in conventional semantics logic are not theorems in a logic provided with this new semantics
Keywords Indefinite Extensibility  Extensible Domain  Thomson's Theorem
Categories (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 Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,817
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

No citations found.

Similar books and articles
Peter Clark (1993). Sets and Indefinitely Extensible Concepts and Classes. Aristotelian Society Supplementary Volume 67:235--249.
Gonçalo Santos (2011). Unlimited Possibilities. In Michal Peliš & Vít Punčochář (eds.), The Logica Yearbook. College Publications.
Kit Fine (2006). Relatively Unrestricted Quantification. In Agustín Rayo & Gabriel Uzquiano (eds.), Absolute Generality. Oxford University Press. 20-44.
Analytics

Monthly downloads

Added to index

2010-09-04

Total downloads

9 ( #163,400 of 1,099,909 )

Recent downloads (6 months)

2 ( #189,854 of 1,099,909 )

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.