[Back]

S. Bova:
"Generalized Basic Logic, Polynomial Space, and Disjunction Property";
Talk: Workshop in Memoriam Franco Montagna, Siena, Italien (invited); 2015-12-16.

We report on research by Montagna and collaborators on the combinatorial and computational aspects of generalized basic logic. In the first part of the talk, we focus on the PSPACE-completeness of the tautology and entailment problems. In the second part of the talk, we discuss a syntactic relaxation of the disjunction property leading to an uncountable family of substructural logics with a PSPACE-hard tautology problem (it is known that substructural logics enjoying the full disjunction property have a PSPACE-hard tautology problem).