Hypersequent rules with restricted contexts for propositional modal logics

DOI10.1016/J.TCS.2016.10.004MaRDI QIDQ344801zbMATHOpenAlexFDO

Authors 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

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)

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

Cites work

• scientific article; zbMATH DE number 1612551 (Why is no real title available?)
• scientific article; zbMATH DE number 956466 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 48365 (Why is no real title available?)
• scientific article; zbMATH DE number 149884 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1749009 (Why is no real title available?)
• scientific article; zbMATH DE number 1765698 (Why is no real title available?)
• scientific article; zbMATH DE number 6863852 (Why is no real title available?)
• scientific article; zbMATH DE number 755666 (Why is no real title available?)
• scientific article; zbMATH DE number 5263148 (Why is no real title available?)
• scientific article; zbMATH DE number 970628 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A cut-free simple sequent calculus for modal logic S5
• A finite model construction for coalgebraic modal logic
• Admissible Rules of Modal Logics
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
• Algebraic proof theory for substructural logics: cut-elimination and completions
• Alternation
• Automated support for the investigation of paraconsistent and other logics
• Axioms vs hypersequent rules with context restrictions: theory and applications
• Bounded proofs and step frames
• Constructing cut free sequent systems with context restrictions based on classical or intuitionistic logic
• Correspondence between modal Hilbert axioms and sequent rules with an application to S5
• Cut elimination in coalgebraic logics
• Cut-free hypersequent calculus for S4.3.
• Cut-free sequent calculi for some tense logics
• Cut-free tableau calculi for some propositional normal modal logics
• Deep sequent systems for modal logic
• Display logic
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• First-order modal logic
• Focused and Synthetic Nested Sequents
• From Frame Properties to Hypersequent Rules in Modal Logics
• Gentzen calculi for modal propositional logic
• Hypersequent Calculi for Godel Logics -- a Survey
• Hypersequent and labelled calculi for intermediate logics
• Label-free modular systems for classical and intuitionistic modal logics
• Logic Programming with Focusing Proofs in Linear Logic
• Modal logic
• Prefixed tableaus and nested sequents
• Proof analysis in modal logic
• Proof search in nested sequent calculi
• Structural extensions of display calculi: a general recipe
• The Logic of Obligation as Weakest Permission
• The bounded proof property via step algebras and step frames
• The proof by cases property and its variants in structural consequence relations
• Towards a semantic characterization of cut-elimination
• Unification in intuitionistic logic
• Untersuchungen über das logische Schliessen. I

Cited in

(14)

• Axioms vs hypersequent rules with context restrictions: theory and applications
• Intermediate logics admitting a structural hypersequent calculus
• Natural deduction calculi for classical and intuitionistic S5
• Complexity of the universal theory of residuated ordered groupoids
• Embedding formalisms: hypersequents and two-level systems of rules
• Bounded sequent calculi for non-classical logics via hypersequents
• Rooted hypersequent calculus for modal logic \textsf{S5}
• CoNP complexity for combinations of non-normal modal logics
• Through an inference rule, darkly
• Hypersequents and Systems of Rules
• Complexity of the universal theory of modal algebras
• Multicomponent proof-theoretic method for proving interpolation properties
• BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
• From Frame Properties to Hypersequent Rules in 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)