CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT

DOI10.1002/malq.19920380107zbMath0793.03021OpenAlexW2018205748MaRDI QIDQ4295221

R. A. Bull

Publication date: 30 August 1994

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19920380107

zbMATH Keywords

cut eliminationtense logicsemantic analysispropositional dynamic logicsequential calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Related Items

Deep sequent systems for modal logic ⋮ Nested sequents for intuitionistic modal logics via structural refinement ⋮ A pure view of ecumenical modalities ⋮ An ecumenical notion of entailment ⋮ Nested sequents for intermediate logics: the case of Gödel-Dummett logics ⋮ Through an Inference Rule, Darkly ⋮ Dynamic non-commutative logic ⋮ Multicomponent proof-theoretic method for proving interpolation properties ⋮ Cut-free sequent calculi for some tense logics

This page was built for publication: CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT