A semantical analysis of cut-free calculi for modal logics

DOI10.4467/20842589RM.18.003.8836MaRDI QIDQ4627724OpenAlexFDO

Authors Mitio Takano

Publication date 11 March 2019

Published in Reports on Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4467/20842589rm.18.003.8836

zbMATH Keywords

sequent calculuscut-eliminationfinite model propertysubformula propertyKripke completeness

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Cut-free modal sequents for normal modal logics
• Proof analysis in modal logic
• Modal sequents for normal modal logics
• Deep sequent systems for modal logic
• Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D

Cited in

(25)

• scientific article; zbMATH DE number 7297836 (Why is no real title available?)
• Cut-free sequent calculi for logics characterized by finite linear Kripke frames
• A modified subformula property for the modal logic KG1
• Analytic cut in modal logic: the system B
• Semantical approach to cut elimination and subformula property in modal logic
• Cut-free systems for three-valued modal logics
• Cut elimination for shallow modal logics
• Cut-free modal theory of definite descriptions
• Effective finite-valued semantics for labelled calculi
• Subformula property for some modal logics
• A systematic proof theory for several modal logics
• A modified subformula property for the modal logic KC4
• Admissibility of cut in congruent modal logics
• Cut-free modal sequents for normal modal logics
• Semantical proof of subformula property for the modal logics \(\mathbf{K4.3}\), \(\mathbf{KD4.3}\), and \(\mathbf{S4.3}\)
• A modified subformula property for the modal logic S4.2
• Cut-free completeness for modular hypersequent calculi for modal logics K, T, and D
• Cut-elimination theorems for some infinitary modal logics
• Is cut-free logic fit for unrestricted abstraction?
• Analysis and synthesis of logics. How to cut and paste reasoning systems
• A cut-free sequent system for two-dimensional modal logic, and why it matters
• New modification of the subformula property for a modal logic
• A proof-theoretic analysis of the meaning of a formula in a combination of intuitionistic and classical propositional logic
• Non-labelled sequent calculi of public announcement expansions of \textbf{K45} and \textbf{S5}
• Cut-free sequent calculi for products and relativised products of modal logics

This page was built for publication: A semantical analysis of cut-free calculi for modal logics

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