CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT

DOI10.1002/MALQ.19920380107MaRDI QIDQ4295221zbMATH OpenOpenAlexFDO

Authors 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 eliminationpropositional dynamic logicsemantic analysissequential calculustense logic

Mathematics Subject Classification ID

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

Recommendations

• A contraction-free and cut-free sequent calculus for propositional dynamic logic
• A note on cut-elimination for classical propositional logic
• Cut-elimination for quantified conditional logic
• Cut elimination for the unified logic
• A cut-elimination proof in intuitionistic predicate logic
• Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
• Cut elimination for a logic with induction and co-induction
• Bounds for cut elimination in intuitionistic propositional logic
• scientific article; zbMATH DE number 48659
• Cut elimination in coalgebraic logics

Cited in

(22)

• Cut-free sequent calculi for some tense logics
• Multicomponent proof-theoretic method for proving interpolation properties
• Nested sequents for intuitionistic modal logics via structural refinement
• A pure view of ecumenical modalities
• Dynamic non-commutative logic
• Through an inference rule, darkly
• scientific article; zbMATH DE number 3912349 (Why is no real title available?)
• Cut Might Cautiously
• An ecumenical notion of entailment
• Nested sequents for intermediate logics: the case of Gödel-Dummett logics
• Justification logic for intuitionistic modal logic
• Internal and external calculi: ordering the jungle without being lost in translations
• Separability and harmony in ecumenical systems
• Nested-sequent calculus for modal logic \textbf{MB}
• Nested sequents or tree-hypersequents -- a survey
• Proof theory and decision procedures for deontic STIT logics
• Beyond semantic pollution: towards a practice-based philosophical analysis of labelled calculi
• Taking bi-intuitionistic logic first-order: a proof-theoretic investigation via polytree sequents
• Unifying sequent systems for Gödel-Löb provability logic via syntactic transformations
• A formal characterization of semantic pollution of modal proof systems
• Deep sequent systems for modal logic
• A contraction-free and cut-free sequent calculus for propositional dynamic logic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4295221)