Classical propositional logic and decidability of variables in intuitionistic propositional logic

DOI10.2168/LMCS-10(3:1)2014zbMATH Open1337.03017arXiv1405.0091MaRDI QIDQ2878747FDOQ2878747

Hajime Ishihara

Publication date: 5 September 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1405.0091

zbMATH Keywords

classical propositional logicintuitionistic propositional logicdecidability of variables

Mathematics Subject Classification ID

Classical propositional logic (03B05) Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25)

Cited In (8)

• Embedding classical in minimal implicational logic
• IMPROVING STRONG NEGATION
• The decidability of dependency in intuitionistic propositional logic
• Decidable variables for constructive logics
• A note on decidability of variables in intuitionistic propositional logic
• The Jacobson radical for an inconsistency predicate
• THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY
• Individual concepts as propositional variables in \(ML^{\nu +1}\)

Uses Software

• Pesca

This page was built for publication: Classical propositional logic and decidability of variables in intuitionistic propositional logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878747)