3 search results - page 1 / 1 » Glivenko theorems for substructural logics over FL |
JSYML
2006
13 years 4 months ago
2006
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
APAL
2010
13 years 5 months ago
2010
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...