Jump to ContentJump to Main Navigation
Interpolation and Definability$
Users without a subscription are not able to see the full content.
Interpolation and Definability: Modal and Intuitionistic Logics

Dov M. Gabbay and Larisa Maksimova

Print publication date: 2005

Print ISBN-13: 9780198511748

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198511748.001.0001

COMPLEXITY OF SOME PROBLEMS IN MODAL AND INTUITIONISTIC CALCULI

Chapter:
(p. 265 ) 9 COMPLEXITY OF SOME PROBLEMS IN MODAL AND INTUITIONISTIC CALCULI
Source:
Interpolation and Definability
Author(s):

D.M. Gabbay

L. Maksimova

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198511748.003.0009

This chapter investigates the problem of recognizing properties of logical calculi. Complexity bounds for interpolation and some other problems over Int and S4 are found. It is proved that the tabularity problems over both Int and S4 are NP-complete, and the interpolation problems over both Int and Grz are PSPACE-complete, both CIP and IPD problems over S4 are in coNEXP and PSPACE-hard. Complexity bounds for pre-tabularity and local tabularity, and for amalgamation properties in varieties are also found.

Keywords:   NP-complete, PSPACE-complete, PSPACE-hard, modal calculus

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .