Contraction-elimination for implicational logics
DOI10.1016/S0168-0072(97)81394-2zbMATH Open0872.03037OpenAlexW2071338206MaRDI QIDQ676308FDOQ676308
Authors: Ryo Kashima 
Publication date: 6 October 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(97)81394-2
Recommendations
- Contraction-free sequent calculi for intuitionistic logic
- The proof-theoretical analysis of contraction-less relevant logics
- scientific article; zbMATH DE number 823590
- Contraction in propositional logic
- Contraction in propositional logic
- Note on deduction theorems in contraction-free logics
- Deduction theorems for weak implicational logics
- The contraction rule and decision problems for logics without structural rules
- On a contraction-less intuitionistic propositional logic with conjunction and fusion
- Algorithmic proof methods and cut elimination for implicational logics. I: Modal implication
intuitionistic logicclassical logicBCK-logiccontraction rulesGentzen-type formulationsimplicational fragments
Other nonclassical logic (03B60) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20)
Cites Work
Cited In (12)
- Belief Contraction, Anti-formulae and Resource Overdraft: Part I Deletion in Resource Bounded Logics
- Title not available (Why is that?)
- Contraction contracted
- Contraction-free sequent calculi for intuitionistic logic
- Contraction in propositional logic
- Investigations into a left-structural right-substructural sequent calculus
- Rule-elimination theorems
- On permuting cut with contraction
- Logics without the contraction rule
- Title not available (Why is that?)
- Contraction-free proofs and finitary games for linear logic
- Title not available (Why is that?)
This page was built for publication: Contraction-elimination for implicational logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676308)
