Displaying and deciding substructural logics. I: Logics with contraposition
DOI10.1023/A:1017998605966zbMath0913.03029OpenAlexW1967623108MaRDI QIDQ1267081
Publication date: 24 May 1999
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017998605966
decidabilitycut-eliminationcorrespondence theorydisplay logicrelevant logicsintuitionistic implicationdisplay proof theory
Decidability of theories and sets of sentences (03B25) Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items (13)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Simplified semantics for relevant logics (and some of their rivals)
- Linear logic displayed
- The word problem for Smullyan's lark combinator is decidable
- How to decide the lark
- Display logic
- Gentzenization and decidability of some contraction-less relevant logics
- The undecidability of entailment and relevant implication
This page was built for publication: Displaying and deciding substructural logics. I: Logics with contraposition