Binary Quantification Systems

&
Notre Dame Journal of Formal Logic 36 (3):382-395 (1995)
  Copy   BIBTEX

Abstract

We investigate the formal theory of binary quantifiers, that is, quantifiers that take seriously the surface structure of natural language quantifier phrases. We show how to develop a natural deduction system for logics of this sort and demonstrate soundness and completeness results

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1040149354

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A natural deduction system for first degree entailment.Allard M. Tamminga & Koji Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (2):258-272.
Vector spaces and binary quantifiers.Michał Krynicki, Alistair Lachlan & Jouko Väänänen - 1984 - Notre Dame Journal of Formal Logic 25 (1):72-78.
A Natural Deduction Calculus for S4.2.Simone Martini, Andrea Masini & Margherita Zorzi - 2024 - Notre Dame Journal of Formal Logic 65 (2):127-150.
Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
A binary Sheffer operator which does the work of quantifiers and sentential connectives.Robert B. Brandom - 1979 - Notre Dame Journal of Formal Logic 20 (2):262-264.
The completeness of Copi's system of natural deduction.John A. Winnie - 1970 - Notre Dame Journal of Formal Logic 11 (3):379-382.
Reconciling Aristotle and Frege.Alex Orenstein - 1999 - Notre Dame Journal of Formal Logic 40 (3):391-413.
An elementary completeness proof for a system of natural deduction.David W. Bennett - 1973 - Notre Dame Journal of Formal Logic 14 (3):430-432.
A Variant of Thomason's First-Order Logic CF Based on Situations.Xuegang Wang & Peter Mott - 1998 - Notre Dame Journal of Formal Logic 39 (1):74-93.
Pitts' Quantifiers Are Not Topological Quantification.Tomasz Połacik - 1998 - Notre Dame Journal of Formal Logic 39 (4):531-544.

Analytics

Added to PP
2010-08-24

Downloads
27 (#824,377)

6 months
7 (#704,497)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michaelis Michael
University of New South Wales

Citations of this work

Add more citations

References found in this work

Replies.W. V. Quine - 1968 - Synthese 19 (1-2):264 - 322.

Add more references