On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics

Goré, Rajeev; Postniece, Linda; Tiu, Alwen

doi:10.2168/lmcs-7(2:8)2011

Cited by 28 publications

(103 citation statements)

References 17 publications

Supporting

Mentioning

101

Contrasting

Order By: Relevance

“…[5,6,16,14,15,11] introduce methods to extract rules out of suitable Hilbert axioms. More precisely [5,6] generate sequent and hypersequent rules, [11] nested sequent rules, [15] sequent rules for certain modal axioms, and [16] labelled rules; finally [14] transforms suitable modal and tense axioms (called primitive tense axioms) into structural rules for the display calculus. [14] also provides a characterisation as it is shown that each such rule added to the base system is equivalent to the extension of the logic by primitive tense axioms.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Structural Extensions of Display Calculi: A General Recipe

Ciabattoni

Ramanayake

2013

Logic, Language, Information, and Computation

View full text Add to dashboard Cite

Abstract. We present a systematic procedure for constructing cut-free display calculi for axiomatic extensions of a logic via structural rule extensions. The sufficient conditions for the procedure are given in terms of (purely syntactic) abstract properties of the display calculus and thus the method applies to large classes of calculi and logics. As a case study, we present cut-free calculi for extensions of well-known logics including Bi-intuitionistic and tense logic.

show abstract

Section: Introductionmentioning

confidence: 99%

“…All the above results start with a specific logic and introduce calculi for (some of) its axiomatic extensions, e.g., Full Lambek calculus with exchange FLe for [5,6], or the tense logic Kt for [14,11]. This paper proposes instead a recipe that utilises the more common Hilbert axioms to construct analytic calculi 1 .…”

Section: Introductionmentioning

confidence: 99%

Structural Extensions of Display Calculi: A General Recipe

Ciabattoni

Ramanayake

2013

Logic, Language, Information, and Computation

View full text Add to dashboard Cite

show abstract

“…right-sided) if in its positive (resp. negative) signed generation tree, 32 every positive node is labelled with a structural connective which is associated with a logical connective when occurring in antecedent position, and every negative node is labelled with a structural connective which is associated with a logical connective when occurring in succedent position.…”

Section: Soundness Completeness Conservativitymentioning

confidence: 99%

“…In recent years, these questions have been intensely investigated in the context of various proof-theoretic formalisms (cf. [39,6,10,32,7,36,34,38,35]). Perhaps the first paper in this line of research is [33], which addresses these questions in the setting of display calculi for basic normal modal and tense logic.…”

mentioning

confidence: 99%

Unified correspondence as a proof-theoretic tool

Greco

Palmigiano

et al. 2016

J Logic Computation

158

View full text Add to dashboard Cite

The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap.These connections have been seminally observed and exploited by Marcus Kracht, in the context of his characterization of the modal axioms (which he calls primitive formulas) which can be effectively transformed into 'analytic' structural rules of display calculi. In this context, a rule is 'analytic' if adding it to a display calculus preserves Belnap's cut-elimination theorem.In recent years, the state-of-the-art in correspondence theory has been uniformly extended from classical modal logic to diverse families of nonclassical logics, ranging from (bi-)intuitionistic (modal) logics, linear, relevant and other substructural logics, to hybrid logics and mu-calculi. This generalization has given rise to a theory called unified correspondence, the most important technical tools of which are the algorithm ALBA, and the syntactic characterization of Sahlqvisttype classes of formulas and inequalities which is uniform in the setting of normal DLE-logics (logics the algebraic semantics of which is based on bounded distributive lattices).We apply unified correspondence theory, with its tools and insights, to extend Kracht's results and prove his claims in the setting of DLE-logics. The results of the present paper characterize the space of properly displayable DLE-logics. Keywords: Display calculi, unified correspondence, distributive lattice expansions, properly displayable logics. Math. Subject Class. 03B45, 06D50, 06D10, 03G10, 06E15. , and mu-calculus [11,12]. The breadth of this work has stimulated many and varied applications. Some are closely related to the core concerns of the theory itself, such as the understanding of the relationship between different methodologies for obtaining canonicity results [40,15], or of the phenomenon of pseudocorrespondence [19]. Other, possibly surprising applications include the dual characterizations of classes of finite lattices [27]. Finally, the insights of unified correspondence theory have made it possible to determine the extent to which the Sahlqvist theory of classes of normal DLEs can be reduced to the Sahlqvist theory of normal Boolean expansions, by means of Gödel-type translations [20]. These and other results have given rise to a theory called unified correspondence [13]. Contents Tools of unified correspondence theory.The most important technical tools in unified correspondence are: (a) a very general syntactic definition of the class of Sahlqvist formulas, which applies uniformly to each logical signature and is given purely in terms of the order-theoretic properties of the algebraic interpretations of the logical connectives; (b) the algorithm ALBA, which effectively computes first-order correspondents of input term-inequalities, and is guaranteed to succeed on a wide class of inequalities (the so-called inductive inequalities) which, like the Sahlqvist class, can be defi...

show abstract

“…calculus [14,2] is a popular proof formalism that has been used to present intuitionistic logic [7], conditional logics [18], logics in the classical and intuitionistic modal cube [14,22,15] and path axiom extensions of classical modal logic [12]. The idea is to use a tree of traditional sequents as the basic building block rather than just a single traditional sequent.…”

Section: Introductionmentioning

confidence: 99%

Inducing Syntactic Cut-Elimination for Indexed Nested Sequents

Ramanayake

2016

Automated Reasoning

View full text Add to dashboard Cite

Abstract. The key to the proof-theoretical study of a logic is a cutfree proof calculus. Unfortunately there are many logics of interest lacking suitable proof calculi. The proof formalism of nested sequents was recently generalised to indexed nested sequents in order to yield cutfree proof calculi for extensions of the modal logic K by Geach (LemmonScott) axioms. The proofs of completeness and cut-elimination therein were semantical and intricate. Here we identify a subclass of the labelled sequent formalism and show that it corresponds to the indexed nested sequent formalism. This correspondence is then exploited to induce syntactic proofs for indexed nested sequents using the elegant existing proofs in the labelled sequent formalism. A larger goal of this work is to demonstrate how specialising existing proof-theoretical transformations (adapting these as required to remain within the subclass) is an alternative means of argument which can alleviate the need for independent proofs from 'scratch' in each formalism. Moreover, such coercion can be used to induce new cutfree calculi. We demonstrate by presenting the first indexed nested sequent calculi for intermediate logics. Finally, we introduce a notion of duplicate subgraph using certain graph automorphisms-generalising the notion of contraction for labelled sequents whose underlying structure is more general than trees-yielding a normal form for derivations. We envisage that such notions might be employed in order to prove decidability of a logic using its restricted labelled calculus.

show abstract

On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics

Cited by 28 publications

References 17 publications

Structural Extensions of Display Calculi: A General Recipe

Structural Extensions of Display Calculi: A General Recipe

Unified correspondence as a proof-theoretic tool

Inducing Syntactic Cut-Elimination for Indexed Nested Sequents

Contact Info

Product

Resources

About