221 research outputs found
The Basics of Display Calculi
The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem. Propositional, first-order, and modal display calculi are considered and their properties detailed
Inducing syntactic cut-elimination for indexed nested sequents
The key to the proof-theoretic study of a logic is a proof calculus with a
subformula property. Many different proof formalisms have been introduced (e.g.
sequent, nested sequent, labelled sequent formalisms) in order to provide such
calculi for the many logics of interest. The nested sequent formalism was
recently generalised to indexed nested sequents in order to yield proof calculi
with the subformula property for extensions of the modal logic K by
(Lemmon-Scott) Geach axioms. The proofs of completeness and cut-elimination
therein were semantic and intricate. Here we show that derivations in the
labelled sequent formalism whose sequents are `almost treelike' correspond
exactly to indexed nested sequents. This correspondence is exploited to induce
syntactic proofs for indexed nested sequent calculi making use of the elegant
proofs that exist for the labelled sequent calculi. A larger goal of this work
is to demonstrate how specialising existing proof-theoretic transformations
alleviate the need for independent proofs in each formalism. Such coercion can
also be used to induce new cutfree calculi. We employ this to present the first
indexed nested sequent calculi for intermediate logics.Comment: This is an extended version of the conference paper [20
Grafting Hypersequents onto Nested Sequents
We introduce a new Gentzen-style framework of grafted hypersequents that
combines the formalism of nested sequents with that of hypersequents. To
illustrate the potential of the framework, we present novel calculi for the
modal logics and , as well as for extensions of the
modal logics and with the axiom for shift
reflexivity. The latter of these extensions is also known as
in the context of deontic logic. All our calculi enjoy syntactic cut
elimination and can be used in backwards proof search procedures of optimal
complexity. The tableaufication of the calculi for and
yields simplified prefixed tableau calculi for these logic
reminiscent of the simplified tableau system for , which might be
of independent interest
Sequent calculi and interpolation for non-normal modal and deonticlogics
G3-style sequent calculi for the logics in the cube of non-normal modal
logics and for their deontic extensions are studied. For each calculus we prove
that weakening and contraction are height-preserving admissible, and we give a
syntactic proof of the admissibility of cut. This implies that the subformula
property holds and that derivability can be decided by a terminating proof
search whose complexity is in PSPACE. These calculi are shown to be equivalent
to the axiomatic ones and, therefore, they are sound and complete with respect
to neighbourhood semantics. Finally, it is given a Maehara-style proof of
Craig's interpolation theorem for most of the logics considered
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics,
presented in a formalism based on nested sequents. A nested sequent can be seen
as a tree of traditional single-sided sequents. Our first style of calculi is
what we call "shallow calculi", where inference rules are only applied at the
root node in a nested sequent. Our shallow calculi are extensions of Kashima's
calculus for tense logic and share an essential characteristic with display
calculi, namely, the presence of structural rules called "display postulates".
Shallow calculi enjoy a simple cut elimination procedure, but are unsuitable
for proof search due to the presence of display postulates and other structural
rules. The second style of calculi uses deep-inference, whereby inference rules
can be applied at any node in a nested sequent. We show that, for a range of
extensions of tense logic, the two styles of calculi are equivalent, and there
is a natural proof theoretic correspondence between display postulates and deep
inference. The deep inference calculi enjoy the subformula property and have no
display postulates or other structural rules, making them a better framework
for proof search
Intuitionistic Non-Normal Modal Logics: A general framework
We define a family of intuitionistic non-normal modal logics; they can bee
seen as intuitionistic counterparts of classical ones. We first consider
monomodal logics, which contain only one between Necessity and Possibility. We
then consider the more important case of bimodal logics, which contain both
modal operators. In this case we define several interactions between Necessity
and Possibility of increasing strength, although weaker than duality. For all
logics we provide both a Hilbert axiomatisation and a cut-free sequent
calculus, on its basis we also prove their decidability. We then give a
semantic characterisation of our logics in terms of neighbourhood models. Our
semantic framework captures modularly not only our systems but also already
known intuitionistic non-normal modal logics such as Constructive K (CK) and
the propositional fragment of Wijesekera's Constructive Concurrent Dynamic
Logic.Comment: Preprin
- …