Cut Elimination for Propositional Dynamic Logic without

@article{Bull1992CutEF,
  title={Cut Elimination for Propositional Dynamic Logic without},
  author={Robert A. Bull},
  journal={Math. Log. Q.},
  year={1992},
  volume={38},
  pages={85-100}
}
The aim of this paper is to extend the semantic analysis of tense logic in ReschedUrquhart [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. 

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…