Access the full text.
Sign up today, get DeepDyve free for 14 days.
Danko Ilik (2010)
Constructive Completeness Proofs and Delimited Control
J. Avigad (2006)
A Variant of the Double-Negation Translation
Nicholaos Galatos, P. Jipsen, T. Kowalski, H. Ono (2007)
Residuated lattices: An algebraic glimpse at sub-structural logics
A.S. Troelstra, H. Schwichtenberg (2000)
Basic Proof Theory, 2nd edn., Cambridge Tracts in Theoretical Computer Science, vol. 43
Nikolaos Galatos, H. Ono (2006)
Glivenko theorems for substructural logics over FLJournal of Symbolic Logic, 71
T. Umezawa (1959)
On some properties of intermediate logics, 35
T. Streicher, U. Kohlenbach (2007)
Shoenfield is Gödel after KrivineMathematical Logic Quarterly, 53
D. Gabbay, D. Skvortsov, V. Shehtman (2007)
Quantification in Nonclassical Logic (Studies in Logic and the Foundations of Mathematics)
Gilda Ferreira, Paulo Oliva (2011)
On Various Negative Translations
H. O (2010)
Logics without the contraction rule and residuated lattices
A. Troelstra, H. Schwichtenberg (1996)
Basic proof theory, 43
T. Umezawa (1959)
On logics intermediate between intuitionistic and classical predicate logicJournal of Symbolic Logic, 24
S. Kuroda (1951)
Intuitionistische Untersuchungen der formalistischen LogikNagoya Mathematical Journal, 2
H. Ono (2009)
Glivenko theorems revisitedAnn. Pure Appl. Log., 161
D. Gabbay (1972)
Applications of trees to intermediate logicsJournal of Symbolic Logic, 37
S. Kleene, M. Beeson (1952)
Introduction to Metamathematics
N. Galatos, P. Jipsen, T. Kowalski, H. Ono (2007)
Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Studies in Logic and the Foundations of Mathematics, vol. 151
Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFL e . It is shown that there exists the weakest logic over QFL e among substructural predicate logics for which the Glivenko theorem holds. Negative translations of substructural predicate logics are studied by using the same approach. First, a negative translation, called extended Kuroda translation is introduced. Then a translation result of an arbitrary involutive substructural predicate logics over QFL e is shown, and the existence of the weakest logic is proved among such logics for which the extended Kuroda translation works. They are obtained by a slight modification of the proof of the Glivenko theorem. Relations of our extended Kuroda translation with other standard negative translations will be discussed. Lastly, algebraic aspects of these results will be mentioned briefly. In this way, a clear and comprehensive understanding of Glivenko theorems and negative translations will be obtained from a substructural viewpoint.
Archive for Mathematical Logic – Springer Journals
Published: Jul 5, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.