Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T23:39:25.698Z Has data issue: false hasContentIssue false

On the complexity of propositional quantification in intuitionistic logic

Published online by Cambridge University Press:  12 March 2014

Philip Kremer*
Affiliation:
Department of Philosophy, Yale University, P.O. Box 208306, New Haven, CT 06520-8306, USA, E-mail: philip.kremer@yale.edu

Abstract

We define a propositionally quantified intuitionistic logic Hπ+ by a natural extension of Kripke's semantics for propositional intuitionistic logic. We then show that Hπ+ is recursively isomorphic to full second order classical logic. Hπ+ is the intuitionistic analogue of the modal systems S5π+, S4π+, S4.2π+, K4π+, Tπ+, Kπ+ and Bπ+, studied by Fine.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable