Sequence semantics for dynamic predicate logic
نویسنده
چکیده
In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments This semantics is compared with the usual relational semantics for dynamic predicate logic it is shown that the most important intuitions of the usual se mantics are preserved Then it is shown that the re ned semantics re ects out intuitions about information growth Some other issues in dynamic semantics are formulated and discussed in terms of the new sequence semantics
منابع مشابه
Incremental interpretation and dynamic semantics
The goal of this paper is to motivate and define a strictly incremental semantics for dynamic predicate logic (Groenendijk and Stokhof 1991). In particular, we will extend the incremental semantics for dynamic propositional logic introduced in Vermeulen (1994) to first-order predicate logic (borrowing central notions from Visser 2002). We call the resulting logical system Incremental Dynamic Pr...
متن کاملPredicate Logic with Anaphora
In this paper I make a case for a separate treatment of (singular) anaphoric pronouns within a predicate logic with anaphora (PLA). Discourse representation theoretic results (from Kamp 1981) can be formulated in a compositional way, without d-dling with orthodox notions of scope and binding. In contrast with its predecessor dynamic predicate logic (Groenendijk and Stokhof 1991), the system of ...
متن کاملGeneralizing Propositional Dynamic Logic
A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...
متن کاملSequential Dynamic Logic
We introduce a substructural propositional calculus of Sequential Dynamic Logic (SDL) that subsumes a propositional part of dynamic predicate logic (DPL), and is shown to be expressively equivalent to propositional dynamic logic (PDL). Completeness of the calculus with respect to the intended relational semantics is established.
متن کاملModal Foundations for Predicate Logic
The complexity of any logical modeling reeects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigatèlighter' versions of this general purpose tool, by modally`deconstructing' the usual semantics, and locating i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 2 شماره
صفحات -
تاریخ انتشار 1993