scientific article; zbMATH DE number 975278

zbMATH Open0861.03012MaRDI QIDQ5283968FDOQ5283968

Authors: Andrzej Indrzejczak 

Publication date: 4 February 1997

Title of this publication is not available (Why is that?)

Recommendations

• Cut-free double sequent calculus for S5
• Cut free sequent calculus for logic S5\(_n\)(ED)
• A cut-free simple sequent calculus for modal logic S5
• Hypersequent calculi for S5: the methods of cut elimination
• Simple decision procedure for \(\mathbf {S5}\) in standard cut-free sequent calculus
• Cut-free hypersequent calculus for S4.3.
• Sequent calculi for the modal \(\mu \)-calculus over S5
• Typed Lambda Calculi and Applications
• On a multilattice analogue of a hypersequent S5 calculus
• Cut-elimination and a permutation-free sequent calculus for intuitionistic logic

zbMATH Keywords

completeness theoremautomated proof-search proceduredouble sequent calculusnonstandard cut-free Gentzen formalization for S5

Mathematics Subject Classification ID

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

Cited In (6)

• Simple decision procedure for \(\mathbf {S5}\) in standard cut-free sequent calculus
• Hypersequent calculi for S5: the methods of cut elimination
• Tautology elimination, cut elimination, and S5
• Varieties of Relevant S5
• Cut free sequent calculus for logic S5\(_n\)(ED)
• Two is enough -- bisequent calculus for S5

This page was built for publication:

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