Labelled tableaux for interpretability logics release_4vkfmnnyj5drrgxxqa3pnic7em

by Tuomas A. Hakoniemi, Joost J. Joosten

Released as a article .

2016  

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.
In text/plain format

Archived Files and Locations

application/pdf  178.4 kB
file_3zqndydwl5cu3lyexbiwtki5di
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2016-05-18
Version   v1
Language   en ?
arXiv  1605.05612v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ddbe13a1-a888-4b92-a6c6-e37be1d35076
API URL: JSON