Proof systems for Dynamic Predicate Logic


The core language can be extended by defining additional logical constants. E.g., we can add ‘→’ (implication), ‘∨’ (disjunction), and ‘∀x’ (universal quantifiers). The choice of logical primitives is not as optional in DPL as it is in standard predicate logic



    Upload a copy of this work     Papers currently archived: 92,197

External links

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

Through your library

  • Only published works are available at libraries.

Similar books and articles

A proof–theoretic study of the correspondence of hybrid logic and classical logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.
Contexts in dynamic predicate logic.Albert Visser - 1998 - Journal of Logic, Language and Information 7 (1):21-52.
Sequence semantics for dynamic predicate logic.C. F. M. Vermeulen - 1993 - Journal of Logic, Language and Information 2 (3):217-254.
Predicate logics on display.Heinrich Wansing - 1999 - Studia Logica 62 (1):49-75.
The donkey and the monoid. Dynamic semantics with control elements.Albert Visser - 2002 - Journal of Logic, Language and Information 11 (1):107-131.


Added to PP

87 (#195,813)

6 months
4 (#797,974)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Frank Veltman
University of Amsterdam

Citations of this work

Exclusively indexical deduction.Paul Dekker - 2016 - Review of Symbolic Logic 9 (3):603-637.

Add more citations

References found in this work

No references found.

Add more references