2014Logical Methods in Computer ScienceOpen access

Classical propositional logic and decidability of variables in intuitionistic propositional logic

Hajime Ishihara

Open full text 8 citations

Abstract

We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.

Open-access reader

About this research paper

What this paper is about

We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.

Key concepts: Propositional variable, Well-formed formula, Zeroth-order logic, Autoepistemic logic, Intermediate logic, Intuitionistic logic, Decidability, Propositional calculus

Related papers

Back to paper searchBrowse research topicsOriginal source
Classical propositional logic and decidability of variables in intuitionistic propositional logic — Research Paper | ScholarLens