Residuated lattices and twist-products Manuela Busaniche based on a - - PowerPoint PPT Presentation

residuated lattices and twist products
SMART_READER_LITE
LIVE PREVIEW

Residuated lattices and twist-products Manuela Busaniche based on a - - PowerPoint PPT Presentation

Residuated lattices and twist-products Manuela Busaniche based on a joint work with R. Cignoli Instituto de Matem atica Aplicada del Litoral Santa Fe, Argentina Syntax Meets Semantics 2016 Barcelona, 9th September Manuela Busaniche


slide-1
SLIDE 1

Residuated lattices and twist-products

Manuela Busaniche based on a joint work with R. Cignoli

Instituto de Matem´ atica Aplicada del Litoral Santa Fe, Argentina

Syntax Meets Semantics 2016 Barcelona, 9th September

Manuela Busaniche Residuated lattices and twist-products

slide-2
SLIDE 2

Twist-structures

  • J. Kalman, Lattices with involution, Trans. Amer. Math.
  • Soc. 87 (1958), 485–491.
  • M. Kracht, On extensions of intermediate logics by strong

negation, J. Philos. Log. 27 (1998), 49–73.

Manuela Busaniche Residuated lattices and twist-products

slide-3
SLIDE 3

Given a lattice L = L, ∨, ∧ the twist constructions are obtained by considering Ltwist = L × L, ⊔, ⊓, ∼ with the operations ⊔, ⊓ given by (a, b) ⊔ (c, d) = (a ∨ c, b ∧ d) (1) (a, b) ⊓ (c, d) = (a ∧ c, b ∨ d) (2) ∼ (a, b) = (b, a) (3)

Manuela Busaniche Residuated lattices and twist-products

slide-4
SLIDE 4

The operation ∼ satisfies:

1

∼∼ x = x

2

∼ (x ⊓ y) =∼ x⊔ ∼ y

3

∼ (x ⊔ y) =∼ x⊓ ∼ y

Manuela Busaniche Residuated lattices and twist-products

slide-5
SLIDE 5

When the lattice L has some additional operations, the construction Ltwist can also be endowed with some additional

  • perations.

Manuela Busaniche Residuated lattices and twist-products

slide-6
SLIDE 6

This construction has been used to represent some well-known algebras: Nelson algebras Fidel, Vakarelov, Sendlewski,Cignoli, . . . Involutive residuated lattices Tsinakis, Wille Galatos, Raftery, . . . N4-lattices Odintsov Bilattices Ginsberg, Fitting, Avron, Rivieccio, . . .

Manuela Busaniche Residuated lattices and twist-products

slide-7
SLIDE 7

This construction has been used to represent some well-known algebras: Nelson algebras Fidel, Vakarelov, Sendlewski,Cignoli, . . . Involutive residuated lattices Tsinakis, Wille Galatos, Raftery, . . . N4-lattices Odintsov Bilattices Ginsberg, Fitting, Avron, Rivieccio, . . .

Manuela Busaniche Residuated lattices and twist-products

slide-8
SLIDE 8

This construction has been used to represent some well-known algebras: Nelson algebras Fidel, Vakarelov, Sendlewski,Cignoli, . . . Involutive residuated lattices Tsinakis, Wille Galatos, Raftery, . . . N4-lattices Odintsov Bilattices Ginsberg, Fitting, Avron, Rivieccio, . . .

Manuela Busaniche Residuated lattices and twist-products

slide-9
SLIDE 9

This construction has been used to represent some well-known algebras: Nelson algebras Fidel, Vakarelov, Sendlewski,Cignoli, . . . Involutive residuated lattices Tsinakis, Wille Galatos, Raftery, . . . N4-lattices Odintsov Bilattices Ginsberg, Fitting, Avron, Rivieccio, . . .

Manuela Busaniche Residuated lattices and twist-products

slide-10
SLIDE 10

This construction has been used to represent some well-known algebras: Nelson algebras Fidel, Vakarelov, Sendlewski,Cignoli, . . . Involutive residuated lattices Tsinakis, Wille Galatos, Raftery, . . . N4-lattices Odintsov Bilattices Ginsberg, Fitting, Avron, Rivieccio, . . .

Manuela Busaniche Residuated lattices and twist-products

slide-11
SLIDE 11

We will deal with commutative residuated lattices, i.e, structures of the form L = L, ∨, ∧, ·, →, e such that

Manuela Busaniche Residuated lattices and twist-products

slide-12
SLIDE 12

We will deal with commutative residuated lattices, i.e, structures of the form L = L, ∨, ∧, ·, →, e such that L, ·, e is a commutative monoid; L, ∨, ∧ is a lattice; (·, →) is a residuated pair: x ≤ y → z iff x · y ≤ z.

Manuela Busaniche Residuated lattices and twist-products

slide-13
SLIDE 13

An involution on L is a unary operation ∼ satisfying the equations ∼∼ x = x and x →∼ y = y →∼ x.

Manuela Busaniche Residuated lattices and twist-products

slide-14
SLIDE 14

An involution on L is a unary operation ∼ satisfying the equations ∼∼ x = x and x →∼ y = y →∼ x. If f :=∼ e, then ∼ x = x → f and f satisfies the equation (x → f) → f = x. (4) The element f is called a dualizing element.

Manuela Busaniche Residuated lattices and twist-products

slide-15
SLIDE 15

Conversely, if f ∈ L is a dualizing element and we define ∼ x = x → f for all x ∈ L, then ∼ is an involution on L and ∼ e = f.

Manuela Busaniche Residuated lattices and twist-products

slide-16
SLIDE 16

Conversely, if f ∈ L is a dualizing element and we define ∼ x = x → f for all x ∈ L, then ∼ is an involution on L and ∼ e = f. Therefore involutive residuated lattices are of the form: L = L, ∨, ∧, ·, →, e, ∼ L = L, ∨, ∧, ·, →, e, f.

Manuela Busaniche Residuated lattices and twist-products

slide-17
SLIDE 17

Conversely, if f ∈ L is a dualizing element and we define ∼ x = x → f for all x ∈ L, then ∼ is an involution on L and ∼ e = f. Therefore involutive residuated lattices are of the form: L = L, ∨, ∧, ·, →, e, ∼ L = L, ∨, ∧, ·, →, e, f. We will deal with L = L, ∨, ∧, ·, →, e with e a dualizing element or equivalent ∼ x = x → e an involution.

Manuela Busaniche Residuated lattices and twist-products

slide-18
SLIDE 18

e-lattices.

By an e-lattice we mean a commutative residuated lattice A which satisfies the equation: (x → e) → e = x. (5)

Manuela Busaniche Residuated lattices and twist-products

slide-19
SLIDE 19

e-lattices.

By an e-lattice we mean a commutative residuated lattice A which satisfies the equation: (x → e) → e = x. (5) The involution ∼ given by the prescription ∼ x = x → e for all x ∈ A, satisfies the following properties: M1 ∼∼ x = x, M2 ∼ (x ∨ y) = ∼ x∧ ∼ y, M3 ∼ (x ∧ y) = ∼ x∨ ∼ y, M4 ∼ (x · y) = x → ∼ y, M5 ∼ e = e.

Manuela Busaniche Residuated lattices and twist-products

slide-20
SLIDE 20

Lattice-ordered abelian groups with x · y = x + y, x → y = y − x and e = 0 are examples of e-lattices.

Manuela Busaniche Residuated lattices and twist-products

slide-21
SLIDE 21

Let L = L, ∨, ∧, ·, →, e be an integral commutative residuated lattice.

Manuela Busaniche Residuated lattices and twist-products

slide-22
SLIDE 22

Let L = L, ∨, ∧, ·, →, e be an integral commutative residuated lattice. K(L) = L × L, ⊔, ⊓, ·K(L), →K(L), (e, e) with the operations ⊔, ⊓, ·, → given by (a, b) ⊔ (c, d) = (a ∨ c, b ∧ d) (6) (a, b) ⊓ (c, d) = (a ∧ c, b ∨ d) (7) (a, b) ·K(L) (c, d) = (a · c, (a → d) ∧ (c → b)) (8) (a, b) →K(L) (c, d) = ((a → c) ∧ (d → b), a · d) (9)

