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.

Within natural language semantics, pronouns are often thought to correspond to variables whose values are contributed by contextual assignment functions. This paper concerns the application of this idea to cases where the antecedent of a pronoun is a plural quantifiers. The paper discusses the modelling of accessibility patterns of quantifier antecedents in a dynamic theory of interpretation. The goal is to reach a semantics of quantificational dependency which yields a fully semantic notion of pronominal accessibility. I argue that certain dependency (...) phenomena that arise in quantificationally created contexts require a representation of context wherein the labelling of antecedents is not rigid but rather dynamic itself. I propose a stack-based alternative to classic assignment functions, along the lines of Vermeulen (1993) and van Eijck (2001), and give a dynamic semantics of quantification which correctly accommodates the problematic anaphoric phenomena. (shrink)

This paper is concerned with the structure of texts in which aproof is presented. Some parts of such a text are assumptions, otherparts are conclusions. We show how the structural organisation of thetext into assumptions and conclusions helps to check the validity of theproof. Then we go on to use the structural information for theformulation of proof rules, i.e., rules for the (re-)construction ofproof texts. The running example is intuitionistic propositional logicwith connectives , and. We give new proofs of some (...) familiar results aboutthe proof theory of this logic to indicate how the new techniques workout. (shrink)

The development of the dynamic semantics of natural languagehas put issues of variable control on the agenda of formal semantics. Inthis paper we regard variables as names for stacks of values and makeexplicit several control actions as push and pop actions on stacks. Weapply this idea both to static and dynamic languages and compare theirfinite variable hierarchies, i.e., the relation between the number ofvariable stacks that is available and the expressivity of the language.This can be compared in natural languages with (...) relating the number ofpronouns available to the expressivity of the language.The results are obtained using techniques from static and dynamic modeltheory: model theoretic games, transition systems and bisimulation. (shrink)

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)