Name
Abstract | ||
|---|---|---|
We prove that the set of formulae provable in the full Lambek calculus with the structural rule of contraction is undecidable. In fact, we show that the positive fragment of this logic is undecidable. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1017/jsl.2015.18 | JOURNAL OF SYMBOLIC LOGIC |
Keywords | Field | DocType |
substructural logic,full Lambek calculus,contraction rule,square-increasing residuated lattice,equational theory,decidability | Algebra,Structural rule,Algorithm,Substructural logic,Decidability,Noncommutative logic,Mathematics,Calculus,Equational theory,Undecidable problem | Journal |
Volume | Issue | ISSN |
81 | 2 | 0022-4812 |
Citations | PageRank | References |
2 | 0.52 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karel Chvalovský | 1 | 11 | 1.85 |
| Rostislav Horcík | 2 | 50 | 6.41 |