Inducing Syntactic Cut-Elimination for Indexed Nested Sequents

DOI10.1007/978-3-319-40229-1_29zbMath1476.03082arXiv1703.01356OpenAlexW2501700916MaRDI QIDQ2817941

Revantha Ramanayake

Publication date: 5 September 2016

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.01356

zbMATH Keywords

modal logicproof theorycut-eliminationnested labelled sequents

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Uses Software

• NESCOND

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prefixed tableaus and nested sequents
• A cut-free sequent system for two-dimensional modal logic, and why it matters
• Proof analysis in intermediate logics
• Proof analysis in modal logic
• Proof methods for modal and intuitionistic logics
• Cut-free sequent calculi for some tense logics
• Indexed systems of sequents and cut-elimination
• Nested sequents for intuitionistic logics
• GEOMETRISATION OF FIRST-ORDER LOGIC
• On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
• Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
• A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY

This page was built for publication: Inducing Syntactic Cut-Elimination for Indexed Nested Sequents