Cut-free tableau calculi for some propositional normal modal logics

DOI10.1007/BF00370840zbMath0857.03006OpenAlexW1977778918MaRDI QIDQ2563456

Martin Amerbauer

Publication date: 11 March 1997

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

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

zbMATH Keywords

sequent calculiinterpolation propertypropositional normal modal logicsanalytical cut-ruletableau-calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (8)

Hypersequent rules with restricted contexts for propositional modal logics ⋮ Cut elimination in coalgebraic logics ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Cut-elimination for weak Grzegorczyk logic Go ⋮ Around provability logic ⋮ Constructive Modalities with Provability Smack ⋮ Modal Logics that Bound the Circumference of Transitive Frames ⋮ Admissibility of Cut in Coalgebraic Logics

Cites Work

• Modal tableau calculi and interpolation
• Cut-free sequent and tableau systems for propositional Diodorean modal logics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cut-free tableau calculi for some propositional normal modal logics