Theorem provers for substructural logics
From MaRDI portal
intuitionistic logiccut eliminationclassical logictableau systemrelevant logicsequent systemBCK logic
Classical propositional logic (03B05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Mechanization of proofs and logical operations (03B35)
Recommendations
- scientific article; zbMATH DE number 2099386
- Towards structurally-free theorem proving
- Algorithmic structural completeness and a retrieval system for proving theorems in algorithmic theories
- Proof finding algorithms for implicational logics
- Relational proof system for linear and other substructural logics
Cited in
(10)- Substructural logic and partial correctness
- scientific article; zbMATH DE number 1989651 (Why is no real title available?)
- scientific article; zbMATH DE number 1222430 (Why is no real title available?)
- scientific article; zbMATH DE number 2099386 (Why is no real title available?)
- Algorithmic structural completeness and a retrieval system for proving theorems in algorithmic theories
- Skolemization for Substructural Logics
- Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic
- scientific article; zbMATH DE number 1770113 (Why is no real title available?)
- A Sahlqvist theorem for substructural logic
- Some Remarks on Theorem Proving Systems and Mazurkiewicz Algorithms Associated with them
This page was built for publication: Theorem provers for substructural logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510441)