Dynamic reasoning without variables
A variable free notation for dynamic logic is proposed which takes its cue from De Bruijn's variable free notation for lambda calculus. De Bruijn indexing replaces variables by indices which indicate the distance to their binders. We propose to use reverse De Bruijn indexing, which works almost the same, only now the indices refer to the depth of the binding operator in the formula. The resulting system is analysed at length and applied to a new rational reconstruction of discourse representation theory. It is argued that the present system of dynamic logic without variables provides an explicit account of anaphoric context and yields new insight into the dynamics of anaphoric linking in reasoning. A calculus for dynamic reasoning with anaphora is presented and its soundness and completeness are established.
|Knowledge Representation Formalisms and Methods (acm I.2.4), Natural Language Processing (acm I.2.7)|
|Logic of natural languages (msc 03B65), Semantics (msc 68Q55)|
|Information Systems [INS]|
|Organisation||Standardization and Knowledge Transfer|
van Eijck, D.J.N. (1998). Dynamic reasoning without variables. Information Systems [INS]. CWI.