Publication details

Saarland University Computer Science

Glivenko and Kuroda for Simple Type Theory

Chad E. Brown, Christine Rizkallah

The Journal of Symbolic Logic 79(2):485-495, June 2014

Glivenko’s theorem states that an arbitrary propositional formula is classically provable if and only if its double negation is intuitionistically provable. The result does not extend to full first-order predicate logic, but does extend to first-order predicate logic without the universal quantifier. A recent paper by Zdanowski shows that Glivenko’s theorem also holds for second-order propositional logic without the universal quantifier. We prove that Glivenko’s theorem extends to some versions of simple type theory without the universal quantifier. Moreover, we prove that Kuroda’s negative translation, which is known to embed classical first-order logic into intuitionistic first-order logic, extends to the same versions of simple type theory. We also prove that the Glivenko property fails for simple type theory once a weak form of functional extensionality is included.

Available here.

Show BibTeX               


Login to edit


Webmaster, Wed Sep 16 10:47:00 2009