Manuela Busaniche Residuated lattices and twist-products

slide-23
SLIDE 23

The involution in pairs is given by ∼ (a, b) = (a, b) →K(L) (e, e) = (b, a). (10)

Manuela Busaniche Residuated lattices and twist-products

slide-24
SLIDE 24

The involution in pairs is given by ∼ (a, b) = (a, b) →K(L) (e, e) = (b, a). (10) K(L) is an e-lattice.

Manuela Busaniche Residuated lattices and twist-products

slide-25
SLIDE 25

Definition We call K(L) the full twist-product obtained from L, and every subalgebra A of K(L) containing the set {(a, e) : a ∈ L} is called twist-product obtained from L.

Manuela Busaniche Residuated lattices and twist-products

slide-26
SLIDE 26

Recall that given a commutative residuated lattice A = (A, ∨, ∧, ·, →, e) its negative cone is given by A− = {x ∈ A : x ≤ e} and if we define x →e y = (x → y) ∧ e then A−, ∨, ∧, ·, →e, e is an integral commutative residuated lattice.

Manuela Busaniche Residuated lattices and twist-products

slide-27
SLIDE 27

Recall that given a commutative residuated lattice A = (A, ∨, ∧, ·, →, e) its negative cone is given by A− = {x ∈ A : x ≤ e} and if we define x →e y = (x → y) ∧ e then A−, ∨, ∧, ·, →e, e is an integral commutative residuated lattice. We aim to characterize the e-lattices that can be represented as twist-products obtained from their negative cones; i.e.,

Manuela Busaniche Residuated lattices and twist-products

slide-28
SLIDE 28

If A is an e-lattice.... when does it happen that A is isomorphic to a subalgebra of K(A−)?

Manuela Busaniche Residuated lattices and twist-products

slide-29
SLIDE 29

Definition We say that a commutative residuated lattice L = (L, ∨, ∧, ·, →, e) satisfies distributivity at e if the distributive laws x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z) (11) x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z) (12) hold whenever any of x, y, z is replaced by e.

Manuela Busaniche Residuated lattices and twist-products

slide-30
SLIDE 30

Example: L is distributive at e, then it satisfies e ∨ (y ∧ z) = (e ∨ y) ∧ (e ∨ z) (13) x ∧ (e ∨ z) = (x ∧ e) ∨ (x ∧ z) (14)

Manuela Busaniche Residuated lattices and twist-products

slide-31
SLIDE 31

A K-lattice is an e-lattice satisfying distributivity at e and (x · y) ∧ e = (x ∧ e) · (y ∧ e) (15) ((x ∧ e) → y) ∧ ((∼ y ∧ e) →∼ x) = x → y, (16)

Manuela Busaniche Residuated lattices and twist-products

slide-32
SLIDE 32

For every integral commutative residuated lattice L the twist-products K(L) are K-lattices.

Manuela Busaniche Residuated lattices and twist-products

slide-33
SLIDE 33

It follows from the definition that K-lattices form a variety that we denote by K.

Manuela Busaniche Residuated lattices and twist-products

slide-34
SLIDE 34

It follows from the definition that K-lattices form a variety that we denote by K. Lattice-ordered abelian groups are e-lattices that are not K-lattices.

Manuela Busaniche Residuated lattices and twist-products

slide-35
SLIDE 35

It is well known and easy to verify that distributivity at e implies the quasiequation: x ∧ e = y ∧ e and x ∨ e = y ∨ e imply x = y. (17) This is equivalent to: if x ∧ e = y ∧ e and ∼ x ∧ e = ∼ y ∧ e, then x = y. (18)

Manuela Busaniche Residuated lattices and twist-products

slide-36
SLIDE 36

Theorem Let A be a K-lattice. The map φA : A → K(A−) given by x → (x ∧ e, ∼ x ∧ e) is an injective homomorphism.

Manuela Busaniche Residuated lattices and twist-products

slide-37
SLIDE 37

