Residuated Lattices: An Algebraic Glimpse at Substructural Logics

2007 ◽  
Keyword(s):  
Substructural Logics ◽  
Residuated Lattices

scholarly journals Glivenko theorems for substructural logics over FL

2006 ◽  
Vol 71 (4) ◽  
pp. 1353-1384 ◽  
Author(s):  
Nikolaos Galatos ◽  
Hiroakira Ono
Keyword(s):  
Propositional Logic ◽  
Substructural Logics ◽  
Residuated Lattices ◽  
Substructural Logic ◽  
Classical Propositional Logic ◽  
Double Negation ◽  
Glivenko’S Theorem

AbstractIt 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.

scholarly journals NONASSOCIATIVE SUBSTRUCTURAL LOGICS AND THEIR SEMILINEAR EXTENSIONS: AXIOMATIZATION AND COMPLETENESS PROPERTIES

2013 ◽  
Vol 6 (3) ◽  
pp. 394-423 ◽  
Author(s):  
PETR CINTULA ◽  
ROSTISLAV HORČÍK ◽  
CARLES NOGUERA
Keyword(s):  
Algebraic Approach ◽  
Substructural Logics ◽  
Unit Interval ◽  
Residuated Lattices ◽  
Lambek Calculus ◽  
Deduction Theorem ◽  
The Real ◽  
Special Stress ◽  
Ordered Algebras

AbstractSubstructural logics extending the full Lambek calculus FL have largely benefited from a systematical algebraic approach based on the study of their algebraic counterparts: residuated lattices. Recently, a nonassociative generalization of FL (which we call SL) has been studied by Galatos and Ono as the logic of lattice-ordered residuated unital groupoids. This paper is based on an alternative Hilbert-style presentation for SL which is almost MP-based. This presentation is then used to obtain, in a uniform way applicable to most (both associative and nonassociative) substructural logics, a form of local deduction theorem, description of filter generation, and proper forms of generalized disjunctions. A special stress is put on semilinear substructural logics (i.e., logics complete with respect to linearly ordered algebras). Axiomatizations of the weakest semilinear logic over SL and other prominent substructural logics are provided and their completeness with respect to chains defined over the real unit interval is proved.

scholarly journals Proof theory for lattice-ordered groups

10.29007/3szk ◽  
2018 ◽  
Author(s):  
George Metcalfe
Keyword(s):  
Proof Theory ◽  
Family Resemblance ◽  
Substructural Logics ◽  
Residuated Lattices ◽  
Cut Elimination ◽  
Theoretic Approach ◽  
Gentzen Systems ◽  
Ordered Groups ◽  
Lattice Ordered Groups ◽  
Mv Algebras

Proof theory can provide useful tools for tackling problems in algebra. In particular, Gentzen systems admitting cut-eliminationhave been used to establish decidability, complexity, amalgamation, admissibility, and generation results for varieties of residuated lattices corresponding to substructural logics. However, for classes of algebras bearing some family resemblance to groups, such as lattice-ordered groups, MV-algebras, BL-algebras, and cancellative residuated lattices, the proof-theoretic approach has met so far only with limited success.The main aim of this talk will be to introduce proof-theoretic methods for the class of lattice-ordered groups and to explain how these methods can be used to obtain new syntactic proofs of two core theorems: namely, Holland's result that this class is generated as a variety by the lattice-ordered group of order-preserving automorphisms of the real numbers, and the decidability of the word problem for free lattice-ordered groups.

Substructural fuzzy logics

2007 ◽  
Vol 72 (3) ◽  
pp. 834-864 ◽  
Author(s):  
George Metcalfe ◽  
Franco Montagna
Keyword(s):  
Linear Logic ◽  
Substructural Logics ◽  
Unit Interval ◽  
Residuated Lattices ◽  
Cut Elimination ◽  
Algebraic Semantics ◽  
Fuzzy Logics ◽  
The Real ◽  
Gentzen Systems ◽  
Intuitionistic Linear Logic

AbstractSubstructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Uninorm logic UL as Multiplicative additive intuitionistic linear logic MAILL extended with the prelinearity axiom ((A → B) ∧ t) V ((B → A)∧ t). Axiomatic extensions of UL include known fuzzy logics such as Monoidal t-norm logic MIX and Gödel logic G, and new weakening-free logics. Algebraic semantics for these logics are provided by subvarieties of (representable) pointed bounded commutative residuated lattices. Gentzen systems admitting cut-elimination are given in the framework of hypersequents. Completeness with respect to algebras with lattice reduct [0, 1] is established for UL and several extensions using a two-part strategy. First, completeness is proved for the logic extended with Takeuti and Titani's density rule. A syntactic elimination of the rule is then given using a hypersequent calculus. As an algebraic corollary, it follows that certain varieties of residuated lattices are generated by their members with lattice reduct [0, 1].

The Failure of The Amalgamation Property for Semilinear Varieties of Residuated Lattices

2015 ◽  
Vol 65 (4) ◽  
Author(s):  
José Gil-Férez ◽  
Antonio Ledda ◽  
Constantine Tsinakis
Keyword(s):  
Representation Theory ◽  
Distributive Lattice ◽  
Amalgamation Property ◽  
Substructural Logics ◽  
Residuated Lattices

AbstractThe amalgamation property (AP) is of particular interest in the study of residuated lattices due to its relationship with various syntactic interpolation properties of substructural logics. There are no examples to date of non-commutative varieties of residuated lattices that satisfy the AP. The variety SemRL of semilinear residuated lattices is a natural candidate for enjoying this property, since most varieties that have a manageable representation theory and satisfy the AP are semilinear. However, we prove that this is not the case, and in the process we establish that the same is true for the variety SemCanRL of semilinear cancellative residuated lattices. In addition, we prove that the variety whose members have a distributive lattice reduct and satisfy the identity x(y ∧ z)w ≈ xyw ∧ xzw also fails the AP.

scholarly journals Residuated Structures and Orthomodular Lattices

Studia Logica ◽  
2021 ◽  
Author(s):  
D. Fazio ◽  
A. Ledda ◽  
F. Paoli
Keyword(s):  
Algebraic Logic ◽  
Residuated Lattices ◽  
Quantum Structures ◽  
Heyting Algebras ◽  
Quantum Algebras ◽  
Orthomodular Lattices ◽  
Lattice Of Subvarieties ◽  
Residuated Structures ◽  
Common Framework ◽  
Mv Algebras

AbstractThe variety of (pointed) residuated lattices includes a vast proportion of the classes of algebras that are relevant for algebraic logic, e.g., $$\ell $$ ℓ -groups, Heyting algebras, MV-algebras, or De Morgan monoids. Among the outliers, one counts orthomodular lattices and other varieties of quantum algebras. We suggest a common framework—pointed left-residuated $$\ell $$ ℓ -groupoids—where residuated structures and quantum structures can all be accommodated. We investigate the lattice of subvarieties of pointed left-residuated $$\ell $$ ℓ -groupoids, their ideals, and develop a theory of left nuclei. Finally, we extend some parts of the theory of join-completions of residuated $$\ell $$ ℓ -groupoids to the left-residuated case, giving a new proof of MacLaren’s theorem for orthomodular lattices.

Sign in / Sign up

Export Citation Format

Share Document