Contexts in Dynamic Predicate Logic

Authors:
Albert Visser
Affiliations:
Department of Philosophy, Utrecht University, Heidelberglaan 8, 3584 CS Utrecht, The Netherlands (E-mail: albert.visser@phil.ruu.nl
Venue:
Journal of Logic, Language and Information
Year:
1998

Citing 6
Cited 2

Functional programming and lambda calculus

Handbook of theoretical computer science (vol. B)
Type systems for programming languages

Handbook of theoretical computer science (vol. B)
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Actions under presuppositions

Logic and information flow
Anaphora and the Logic of Change

JELIA '90 Proceedings of the European Workshop on Logics in AI

Text Structure and Proof Structure

Journal of Logic, Language and Information
Variables as Stacks

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a notion of context for Groenendijk &Stokhof‘s Dynamic Predicate Logic ’DPL‘. We use these contexts togive a characterization of the relationson assignments that can be generated by composition from testsand random resettingsin the case that we are working over an infinite domain.These relations are precisely the ones expressible inDPL if we allow ourselves arbitrarytests as a starting point. We discuss some possible extensions of DPL and theway these extensions interact with our notion of context.