Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T17:54:46.181Z Has data issue: false hasContentIssue false

Glivenko theorems for substructural logics over FL

Published online by Cambridge University Press:  12 March 2014

Nikolaos Galatos
Affiliation:
Japan Advanced Institute of Science and Technology School, of Information Science, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan, E-mail: galatos@jaist.ac.jp
Hiroakira Ono
Affiliation:
Japan Advanced Institute of Science and Technology School, of Information Science, 1-1 Asahidai, Nomi, Ishikawa, 923-1292, Japan, E-mail: ono@jaist.ac.jp

Abstract

It is well known that classical propositional logic can be interpreted in intuitionistic prepositional logic. In particular Glivenko's theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko's theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via a double negation interpretation. Our presentation is algebraic and is formulated in the context of residuated lattices. In the last part of the paper, we also discuss some extended forms of the Koltnogorov translation and we compare it to the Glivenko translation.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable