On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics
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.
Unable to display preview. Download preview PDF.
- 1.A. Avellone, M. Ferrari, and C. Fiorentini. A formal framework for synthesis and verification of logic programs. In K.-K. Lau, editor, Logic Based Program Synthesis and Transformation, 10th International Workshop, LOPSTR 2000, Selected Papers, volume 2042 of Lecture Notes in Computer Science, pages 1–17. Springer-Verlag, 2001.Google Scholar
- 5.M. Ferrari and C. Fiorentini. A proof-theoretical analysis of semiconstructive intermediate theories. Studia Logica, to appear.Google Scholar
- 6.M. Ferrari, C. Fiorentini, and P. Miglioli. Goal oriented information extraction in uniformly constructive calculi. In Argentinian Workshop on Theoretical Computer Science (WAIT’99), pages 51–63. Sociedad Argentina de Informática e Investigación Operativa, 1999.Google Scholar
- 7.M. Ferrari, P. Miglioli, and M. Ornaghi. On uniformly constructive and semicon-structive formal systems. Logic Journal of the IGPL, to appear.Google Scholar
- 12.P. Miglioli, U. Moscato, and M. Ornaghi. Constructive theories with abstract data types for program synthesis. In D.G. Skordev, editor, Mathematical Logic and its Applications, pages 293–302. Plenum Press, New York, 1987.Google Scholar
- 15.C.A. Smorynski. Applications of Kripke semantics. In A.S. Troelstra, editor, Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics, pages 324–391. Springer-Verlag, 1973.Google Scholar
- 16.A.S. Troelstra, editor. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis, volume 344 of Lecture Notes in Mathematics. Springer-Verlag, 1973.Google Scholar
- 17.A.S. Troelstra and H. Schwichtenberg. Basic Proof Theory, volume 43 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1996.Google Scholar