Glivenko-type theorems for substructural logics (over FL) are comprehensively studied in the paper (GO06b). Arguments used there are fully algebraic, and based on the fact that all substructural logics are algebraizable (see (GO06a) and also (GJKO07) for the details). As a complementary work to the algebraic approach developed in (GO06b), we present here a concise, proof-theoretic approach to Glivenko theorems for substructural logics. This will show different features of these two approaches
We present a technique for higher-order representation of substructural logics such as linear or mod...
$\dot{\mathrm{W}}\mathrm{e} $ will introduce the notion of the glueing of algebras for substructural...
We present a technique for higher-order representation of substructural logics such as linear or mod...
It is well known that classical propositional logic can be interpreted in intuitionistic proposition...
Substructural logics extending the full Lambek calculus FL have largely benefited from a systematica...
The book is meant to serve two purposes. The first and more obvious one is to present state of the a...
Substructural logics extending the full Lambek calculus FL have largely benefited from a systematica...
AbstractWe carry out a unified investigation of two prominent topics in proof theory and order algeb...
This is an introductory survey of substructural logics and of residuated lattices which are algebrai...
We develop a general algebraic and proof-theoretic study of substructural logics that may lack assoc...
We give a simple proof-theoretic argument showing that Glivenko’s theorem for propositional logic an...
Spinks and Veroff have shown that constructive logic with strong negation (CLSN for short), can be c...
In this paper, we will develop an algebraic study of substructural propositional logics over FL_, i....
Many logics in the relevant family can be given a proof theory in the style of Belnap's display logi...
Substructural logics have received a lot of attention in recent years from the communities of both l...
We present a technique for higher-order representation of substructural logics such as linear or mod...
$\dot{\mathrm{W}}\mathrm{e} $ will introduce the notion of the glueing of algebras for substructural...
We present a technique for higher-order representation of substructural logics such as linear or mod...
It is well known that classical propositional logic can be interpreted in intuitionistic proposition...
Substructural logics extending the full Lambek calculus FL have largely benefited from a systematica...
The book is meant to serve two purposes. The first and more obvious one is to present state of the a...
Substructural logics extending the full Lambek calculus FL have largely benefited from a systematica...
AbstractWe carry out a unified investigation of two prominent topics in proof theory and order algeb...
This is an introductory survey of substructural logics and of residuated lattices which are algebrai...
We develop a general algebraic and proof-theoretic study of substructural logics that may lack assoc...
We give a simple proof-theoretic argument showing that Glivenko’s theorem for propositional logic an...
Spinks and Veroff have shown that constructive logic with strong negation (CLSN for short), can be c...
In this paper, we will develop an algebraic study of substructural propositional logics over FL_, i....
Many logics in the relevant family can be given a proof theory in the style of Belnap's display logi...
Substructural logics have received a lot of attention in recent years from the communities of both l...
We present a technique for higher-order representation of substructural logics such as linear or mod...
$\dot{\mathrm{W}}\mathrm{e} $ will introduce the notion of the glueing of algebras for substructural...
We present a technique for higher-order representation of substructural logics such as linear or mod...