In this paper we prove that the principles in the languagewith relation composition and dynamic implication, valid forall binary relations, are the same ones as the principlesvalid when we restrict ourselves to DPL-relations,i.e. relations generated from conditions (tests) and resettings.

We consider substitutions in order sensitive situations, having in the back of our minds the case of dynamic predicate logic (DPL) with a stack semantics. We start from the semantic intuition that substitutions are move instructions on stacks: the syntactic operation [y/x] is matched by the instruction to move the value of the y-stack to the x-stack. We can describe these actions in the positive fragment of DPLE. Hence this fragment counts as a logic for DPL-substitutions. We give a calculus (...) for the fragment and prove soundness and completeness. (shrink)

Dynamic predicate logic (DPL), presented in [5] as a formalism for representing anaphoric linking in natural language, can be viewed as a fragment of a well known formalism for reasoning about imperative programming [6]. An interesting difference from other forms of dynamic logic is that the distinction between formulas and programs gets dropped: DPL formulas can be viewed as programs. In this paper we show that DPL is in fact the basis of a hierarchy of formulas-as-programs languages.

Dynamic predicate logic (DPL), presented in [5] as a formalism for representing anaphoric linking in natural language, can be viewed as a fragment of a well known formalism for reasoning about imperative programming [6]. An interesting difference from other forms of dynamic logic is that the distinction between formulas and programs gets dropped: DPL formulas can be viewed as programs. In this paper we show that DPL is in fact the basis of a hierarchy of formulas-as-programs languages.

In Groenendijk & Stokhof [1989] a system of dynamic predicate logic (DPL) was developed, as a compositional alternative for classical discourse representation theory (DRT ). DPL shares with DRT the restriction of being a first-order system. In the present paper, we are mainly concerned with overcoming this limitation. We shall define a dynamic semantics for a typed language with λ-abstraction which is compatible with the semantics DPL specifies for the language of first-order predicate logic. We shall propose to use this (...) new logical system as the semantic component of a Montague-style grammar (referred to as dynamic Montague grammar, DMG), which will enable us to extend the compositionality of DPL to the subsentential level. Furthermore, we shall extend this analysis also in this sense that we shall add new, dynamic interpretations for logical constants which in DPL were treated in a static fashion. This will substantially increase the descriptive coverage of DMG. (shrink)

Dynamic Predicate Logic (DPL) is a variant of Predicate Logic introduced by Groenendijk and Stokhof. One rationale behind the introduction of DPL is that it is closer to Natural Language than ordinary Predicate Logic in the way it treats scope.In this paper I develop some variants of DPL that can more easily approximate Natural Language in some further aspects. Specifically I add flexibility in the treatment of polarity and and some further flexibility in the treatment of scope.I develop a framework (...) that is intended to encourage further experimentation with alternative variants of DPL. In this framework the new meanings are, roughly,indexed sets of old meanings. The indices can be viewed as "files'' or "storage devices.''Each such file supports a separate "information stream.''The interaction of the new meanings is "programmed'' with the help of certain monoids acting on the indices. The construction of the new meanings can be viewed as an application of the Grothendieck Construction to monoids. (shrink)

We consider algebras on binary relations with two main operators: relational composition and dynamic negation. Relational composition has its standard interpretation, while dynamic negation is an operator familiar to students of Dynamic Predicate Logic (DPL) (Groenendijk and Stokhof, 1991): given a relation R its dynamic negation R is a test that contains precisely those pairs (s,s) for which s is not in the domain of R. These two operators comprise precisely the propositional part of DPL.This paper contains a finite equational (...) axiomatization for these dynamic relation algebras. The completenessresult uses techniques from modal logic. We also lookat the variety generated by the class of dynamic relation algebras and note that there exist nonrepresentable algebras in this variety, ones which cannot be construedas spaces of relations. These results are also proved for an extension to a signature containing atomic tests and union. (shrink)

This volume addresses current issues in the semantics and the pragmatics of discourse and dialogue. Collected papers aim at providing insights on different theoretical approaches, all of them in the dynamic semantics tradition, such as Dynamic Predicate Logic (DPL), Discourse Representation Theory (DRT), and Segmented Discourse Representation Theory (SDRT). They reflect the current move of formal semantics from short multisentential texts towards structured discourses and dialogues, accounting for more and more phenomena at the semantics-pragmatics interface (e.g., subtleties of anaphora and (...) presupposition, the role of temporal connectives in discourse or the establishment of common references in dialogue). (shrink)

Two new first-order paraconsistent logics with De Morgan-type negations and co-implication, called symmetric paraconsistent logic (SPL) and dual paraconsistent logic (DPL), are introduced as Gentzen-type sequent calculi. The logic SPL is symmetric in the sense that the rule of contraposition is admissible in cut-free SPL. By using this symmetry property, a simpler cut-free sequent calculus for SPL is obtained. The logic DPL is not symmetric, but it has the duality principle. Simple semantics for SPL and DPL are introduced, and the (...) completeness theorems with respect to these semantics are proved. The cut-elimination theorems for SPL and DPL are proved in two ways: One is a syntactical way which is based on the embedding theorems of SPL and DPL into Gentzen’s LK, and the other is a semantical way which is based on the completeness theorems. (shrink)

An arithmetical interpretation of dynamic propositional logic (DPL) is a mapping f satisfying the following: (1) f associates with each formula A of DPL a sentence f(A) of Peano arithmetic (PA) and with each program α a formula f(α) of PA with one free variable describing formally a supertheory of PA; (2) f commutes with logical connectives; (3) f([α] A) is the sentence saying that f(A) is provable in the theory f(α); (4) for each axiom A of DPL, f(A) is (...) provable in PA (and consequently, for each A provable in DPL, f(A) is provable in PA). The arithmetical completeness theorem is proved saying that a formula A of DPL is provable in DPL iff for each arithmetical interpretation f, f(A) is provable in PA. Various modifications of this result are considered. (shrink)

Destructive assignment is the main weakness of Dynamic Predicate Logic (DPL, [GS91], but see also [Bar87]) as a basis for a compositional semantics of natural language: in DPL, the semantic effect of a quantifier action ∃x is that the previous value of x gets lost forever.

Dynamic 10gic programming is the result 0f making dynamic versions 0f first order predicate 10gic executable. The main sources of inspiration for this are the dynamic variable binding strategies that have become fashionable in natural language analysis (DRT [8], Anaphora, Logic [2], DPL [7]), the idea of implementing identity assertions as assignment commands familiar from constraint programming, and more in particular from Alma,-0 [1], and the genera.] injunction to explore logical dynamics emanating from the works of J 01121,11 van Benthemw (...) eg. from.. (shrink)

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.

In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and the way (...) these extensions interact with our notion of context. (shrink)

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.

In this paper we discuss the treatment of variables in dynamic semantics. Referent systems are introduced as a flexible mechanism for working with variables. In a referent system we carefully distinguish the variables themselves both from the machinery by which we manipulate them - their names - and from the information that we store in them - their values. It is shown that the referent systems provide a natural basis for dynamic semantics. The semantics with referent systems is compared with (...) the familiar formalisms in dynamic semantics, DRT and DPL. (shrink)