φA is a homomorphism. The preservation of the lattice operations relies on ∼ (x ∨ y) = ∼ x∧ ∼ y and distributivity at e. For x, y ∈ A φA(x ∧ y) = ((x ∧ y) ∧ e, ∼ (x ∧ y) ∧ e) = ((x ∧ e) ∧ (y ∧ e), (∼ x∨ ∼ y) ∧ e) = ((x ∧ e) ∧ (y ∧ e), (∼ x ∧ e) ∨ (∼ y ∧ e)) = (x ∧ e, ∼ x ∧ e) ⊓ (y ∧ e, ∼ y ∧ e) = φA(x) ⊓ φA(y). With similar ideas one can prove that φA preserves the supremum.

Manuela Busaniche Residuated lattices and twist-products

slide-38
SLIDE 38

Observe that φA(∼ x) = (∼ x∧e, ∼∼ x∧e) = (∼ x∧e, x∧e) =∼ (x∧e, ∼ x∧e). Due to ∼ (x · y) = x → ∼ y, it is only left to check that φA preserves ·.

Manuela Busaniche Residuated lattices and twist-products

slide-39
SLIDE 39

Notice that φA(x · y) = ((x · y) ∧ e, ∼ (x · y) ∧ e), that can be rewritten as ((x ∧ e) · (y ∧ e), (x →∼ y) ∧ e). (19)

Manuela Busaniche Residuated lattices and twist-products

slide-40
SLIDE 40

Notice that φA(x · y) = ((x · y) ∧ e, ∼ (x · y) ∧ e), that can be rewritten as ((x ∧ e) · (y ∧ e), (x →∼ y) ∧ e). (19) On the other hand, φA(x) · φA(y) = ((x ∧e)·(y ∧e), ((x ∧e) →e (∼ y ∧e))∧((y ∧e) →e (∼ x ∧e))). (20)

Manuela Busaniche Residuated lattices and twist-products

slide-41
SLIDE 41

Notice that φA(x · y) = ((x · y) ∧ e, ∼ (x · y) ∧ e), that can be rewritten as ((x ∧ e) · (y ∧ e), (x →∼ y) ∧ e). (19) On the other hand, φA(x) · φA(y) = ((x ∧e)·(y ∧e), ((x ∧e) →e (∼ y ∧e))∧((y ∧e) →e (∼ x ∧e))). (20) To see that φA(x · y) = φA(x) · φA(y) it remains to prove that the second components coincide.

Manuela Busaniche Residuated lattices and twist-products

slide-42
SLIDE 42

We have ((x ∧ e) →e (∼ y ∧ e)) ∧ ((y ∧ e) →e (∼ x ∧ e)) = ((x ∧ e) → (∼ y ∧ e)) ∧ ((y ∧ e) → (∼ x ∧ e)) ∧ e = ((x ∧ e) → (∼ y)) ∧ e ∧ ((y ∧ e) → (∼ x)) = (x →∼ y) ∧ e.

Manuela Busaniche Residuated lattices and twist-products

slide-43
SLIDE 43

We have ((x ∧ e) →e (∼ y ∧ e)) ∧ ((y ∧ e) →e (∼ x ∧ e)) = ((x ∧ e) → (∼ y ∧ e)) ∧ ((y ∧ e) → (∼ x ∧ e)) ∧ e = ((x ∧ e) → (∼ y)) ∧ e ∧ ((y ∧ e) → (∼ x)) = (x →∼ y) ∧ e. Finally, the injectivity of φA follows at once from x ∧ e = y ∧ e and ∼ x ∧ e = ∼ y ∧ e imply x = y.

Manuela Busaniche Residuated lattices and twist-products

slide-44
SLIDE 44

So φA : A → K(A−) given by x → (x ∧ e, ∼ x ∧ e) is an injective homomorphism.

Manuela Busaniche Residuated lattices and twist-products

slide-45
SLIDE 45

So φA : A → K(A−) given by x → (x ∧ e, ∼ x ∧ e) is an injective homomorphism. Since for each a ∈ A−, φA(a) = (a, e), it follows that by restriction, φA defines an isomorphism from A− → φA(A)− .

Manuela Busaniche Residuated lattices and twist-products

slide-46
SLIDE 46

Theorem Every K-lattice A is isomorphic to a twist-product obtained from its negative cone.

Manuela Busaniche Residuated lattices and twist-products

