Unified correspondence as a proof-theoretic tool
The present article aims at establishing formal connections between correspondence
phenomena, well known from the area of modal logic, and the theory of display calculi …
phenomena, well known from the area of modal logic, and the theory of display calculi …
Label-free modular systems for classical and intuitionistic modal logics
S Marin, L Straßburger - Advances in Modal Logic 10, 2014 - inria.hal.science
In this paper we show for each of the modal axioms d, t, b, 4, and 5 an equivalent set of
inference rules in a nested sequent system, such that, when added to the basic system for …
inference rules in a nested sequent system, such that, when added to the basic system for …
Syntactic interpolation for tense logics and bi-intuitionistic logic via nested sequents
We provide a direct method for proving Craig interpolation for a range of modal and
intuitionistic logics, including those containing a" converse" modality. We demonstrate this …
intuitionistic logics, including those containing a" converse" modality. We demonstrate this …
Refining labelled systems for modal and constructive logics with applications
T Lyon - arXiv preprint arXiv:2107.14487, 2021 - arxiv.org
This thesis introduces the" method of structural refinement", which serves as a means of
transforming the relational semantics of a modal and/or constructive logic into …
transforming the relational semantics of a modal and/or constructive logic into …
Automating agential reasoning: Proof-calculi and syntactic decidability for stit logics
T Lyon, K van Berkel - International conference on principles and practice …, 2019 - Springer
This work provides proof-search algorithms and automated counter-model extraction for a
class of STIT logics. With this, we answer an open problem concerning syntactic decision …
class of STIT logics. With this, we answer an open problem concerning syntactic decision …
Power and limits of structural display rules
A Ciabattoni, R Ramanayake - ACM Transactions on Computational …, 2016 - dl.acm.org
What can (and cannot) be expressed by structural display rules? Given a display calculus,
we present a systematic procedure for transforming axioms into structural rules. The …
we present a systematic procedure for transforming axioms into structural rules. The …
Hypersequent and display calculi–a unified perspective
A Ciabattoni, R Ramanayake, H Wansing - Studia Logica, 2014 - Springer
This paper presents an overview of the methods of hypersequents and display sequents in
the proof theory of non-classical logics. In contrast with existing surveys dedicated to …
the proof theory of non-classical logics. In contrast with existing surveys dedicated to …
Grammar logics in nested sequent calculus: Proof theory and decision procedures
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms
are generated from a formal grammar. We consider a proof theory, in nested sequent …
are generated from a formal grammar. We consider a proof theory, in nested sequent …
Nested sequents for intuitionistic modal logics via structural refinement
TS Lyon - … Conference on Automated Reasoning with Analytic …, 2021 - Springer
We employ a recently developed methodology—called structural refinement—to extract
nested sequent systems for a sizable class of intuitionistic modal logics from their respective …
nested sequent systems for a sizable class of intuitionistic modal logics from their respective …
Display to labeled proofs and back again for tense logics
A Ciabattoni, TS Lyon, R Ramanayake… - ACM Transactions on …, 2021 - dl.acm.org
We introduce translations between display calculus proofs and labeled calculus proofs in
the context of tense logics. First, we show that every derivation in the display calculus for the …
the context of tense logics. First, we show that every derivation in the display calculus for the …