Tableaux and hypersequents for justification logics

DOI10.1016/j.apal.2011.09.013zbMath1239.03010OpenAlexW1981979308MaRDI QIDQ408538

Hidenori Kurokawa

Publication date: 10 April 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2011.09.013

zbMATH Keywords

modal logictableauxjustification logichypersequents

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logics of knowledge and belief (including belief change) (03B42) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (1)

Labeled sequent calculus for justification logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof methods for modal and intuitionistic logics
• Indexed systems of sequents and cut-elimination
• Single step tableaux for modal logics. Computational properties, complexity and methodology
• On the complexity of the reflected logic of proofs
• Explicit Provability and Constructive Semantics
• Introducing Justification into Epistemic Logic
• Tableaux and Hypersequents for Justification Logic
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Logics With Several Modal Operators

This page was built for publication: Tableaux and hypersequents for justification logics