slide-47
SLIDE 47

Categories

The application L → K(L) and f → (f, f) from ICRL → K-lattices defines a functor.

Manuela Busaniche Residuated lattices and twist-products

slide-48
SLIDE 48

The application A → A− and f → f ↾A− from K-lattices → ICRL is also a functor which is left adjoint to the first.

Manuela Busaniche Residuated lattices and twist-products

slide-49
SLIDE 49

Categories

Let T be the full subcategory of K-lattices whose objects are the total K-lattices, i.e., A ∼ = K(A−)

Manuela Busaniche Residuated lattices and twist-products

slide-50
SLIDE 50

Categories

Let T be the full subcategory of K-lattices whose objects are the total K-lattices, i.e., A ∼ = K(A−) then Theorem The categories of integral commutative residuated lattices and T are equivalent categories.

Manuela Busaniche Residuated lattices and twist-products

slide-51
SLIDE 51

Given a K-lattice A isomorphic to a subalgebra of K(A−), how can we use information of the negative cone A− to deduce some properties of A?

Manuela Busaniche Residuated lattices and twist-products

slide-52
SLIDE 52

Congruences

A first general result (not only for K-lattices) is that The lattices Cong(A) and Cong(A−) are isomorphic.

Manuela Busaniche Residuated lattices and twist-products

slide-53
SLIDE 53

Translating equations

A K-lattice satisfies a lattice identity τ if and only if its negative cone satisfies τ and τ d. In particular, a K-lattice is distributive if and only if its negative cone is distributive.

Manuela Busaniche Residuated lattices and twist-products

slide-54
SLIDE 54

Representable K-lattices

A residuated lattice is representable if it is a subdirect product

  • f linearly ordered residuated lattices. Given a subvariety

V ⊆ CRL, the representable residuated lattices in V form a subvariety of V characterized by the equations e ∧ (x ∨ y) = (e ∧ x) ∨ (e ∧ y) (21) and e ∧ ((x → y) ∨ (y → x)) = e. (22)

Manuela Busaniche Residuated lattices and twist-products

slide-55
SLIDE 55

Representable K-lattices

We introduce the following K-lattices:

B

1

Manuela Busaniche Residuated lattices and twist-products

slide-56
SLIDE 56

Representable K-lattices

We introduce the following K-lattices:

B

1

K(B)

(1, 1) (0, 0) (0, 1) (1, 0)

Manuela Busaniche Residuated lattices and twist-products

slide-57
SLIDE 57

Representable K-lattices

We introduce the following K-lattices:

B

1

K(B)

(1, 1) (0, 0) (0, 1) (1, 0)

Manuela Busaniche Residuated lattices and twist-products

slide-58
SLIDE 58

P3

(1, 1) (0, 1) (1, 0)

Manuela Busaniche Residuated lattices and twist-products

slide-59
SLIDE 59

1

Every three-element K-lattice is isomorphic to P3.

2

P3 is the only nontrivial K-lattice in which every element is comparable with e.

3

The K-lattice P3 is the only nontrivial totally ordered K-lattice.

Manuela Busaniche Residuated lattices and twist-products

slide-60
SLIDE 60

Twist-products

For each integral commutative residuated lattice L we have a family of twist-products KL = {S ⊆ K(L) : for all x ∈ L, (x, e) ∈ S}.

Manuela Busaniche Residuated lattices and twist-products

slide-61
SLIDE 61

Twist-products

For each integral commutative residuated lattice L we have a family of twist-products KL = {S ⊆ K(L) : for all x ∈ L, (x, e) ∈ S}. We aim to classify these twist-products.

Manuela Busaniche Residuated lattices and twist-products

slide-62
SLIDE 62
  • S. P

. Odintsov, Algebraic semantics for paraconsistent Nelson’s logic, J. Log. Comput. 13 (2003), 453–468.

  • S. P

. Odintsov, On the representation of N4-lattices, Stud.

  • Log. 76 (2004), 385–405.
  • S. P

. Odintsov, Constructive Negations and Paraconsistency, Trends in Logic–Studia Logica Library

  • 26. Springer. Dordrecht (2008)

