Name
Abstract | ||
|---|---|---|
Substructural logics are traditionally obtained by dropping some or all of the structural rules from Gentzen's sequent calculi LK or LJ. It is well known that the usual logical connectives then split into more than one connective. Alternatively, one can start with the (intuitionistic) Lambek calculus, which contains these multiple connectives, and obtain numerous logics like: exponential-free line... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1093/jigpal/6.3.451 | Logic Journal of the IGPL |
Keywords | Field | DocType |
display logic,substructural logics,linear logic,relevant logic,BCK-logic,bi-Heyting logic,intuitionistic substructural tense logics,intuitionistic modal logics,proof theory,gaggle theory | Łukasiewicz logic,Accessibility relation,Substructural logic,Algorithm,Theoretical computer science,Bunched logic,Classical logic,Linear logic,Relevance logic,Mathematics,Intermediate logic | Journal |
Volume | Issue | ISSN |
6 | 3 | 1367-0751 |
Citations | PageRank | References |
45 | 2.38 | 31 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rajeev Gore | 1 | 56 | 4.06 |
| Automated Reasoning Project | 2 | 45 | 2.38 |