Labelled tableaux for interpretability logics
From MaRDI portal
Abstract: In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of universal strict first order Horn sentences. As such, the current paper adds to a better proof-theoretical understanding of interpretability logics.
Recommendations
Cited in
(5)- Theory and application of labelling techniques for interpretability logics
- Labelled tableau systems for some subintuitionistic logics
- An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics
- Modular sequent calculi for interpretability logics
- Semantic Labelled Tableaux for Propositional BI
This page was built for publication: Labelled tableaux for interpretability logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224691)