Manuela Busaniche Residuated lattices and twist-products

slide-63
SLIDE 63

K(L) subalgebra of K(L) : K(L)− ∼ = L subalgebra of K(L) : K(L)− ∼ = L subalgebra of K(L) : K(L)− ∼ = L L

Manuela Busaniche Residuated lattices and twist-products

slide-64
SLIDE 64

(L, F1) − → K(L) (L, F2) − → subalgebra of K(L) : K(L)− ∼ = L (L, F3) − → subalgebra of K(L) : K(L)− ∼ = L . . . . . . (L, Fn) − → subalgebra of K(L) : K(L)− ∼ = L

Manuela Busaniche Residuated lattices and twist-products

slide-65
SLIDE 65

The finite MV-chain L3 given by L3 =

  • 0, 1

2, 1

  • with the operations given by

x · y = max{0, x + y − 1} x → y = min{1, 1 − x + y}.

Manuela Busaniche Residuated lattices and twist-products

slide-66
SLIDE 66

The finite MV-chain L3 given by L3 =

  • 0, 1

2, 1

  • with the operations given by

x · y = max{0, x + y − 1} x → y = min{1, 1 − x + y}. Recall that ¬x = x → 0. One can always define x ⊕ y = ¬(¬x · ¬y) which is x ⊕ y = min(0, x + y).

Manuela Busaniche Residuated lattices and twist-products

slide-67
SLIDE 67

(1, 1/2) (1/2, 0) (1/2, 1/2) (1, 1) (0, 0) (1/2, 1) (0, 1/2) (1, 0) (0, 1)

Manuela Busaniche Residuated lattices and twist-products

slide-68
SLIDE 68

(1, 1/2) (1/2, 0) (1/2, 1/2) (1, 1) (0, 0) (1/2, 1) (0, 1/2) (1, 0) (0, 1)

Manuela Busaniche Residuated lattices and twist-products

slide-69
SLIDE 69

(1, 1/2) (1/2, 0) (1/2, 1/2) (1, 1) (0, 0) (1/2, 1) (0, 1/2) (1, 0) (0, 1)

Manuela Busaniche Residuated lattices and twist-products

slide-70
SLIDE 70

KL3.

S0 = K(L3) S1 = {(x, y) ∈ L3 × L3 : x ⊕ y = 1} S 1

2 = {(x, y) ∈ L3 × L3 : x ⊕ y ≥ 1

2}.

Manuela Busaniche Residuated lattices and twist-products

slide-71
SLIDE 71

KL3.

S0 = K(L3) = {(x, y) ∈ L3 × L3 : x ⊕ y ≥ 0} S1 = {(x, y) ∈ L3 × L3 : x ⊕ y = 1} S 1

2 = {(x, y) ∈ L3 × L3 : x ⊕ y ≥ 1

2}.

Manuela Busaniche Residuated lattices and twist-products

slide-72
SLIDE 72

KL3.

S0 = K(L3) = {(x, y) ∈ L3 × L3 : x ⊕ y ≥ 0} S1 = {(x, y) ∈ L3 × L3 : x ⊕ y = 1} S 1

2 = {(x, y) ∈ L3 × L3 : x ⊕ y ≥ 1

2}. If we consider the three lattice filters of L3 F1 = {1}, F 1

2 = {1, 1

2}, F0 = {1, 1 2, 0}

Manuela Busaniche Residuated lattices and twist-products

slide-73
SLIDE 73

KL3.

S0 = K = {(x, y) : x ⊕ y ∈ F0} S1 = {(x, y) : x ⊕ y ∈ F1} S 1

2 = {(x, y) : x ⊕ y ∈ F 1 2 }.

If we consider the three lattice filters of L3 F1 = {1}, F 1

2 = {1, 1

2}, F0 = {1, 1 2, 0}

Manuela Busaniche Residuated lattices and twist-products

slide-74
SLIDE 74

KL3.

S0 = K = {(x, y) : ¬x → ¬¬y ∈ F0} S1 = {(x, y) : ¬x → ¬¬y ∈ F1} S 1

2 = {(x, y) : ¬x → ¬¬y ∈ F 1 2 }.

