Almost duplication-free tableau calculi for prepositional lax logics

DOI10.1007/3-540-61208-4_4zbMath1415.03013OpenAlexW1512137820MaRDI QIDQ4645225

Alessandro Avellone, Mauro Ferrari

Publication date: 10 January 2019

Published in: Theorem Proving with Analytic Tableaux and Related Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61208-4_4

zbMATH Keywords

duplicationsrefutation systemsintuitionistic modal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35)

Related Items

Propositional lax logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof methods for modal and intuitionistic logics
• Models for normal intuitionistic modal logics
• Semantical investigations in Heyting's intuitionistic logic
• Constructivism in mathematics. An introduction. Volume I
• On modal logic with an intuitionistic base
• A uniform tableau method for intuitionistic modal logics. I
• An improved refutation system for intuitionistic predicate logic
• Cut-free tableau calculi for some intuitionistic modal logics
• The elimination theorem when modality is present