A note on decidability of variables in intuitionistic propositional logic

Mathematical Logic Quarterly 64 (3):183-184 (2018)
  Copy   BIBTEX

Abstract

An answer to the following question is presented: given a proof in classical propositional logic, for what small set of propositional variables p does it suffice to add all the formulae to Γ in order to intuitionistically prove A? This answer is an improvement of Ishihara's result for some cases.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.201700004

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Hypersequent calculi for intuitionistic logic with classical atoms.Hidenori Kurokawa - 2010 - Annals of Pure and Applied Logic 161 (3):427-446.
Intuitionistic Predicate Logic with Decidable Propositional Formulas.Alexander Sakharov - 2007 - Reports on Mathematical Logic.
Decidability of quantified propositional intuitionistic logic and s4 on trees of height and arity ≤ω.Richard Zach - 2004 - Journal of Philosophical Logic 33 (2):155-164.
The Lambek Calculus Extended with Intuitionistic Propositional Logic.Michael Kaminski & Nissim Francez - 2016 - Studia Logica 104 (5):1051-1082.
Bi-Simulating in Bi-Intuitionistic Logic.Guillermo Badia - 2016 - Studia Logica 104 (5):1037-1050.
The Decidability of Dependency in Intuitionistic Propositional Logi.Dick De Jongh & L. A. Chagrova - 1995 - Journal of Symbolic Logic 60 (2):498 - 504.
A probabilistic extension of intuitionistic logic.Z. Ognjanovic & Z. Markovic - 2003 - Mathematical Logic Quarterly 49 (4):415.
Decidability in Intuitionistic Type Theory is Functionally Decidable.Silvio Valentini - 1996 - Mathematical Logic Quarterly 42 (1):300-304.
On the computational content of intuitionistic propositional proofs.Samuel R. Buss & Pavel Pudlák - 2001 - Annals of Pure and Applied Logic 109 (1-2):49-64.
A modal calculus analogous to k4w, based on intuitionistic propositional logic, iℴ.Aldo Ursini - 1979 - Studia Logica 38 (3):297 - 311.
The decidability of dependency in intuitionistic propositional Logi.Dick de Jongh & L. A. Chagrova - 1995 - Journal of Symbolic Logic 60 (2):498-504.
On the complexity of propositional quantification in intuitionistic logic.Philip Kremer - 1997 - Journal of Symbolic Logic 62 (2):529-544.
On second order intuitionistic propositional logic without a universal quantifier.Konrad Zdanowski - 2009 - Journal of Symbolic Logic 74 (1):157-167.
Intuitionistic Completeness and Classical Logic.D. C. McCarty - 2002 - Notre Dame Journal of Formal Logic 43 (4):243-248.
A Bounded Translation of Intuitionistic Propositional Logic into Basic Propositional Logic.Mojtaba Aghaei & Mohammad Ardeshir - 2000 - Mathematical Logic Quarterly 46 (2):195-206.

Analytics

Added to PP
2018-07-06

Downloads
16 (#880,136)

6 months
4 (#818,853)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Decidable variables for constructive logics.Satoru Niki - 2020 - Mathematical Logic Quarterly 66 (4):484-493.

Add more citations

References found in this work

Add more references