Cut-free sequent and tableau systems for propositional Diodorean modal logics

DOI10.1007/BF01057938zbMATH Open0807.03036OpenAlexW2127383193MaRDI QIDQ1337606FDOQ1337606

Rajeev Goré

Publication date: 10 November 1994

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01057938

zbMATH Keywords

temporal logicdecision procedureslinear timepropositional normal modal logiccut-free tableau systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Temporal logic can be more expressive
• Modal tableau calculi and interpolation
• Proof methods for modal and intuitionistic logics
• Transitivity follows from Dummett's axiom
• First-order modal tableaux
• An algebraic study of Diodorean modal systems
• A Syntactic Proof of Cut‐Elimination For GL_lin

Cited In (7)

• Cut-free tableau calculi for some propositional normal modal logics
• Machine-Checked Proof-Theory for Propositional Modal Logics
• Resolution-based calculi for modal and temporal logics
• The complexity of propositional linear temporal logics in simple cases
• Admissibility of cut in coalgebraic logics
• Cut elimination in coalgebraic logics
• Cut-free systems for three-valued modal logics

This page was built for publication: Cut-free sequent and tableau systems for propositional Diodorean modal logics

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