Indexed systems of sequents and cut-elimination

DOI10.1023/A:1017948105274zbMATH Open0885.03043OpenAlexW2041248160MaRDI QIDQ1372944FDOQ1372944

Authors: G. E. 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

Recommendations

• scientific article; zbMATH DE number 6987093
• Inducing syntactic cut-elimination for indexed nested sequents
• scientific article; zbMATH DE number 1823879
• Typed Lambda Calculi and Applications
• Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus
• Cut elimination for systems of transparent truth with restricted initial sequents
• Cut elimination in nested sequents for intuitionistic modal logics
• Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
• Cut elimination for Gentzen's sequent calculus with equality and logic of partial terms
• Proof theory for indexed nested sequents

zbMATH Keywords

display logicmodal logiccut-eliminationindexed tableauxsystems of indexed sequents

Mathematics Subject Classification ID

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

Cites Work

• Untersuchungen über das logische Schliessen. I
• Title not available (Why is that?)
• Display logic
• Title not available (Why is that?)
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof methods for modal and intuitionistic logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequent Calculi for Normal Modal Propositional Logics
• Semantics-Based Translation Methods for Modal Logics

Cited In (22)

• Proof theory for indexed nested sequents
• Through an inference rule, darkly
• Title not available (Why is that?)
• Inducing syntactic cut-elimination for indexed nested sequents
• Display calculi and other modal calculi: a comparison
• A natural deduction calculus for \textbf{S4.2}
• The Method of Tree-Hypersequents for Modal Propositional Logic
• A method of mutual conversion of labeled and tableau deduction
• Proof analysis in modal logic
• Rooted hypersequent calculus for modal logic \textsf{S5}
• Logical derivation search with assumption traceability
• Proofs and countermodels in non-classical logics
• Tableaux and hypersequents for justification logics
• Cut Elimination for Extended Sequent Calculi
• Multicomponent proof-theoretic method for proving interpolation properties
• Cut-free formulations for a quantified logic of here and there
• Title not available (Why is that?)
• Interpolation theorems for intuitionistic predicate logic
• Sufficient conditions for cut elimination with complexity analysis
• Analytic cut in modal logic: the system B
• Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut
• A cut-free simple sequent calculus for modal logic S5

This page was built for publication: Indexed systems of sequents and cut-elimination

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