Indexed systems of sequents and cut-elimination
From MaRDI portal
(Redirected from Publication:1372944)
Recommendations
- Inducing syntactic cut-elimination for indexed nested sequents
- 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
Cites work
- scientific article; zbMATH DE number 48365 (Why is no real title available?)
- scientific article; zbMATH DE number 49746 (Why is no real title available?)
- scientific article; zbMATH DE number 1489626 (Why is no real title available?)
- scientific article; zbMATH DE number 3222098 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 3074067 (Why is no real title available?)
- Display logic
- Proof methods for modal and intuitionistic logics
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- Semantics-Based Translation Methods for Modal Logics
- Sequent Calculi for Normal Modal Propositional Logics
- Untersuchungen über das logische Schliessen. I
Cited in
(22)- Proof theory for indexed nested sequents
- Through an inference rule, darkly
- scientific article; zbMATH DE number 1163926 (Why is no real title available?)
- 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
- Proof analysis in modal logic
- A method of mutual conversion of labeled and tableau deduction
- 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
- Multicomponent proof-theoretic method for proving interpolation properties
- Cut Elimination for Extended Sequent Calculi
- Cut-free formulations for a quantified logic of here and there
- scientific article; zbMATH DE number 6987093 (Why is no real title available?)
- 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)