“Displaying and Deciding Substructural Logics 1: Logics with Contraposition,” Journal of Philosophical Logic, 27 (1998) 179-216.

 download pdf

Many logics in the relevant family can be given a proof theory in the style of Belnap’s display logic. 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.


Do you like this, or do you have a comment? Then please  share or reply on Twitter, or  email me.


← Linear Arithmetic Desecsed | Writing Archive | Negation in Relevant Logics: How I stopped worrying and learned to love the Routley Star →

about

I’m Greg Restall, and this is my personal website. ¶ From August 2021, I will be the Shelby Cullom Davis Professor of Philosophy at the University of St Andrews.

elsewhere

subscribe

To receive updates from this site, you can subscribe to the  RSS feed of all updates to the site in an RSS feed reader, or follow me on Twitter at  @consequently, where I’ll update you if anything is posted.

search