Complexity of some problems in positive and related calculi

Authors:
L. Maksimova
Affiliations:
Institute of Mathematics, Siberian Division of Russian Academy of Sciences, 630090 Novosibirsk, Russia
Venue:
Theoretical Computer Science - Logic and complexity in computer science
Year:
2003

Citing 2
Cited 1

A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence

Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents

International Journal of Intelligent Information Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A problem of recognizing important properties of propositional calculi is considered, and complexity bounds for some decidable properties are found. For a given logical system L, a property P of logical calculi is called decidable over L if there is an algorithm which for any finite set Ax of new axiom schemes decides whether the calculus L + Ax has the property P or not. In Maksimova and Voronkov (Bull Symbol. Logic 6 (2000) 118) the complexity of tabularity, pretabularity, and interpolation problems over the intuitionistic logic (Int) and over modal logic S4 was studied.In the present paper, positive and positively axiomatizable calculi are investigated. We prove NP-completeness of tabularity, DP-hardness of pretabularity and PSPACE-completeness of interpolation and projective Beth's property over the positive fragment Int+ of the intuitionistic logic. Some complexity bounds for properties of propositional calculi over the intuitionistic or the minimal logic are found.