If we consider the three lattice filters of L3 F1 = {1}, F 1

2 = {1, 1

2}, F0 = {1, 1 2, 0}

Manuela Busaniche Residuated lattices and twist-products

slide-75
SLIDE 75

By an integral bounded commutative residuated lattice we mean an algebra B = B, ∨, ∧, ·, →, e, 0 such that B, ∨, ∧, ·, →, e is an integral commutative residuated lattice and 0 is the lower bound of the lattice structure.

Manuela Busaniche Residuated lattices and twist-products

slide-76
SLIDE 76

By an integral bounded commutative residuated lattice we mean an algebra B = B, ∨, ∧, ·, →, e, 0 such that B, ∨, ∧, ·, →, e is an integral commutative residuated lattice and 0 is the lower bound of the lattice structure. Given an integral bounded commutative residuated lattice B we can define a negation on B as ¬x = x → 0.

Manuela Busaniche Residuated lattices and twist-products

slide-77
SLIDE 77

By a Glivenko residuated lattice we mean an integral bounded commutative residuated lattice satisfying any of the equivalent conditions: ¬¬(¬¬ x → x) = e. ¬¬(x → y) = x → ¬¬y.

Manuela Busaniche Residuated lattices and twist-products

slide-78
SLIDE 78

Examples of Glivenko residuated lattices

Integral involutive residuated lattices are trivially Glivenko. Heyting algebras are Glivenko. Integral bounded commutative residuated lattices that satisfy the hoop equation x ∧ y = x · (x → y) are Glivenko.

Manuela Busaniche Residuated lattices and twist-products

slide-79
SLIDE 79

Let B be a Glivenko residuated lattice: there is a bijective correspondence between regular lattice filters of B → admissible subalgebras of K(B) given by F → {(x, y) ∈ K(B) : ¬x → ¬¬y ∈ F} whose inverse map is given by S → {x ∈ B : (0, x) ∈ S}.

Manuela Busaniche Residuated lattices and twist-products

slide-80
SLIDE 80

Conclusions

1

We have characterized the subvariety of e-lattices that can be represented by twist-products: K-lattices.

Manuela Busaniche Residuated lattices and twist-products

slide-81
SLIDE 81

Conclusions

1

We have characterized the subvariety of e-lattices that can be represented by twist-products: K-lattices.

2

We have studied representable K-lattices.

Manuela Busaniche Residuated lattices and twist-products

slide-82
SLIDE 82

Conclusions

1

We have characterized the subvariety of e-lattices that can be represented by twist-products: K-lattices.

2

We have studied representable K-lattices.

3

We have established a bijective correspondence among pairs of Glivenko residuated lattices and regular lattices filters and twist-products: (L, F) → (S ⊆ K(L)).

Manuela Busaniche Residuated lattices and twist-products

slide-83
SLIDE 83

Open problems

We believe that the key to understand K-lattices is the study of twist-products obtained from an arbitrary commutative integral residuated lattice L. This is equivalent to the investigation of admissible subalgebras of K(L).

1

Characterize admissible subalgebras of the full twist-product K(B) for B an arbitrary bounded integral commutative residuated lattice.

2

Characterize admissible subalgebras of the full twist-product K(L) for L an arbitrary integral commutative residuated lattice.

Manuela Busaniche Residuated lattices and twist-products

slide-84
SLIDE 84

Thank you!

Manuela Busaniche Residuated lattices and twist-products

slide-85
SLIDE 85

Busaniche, M., Cignoli, R.: Constructive logic with strong negation as a substructural logic. J. Log. Comput. 20, 761-793 (2010). Busaniche, M., Cignoli, R.: Residuated lattices as an algebraic semantics for paraconsistent Nelson logic. J. Log.

  • Comput. 19, 1019-1029 (2009).

Busaniche, M., Cignoli, R.: Remarks on an algebraic semantics for paraconsistent Nelson’s logic. Manuscrito, Center of Logic, Epistemology and the History of Science 34, 99-114 (2011). Busaniche, M., Cignoli, R.: Commutative residuated lattices represented by twist-products, Algebra Universalis 71, 5-22 (2014).

Manuela Busaniche Residuated lattices and twist-products