TY - JOUR
T1 - Displaying and deciding substructural logics 1
T2 - Logics with contraposition
AU - Restall, Greg
PY - 1998
Y1 - 1998
N2 - Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap, 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.
AB - Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap, 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.
UR - http://www.scopus.com/inward/record.url?scp=54649083970&partnerID=8YFLogxK
U2 - 10.1023/A:1017998605966
DO - 10.1023/A:1017998605966
M3 - Article
AN - SCOPUS:54649083970
SN - 0022-3611
VL - 27
SP - 179
EP - 216
JO - Journal of Philosophical Logic
JF - Journal of Philosophical Logic
IS - 2
ER -