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

DOI10.1007/BF01057938zbMath0807.03036OpenAlexW2127383193MaRDI QIDQ1337606

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 logiclinear timedecision procedurespropositional 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)

Related Items (6)

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

Cites Work

• Modal tableau calculi and interpolation
• Proof methods for modal and intuitionistic logics
• First-order modal tableaux
• Temporal logic can be more expressive
• A Syntactic Proof of Cut‐Elimination For GL_lin
• Transitivity follows from Dummett's axiom
• An algebraic study of Diodorean modal systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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