Hypersequent rules with restricted contexts for propositional modal logics

DOI10.1016/J.TCS.2016.10.004zbMATH Open1402.03076OpenAlexW2535990237MaRDI QIDQ344801FDOQ344801

Björn Lellmann

Publication date: 24 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.10.004

Recommendations

• Axioms vs hypersequent rules with context restrictions: theory and applications
• From Frame Properties to Hypersequent Rules in Modal Logics
• Bounded sequent calculi for non-classical logics via hypersequents
• Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D
• Hypersequent calculi for S5: the methods of cut elimination

zbMATH Keywords

decidabilityHilbert axiomsmodal logiccut eliminationhypersequentsstructural proof theory

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05)

Cites Work

• Modal logic
• Untersuchungen über das logische Schliessen. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Display logic
• Unification in intuitionistic logic
• Admissible Rules of Modal Logics
• Automated Support for the Investigation of Paraconsistent and Other Logics
• Alternation
• Algebraic proof theory for substructural logics: cut-elimination and completions
• The proof by cases property and its variants in structural consequence relations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof analysis in modal logic
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
• First-order modal logic
• Prefixed tableaus and nested sequents
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gentzen calculi for modal propositional logic
• Cut-free sequent calculi for some tense logics
• Cut-free tableau calculi for some propositional normal modal logics
• A finite model construction for coalgebraic modal logic
• Title not available (Why is that?)
• Focused and Synthetic Nested Sequents
• Structural Extensions of Display Calculi: A General Recipe
• Bounded Proofs and Step Frames
• Hypersequent and Labelled Calculi for Intermediate Logics
• Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5
• Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic
• The Logic of Obligation as Weakest Permission
• Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications
• Proof Search in Nested Sequent Calculi
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic Programming with Focusing Proofs in Linear Logic
• Title not available (Why is that?)
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• Hypersequent Calculi for Godel Logics -- a Survey
• From Frame Properties to Hypersequent Rules in Modal Logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cut elimination in coalgebraic logics
• The bounded proof property via step algebras and step frames
• Towards a semantic characterization of cut-elimination
• Deep sequent systems for modal logic

Cited In (11)

• Intermediate logics admitting a structural hypersequent calculus
• Complexity of the universal theory of modal algebras
• Through an Inference Rule, Darkly
• BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
• Rooted hypersequent calculus for modal logic \textsf{S5}
• Hypersequents and Systems of Rules
• Natural deduction calculi for classical and intuitionistic S5
• Multicomponent proof-theoretic method for proving interpolation properties
• From Frame Properties to Hypersequent Rules in Modal Logics
• Complexity of the universal theory of residuated ordered groupoids
• CoNP complexity for combinations of non-normal modal logics

This page was built for publication: Hypersequent rules with restricted contexts for propositional modal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344801)