Labelled tableaux for interpretability logics
Logic
2016-05-19 v1
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.
Keywords
Cite
@article{arxiv.1605.05612,
title = {Labelled tableaux for interpretability logics},
author = {Tuomas A. Hakoniemi and Joost J. Joosten},
journal= {arXiv preprint arXiv:1605.05612},
year = {2016}
}
Comments
Dedicated to Albert Visser on the occasion of his retirement. In: Liber Amicorum Alberti, A Tribute to Albert Visser, Eds. Jan van Eijck, Rosalie Iemhoff and Joost J. Joosten, p. 141-154, Tributes Series Vol. 30, College Publications, London. ISBN 978-1-84890-204-6, 2016