CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT
Author:
- 1 January 1992
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 38 (1) , 85-100
Abstract
The aim of this paper is to extend the semantic analysis of tense logic in Rescher/Urquhart [3] to propositional dynamic logic without*. For this we develop a nested sequential calculus whose axioms and rules directly reflect the steps in the semantic analysis. It is shown that this calculus, with the cut rule omitted, is complete with respect to the standard semantics. It follows that cut elimination does hold for this nested sequential calculus. MSC: 03B45.Keywords
This publication has 2 references indexed in Scilit:
- Sequential method in propositional dynamic logicActa Informatica, 1979
- Temporal Logic1971