Computer Science Logic and 8th Kurt Gödel Colloquium Larisa Maksimova and Andrei Voronkov: Complexity of Some Problems in Modal and Intuitionistic Calculi

Welcome and News Host Institutions Calls and Deadlines Program Social Program Registration Location and Venue Accommodation Committees Contact Colocated Events Authors' instructions

Print this page We consider the complexity of recognizing some properties of intuitionistic and modal logics. We prove results on the complexity of tabularity, pre-tabularity, and interpolation in superintuitionistic logics and normal extensions of S4, as well as the complexity of amalgamation problems in varieties of Heyting and closure algebras. © 2002-2003 Kurt Gödel Society, Norbert Preining. 2003-06-04