Predicate logic with flexibly binding operators and natural language semantics

Journal of Logic, Language and Information 2 (2):89-128 (1993)
  Copy   BIBTEX

Abstract

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
77 (#215,512)

6 months
11 (#237,138)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Peter Pagin
Stockholm University
Dag Westerståhl
Stockholm University

Citations of this work

Names.Sam Cumming - 2009 - Stanford Encyclopedia of Philosophy.
Necessity of Thought.Cesare Cozzo - 2015 - In Heinrich Wansing (ed.), Dag Prawitz on Proofs and Meaning. Springer. pp. 101-20.
Dag Prawitz on Proofs and Meaning.Heinrich Wansing (ed.) - 2014 - Cham, Switzerland: Springer.

Add more citations

References found in this work

Natural deduction: a proof-theoretical study.Dag Prawitz - 1965 - Mineola, N.Y.: Dover Publications.
Dynamic predicate logic.Jeroen Groenendijk & Martin Stokhof - 1991 - Linguistics and Philosophy 14 (1):39-100.
The Proper Treatment of Quantification in Ordinary English.Richard Montague - 1974 - In Richmond H. Thomason (ed.), Formal Philosophy. Yale University Press.
A Theory of Truth and Semantic Representation.Hans Kamp - 1981 - In P. Portner & B. H. Partee (eds.), Formal Semantics - the Essential Readings. Blackwell. pp. 189--222.

View all 12 references / Add more references