Indexed systems of sequents and cut-elimination

DOI10.1023/A:1017948105274zbMath0885.03043OpenAlexW2041248160MaRDI QIDQ1372944

Grigori Mints

Publication date: 15 April 1998

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017948105274

zbMATH Keywords

modal logiccut-eliminationdisplay logicindexed tableauxsystems of indexed sequents

Mathematics Subject Classification ID

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

Related Items

Logical derivation search with assumption traceability, Rooted hypersequent calculus for modal logic \textsf{S5}, Tableaux and hypersequents for justification logics, Cut Elimination for Extended Sequent Calculi, Cut-free formulations for a quantified logic of here and there, Sufficient conditions for cut elimination with complexity analysis, Through an Inference Rule, Darkly, Proofs and countermodels in non-classical logics, A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5, Unnamed Item, Display calculi and other modal calculi: a comparison, The Method of Tree-Hypersequents for Modal Propositional Logic, Interpolation theorems for intuitionistic predicate logic, Multicomponent proof-theoretic method for proving interpolation properties, Inducing Syntactic Cut-Elimination for Indexed Nested Sequents, Proof analysis in modal logic

Cites Work

• Proof methods for modal and intuitionistic logics
• Display logic
• Untersuchungen über das logische Schliessen. I
• Semantics-Based Translation Methods for Modal Logics
• Sequent Calculi for Normal Modal Propositional Logics
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item