Proving completeness for nested sequent calculi

MaRDI QIDQ4918406zbMATH OpenFDO

Authors Melvin Fitting

Publication date 24 April 2013

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Recommendations

• Proof search in nested sequent calculi
• Modular sequent systems for modal logic
• Nested sequent calculi for normal conditional logics
• Nested sequent calculi for conditional logics
• Sequentialising nested systems

Cited in

(7)

• Completeness proof by semantic diagrams for transitive closure of accessibility relation
• On height and happiness
• Completeness and Decidability in Sequence Logic
• Nested sequents for provability logic GLP: FIG. 1.
• Terminating sequent calculi for proving and refuting formulas in S4
• scientific article; zbMATH DE number 7668098 (Why is no real title available?)
• Checking Sufficient Completeness by Inductive Theorem Proving

This page was built for publication: Proving completeness for nested sequent calculi

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