Mathematical logic quarterly · 1992 · 38 citations · 1 references
ComputingComputer ScienceMathematicsFormal MethodsLogicSemanticsAutomated ReasoningDeductive ReasoningPropositional LogicTense SemanticsDynamic LogicEliminationPropositional Calculus
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.
1
Sequential method in propositional dynamic logic
Hirokazu Nishimura · Acta Informatica · 1979 · 27 citations