On the complexity of propositional quantification in intuitionistic logic
On the complexity of propositional quantification in intuitionistic logic
复制标题
论直觉逻辑中命题量化的复杂性
DOI：
10.2307/2275545
复制
发表时间：
1997
影响因子：
0.6
通讯作者：
Philip Kremer
中科院分区：
文献类型：
--
作者：
Philip Kremer
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.
