Existential graphs and dynamic predicate logic

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Using first-order logic to represent the meaning of natural language sentences forces a non-compositional analysis of cross-sentential anaphora and donkey-anaphora. Groenendijk and Stokhof developed Dynamic Predicate Logic, in syntax equal to first-order logic, but with a different semantics. Using Dynamic Predicate Logic, anaphora can be analyzed in a compositional way. The same results can be achieved using Existential Graphs, developed by C.S. Peirce. The advantages of using Existential Graphs are that Existential Graphs are less complicated and easier to use than Dynamic Predicate Logic, and that Existential Graphs do not require a change of semantics. We discuss two types of anaphora, describe Dynamic Predicate Logic and Existential Graphs, give logical properties of both formalisms, and compare the two approaches.

Cite

CITATION STYLE

APA

Van Den Berg, H. (1995). Existential graphs and dynamic predicate logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 954, pp. 338–352). Springer Verlag. https://doi.org/10.1007/3-540-60161-9_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free