Computational properties of non-classical logics
AILo talk, University of Groningen, The Netherlands
This talk is a brief introduction to the investigation of computational properties of non-classical propositional logics. We begin by understanding the very basics of non-classical logics, focusing on many-valued and substructural logics. Then, we see what it means for a logic to be decidable or not, and appreciate some of the challenges in studying such property. For some decidable logics, we also see some complexity results, touching in an accessible way topics like structural proof theory and the theory of well-quasi-orderings.