Glivenko like theorems in natural expansions of BCK-logic

Mathematical Logic Quarterly 50 (2):111-125 (2004)
  Copy   BIBTEX


The classical Glivenko theorem asserts that a propositional formula admits a classical proof if and only if its double negation admits an intuitionistic proof. By a natural expansion of the BCK-logic with negation we understand an algebraizable logic whose language is an expansion of the language of BCK-logic with negation by a family of connectives implicitly defined by equations and compatible with BCK-congruences. Many of the logics in the current literature are natural expansions of BCK-logic with negation. The validity of the analogous of Glivenko theorem in these logics is equivalent to the validity of a simple one-variable formula in the language of BCK-logic with negation.



    Upload a copy of this work     Papers currently archived: 79,857

External links

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

Through your library

Similar books and articles

Glivenko Theorems for Substructural Logics over FL.Nikolaos Galatos & Hiroakira Ono - 2006 - Journal of Symbolic Logic 71 (4):1353 - 1384.
Glivenko theorems revisited.Hiroakira Ono - 2010 - Annals of Pure and Applied Logic 161 (2):246-250.
Boolean Algebras in Visser Algebras.Majid Alizadeh, Mohammad Ardeshir & Wim Ruitenburg - 2016 - Notre Dame Journal of Formal Logic 57 (1):141-150.
A Binary-conclusion Natural Deduction System.K. Fujita - 1999 - Logic Journal of the IGPL 7 (4):517-545.
On the proof theory of the intermediate logic MH.Jonathan P. Seldin - 1986 - Journal of Symbolic Logic 51 (3):626-647.
Nearly every normal modal logic is paranormal.Joao Marcos - 2005 - Logique Et Analyse 48 (189-192):279-300.
A proof-search procedure for intuitionistic propositional logic.R. Alonderis - 2013 - Archive for Mathematical Logic 52 (7-8):759-778.


Added to PP

16 (#687,030)

6 months
1 (#479,585)

Historical graph of downloads
How can I increase my downloads?