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 …
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 …
Automating reasoning with standpoint logic via nested sequents
Standpoint logic is a recently proposed formalism in the context of knowledge integration,
which advocates a multi-perspective approach permitting reasoning with a selection of …
which advocates a multi-perspective approach permitting reasoning with a selection of …
On the correspondence between nested calculi and semantic systems for intuitionistic logics
T Lyon - Journal of Logic and Computation, 2021 - academic.oup.com
This paper studies the relationship between labelled and nested calculi for propositional
intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order …
intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order …
Automating agential reasoning: Proof-calculi and syntactic decidability for stit logics
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 …
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
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 …
Internal and external calculi: Ordering the jungle without being lost in translations
This paper gives a broad account of the various sequent-based proof formalisms in the proof-
theoretic literature. We consider formalisms for various modal and tense logics, intuitionistic …
theoretic literature. We consider formalisms for various modal and tense logics, intuitionistic …
Nested Sequents or Tree-Hypersequents—A Survey
This paper presents an overview of the methods of nested sequents or tree-hypersequents
that were originally introduced to provide a comprehensive proof theory for modal logic. The …
that were originally introduced to provide a comprehensive proof theory for modal logic. The …
Foundations for an abstract proof theory in the context of Horn rules
We introduce a novel, logic-independent framework for the study of sequent-style proof
systems, which covers a number of proof-theoretic formalisms and concrete proof systems …
systems, which covers a number of proof-theoretic formalisms and concrete proof systems …