Labelled tableaux for interpretability logics [article]

Tuomas A. Hakoniemi, Joost J. Joosten
2016 arXiv   pre-print
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.
arXiv:1605.05612v1 fatcat:4vkfmnnyj5drrgxxqa3pnic7em