David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Journal of Philosophical Logic 27 (6):587-601 (1998)
Logics in which a relation R is semantically incomplete in a particular universe E, i.e. the union of the extension of R with its anti-extension does not exhaust the whole universe E, have been studied quite extensively in the last years. (Cf. van Benthem (1985), Blamey (1986), and Langholm (1988), for partial predicate logic; Muskens (1996), for the applications of partial predicates to formal semantics, and Doherty (1996) for applications to modal logic.) This is not so with semantically incomplete generalized quantifiers which constitute the subject of the present paper. The only systematic study of these quantifiers from a purely logical point of view, is, to the best of my knowledge, that by van Eijck (1995). We shall take here a different approach than that of van Eijck and mention some of the abstract properties of the resulting logic. Finally we shall prove that the two approaches are interdefinable
|Keywords||generalized quantifiers partiality semantic incompleteness|
|Categories||categorize this paper)|
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
Dag Westerståhl (1989). Aristotelian Syllogisms and Generalized Quantifiers. Studia Logica 48 (4):577-585.
Gabriel Sandu (1998). If-Logic and Truth-Definition. Journal of Philosophical Logic 27 (2):143-164.
Johan van Benthem & Dag Westerståhl (1995). Directions in Generalized Quantifier Theory. Studia Logica 55 (3):389-419.
G. Y. Sher (1997). Partially-Ordered (Branching) Generalized Quantifiers: A General Definition. [REVIEW] Journal of Philosophical Logic 26 (1):1-43.
Marcin Mostowski & Jakub Szymanik (2007). Computational Complexity of Some Ramsey Quantifiers in Finite Models. Bulletin of Symbolic Logic 13:281--282.
Charles F. Kielkopf (1977). Quantifiers in Ontology. Studia Logica 36 (4):301-307.
Wiebe Van Der Hoek & Maarten De Rijke (1993). Generalized Quantifiers and Modal Logic. Journal of Logic, Language and Information 2 (1):19-58.
Jaakko Hintikka (1976). Partially Ordered Quantifiers Vs. Partially Ordered Ideas. Dialectica 30 (1):89--99.
Natasha Alechina & Michiel van Lambalgen (1996). Generalized Quantification as Substructural Logic. Journal of Symbolic Logic 61 (3):1006-1044.
Added to index2009-01-28
Total downloads6 ( #201,338 of 1,098,427 )
Recent downloads (6 months)1 ( #285,057 of 1,098,427 )
How can I increase my downloads?