On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics

Authors:
Mauro Ferrari;Camillo Fiorentini;Guido Fiorino
Affiliations:
-;-;-
Venue:
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2002

Citing 2
Cited 0

Abstract parametric classes and abstract data types defined by classical and constructive logical methods

Journal of Symbolic Computation
Basic proof theory

Basic proof theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we provide a uniform framework, based on extraction calculi, where to study the complexity of the problem to decide the disjunction and the explicit definability properties for Intuitionistic Logic and some Superintuitionistic Logics. Unlike the previous approaches, our framework is independent of structural properties of the proof systems and it can be applied to Natural Deduction systems, Hilbert style systems and Gentzen sequent systems.