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.
On the complexity of disjunction and explicit definability properties in some intermediate logics / M. Ferrari, C. Fiorentini, G. Fiorino - In: Logic for programming, artificial intelligence, and reasoning : 9th international conference, LPAR 2002 : Tbilisi, Georgia, october 14-18, 2002 : proceedings / [a cura di] M. Baaz, A. Voronkov. - Berlin : Springer, 2002. - ISBN 9783540000105. - pp. 175-190 (( Intervento presentato al 9. convegno International Conference on Logic for Programming, Artificial Intelligence, and Reasoning tenutosi a Tbilisi, Georgia nel 2002 [10.1007/3-540-36078-6_12].
On the complexity of disjunction and explicit definability properties in some intermediate logics
C. Fiorentini;
2002
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
2002_lpar.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
216.23 kB
Formato
Adobe PDF
|
216.23 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
