Intuitionistic Frege systems are polynomially equivalent
- 1 May 2006
- journal article
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 134 (5) , 2392-2402
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate LogicsLecture Notes in Computer Science, 2002
- On the computational content of intuitionistic propositional proofsAnnals of Pure and Applied Logic, 2001
- On the admissible rules of intuitionistic propositional logicThe Journal of Symbolic Logic, 2001
- The complexity of the disjunction and existential properties in intuitionistic logicAnnals of Pure and Applied Logic, 1999
- Unification in intuitionistic logicThe Journal of Symbolic Logic, 1999
- Constructivist Approaches to Logic1981
- The relative efficiency of propositional proof systemsThe Journal of Symbolic Logic, 1979
- One hundred and two problems in mathematical logicThe Journal of Symbolic Logic, 1975
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systemsThe Journal of Symbolic Logic, 1960
- Eine Unableitbarkeitsbeweismethode für den Intuitionistischen AussagenkalkülArchive for Mathematical Logic, 1957