Substructural Logics and FL-algebras: Albert Yoo

Substructural Logics FL-algebras
Substructural Logics and FL-algebras
Albert Yoo
January 28, 2021

What is meant by ”Substructural”?
They are a family of logics lacking one or more structural rules


Exchange (commutativity)

Contraction (square-increasing)

Weakening (minimality of 0 and integrality)

Structural rules constitute sequent system of classical

(intuitionistic) logic together with cut rule and rules for logical
connectives

Structural rules constitute sequent system of classical

(intuitionistic) logic together with cut rule and rules for logical
connectives
Examples of such logics includes fuzzy logics, linear logic, and

relevant logic
Sequent System
Here I will introduce (Gentzen style) sequent system as the

meaning of the “rules” is more clear in such systems than in
Hilbert style axiomatic system
Sequent System

A sequent is an expression of a form:
α1 , · · · , αm ⇒ β
which can be interpreted as ”β follows from α1 , · · · , αm ”

Sequent System

A sequent is an expression of a form:
α1 , · · · , αm ⇒ β
which can be interpreted as ”β follows from α1 , · · · , αm ”
A sequent system consists of initial sequents (axioms) and rules

determining correct sequents in the system
Substructural Rules
Γ, α, β, ∆ ⇒ ϕ
Exchange rule:
Γ, β, α, ∆ ⇒ ϕ
Substructural Rules
Γ, α, β, ∆ ⇒ ϕ
Exchange rule:
Γ, β, α, ∆ ⇒ ϕ
Γ, α, α, ∆ ⇒ ϕ
Contraction rule:
Γ, α, ∆ ⇒ ϕ
Substructural Rules
Γ, α, β, ∆ ⇒ ϕ
Exchange rule:
Γ, β, α, ∆ ⇒ ϕ
Γ, α, α, ∆ ⇒ ϕ
Contraction rule:
Γ, α, ∆ ⇒ ϕ
Γ, ∆ ⇒ ϕ
Left weakening rule:
Γ, α, ∆ ⇒ ϕ
Substructural Rules
Γ, α, β, ∆ ⇒ ϕ
Exchange rule:
Γ, β, α, ∆ ⇒ ϕ
Γ, α, α, ∆ ⇒ ϕ
Contraction rule:
Γ, α, ∆ ⇒ ϕ
Γ, ∆ ⇒ ϕ
Γ, α, ∆ ⇒ ϕ
Right weakening rule: Γ⇒
Γ⇒ϕ
Substructural Rules
Γ, α, β, ∆ ⇒ ϕ
Exchange rule:
Γ, β, α, ∆ ⇒ ϕ
Γ, α, α, ∆ ⇒ ϕ
Contraction rule:
Γ, α, ∆ ⇒ ϕ
Γ, ∆ ⇒ ϕ
Γ, α, ∆ ⇒ ϕ
Right weakening rule: Γ⇒
Γ⇒ϕ
These rules are about commas in sequents

Implications
Classical rules for implication:

Γ⇒α β, ∆ ⇒ ϕ α, ∆ ⇒ β
(→⇒) (⇒→)
Γ, α → β, ∆ ⇒ ϕ Γ⇒α→β
Implications

Γ⇒α β, ∆ ⇒ ϕ α, ∆ ⇒ β
(→⇒) (⇒→)
Γ, α → β, ∆ ⇒ ϕ Γ⇒α→β
However, we need two kinds of ”implication” when we lack the

exchange rule
Implications

Γ⇒α β, ∆ ⇒ ϕ α, ∆ ⇒ β
(→⇒) (⇒→)
Γ, α → β, ∆ ⇒ ϕ Γ⇒α→β
However, we need two kinds of ”implication” when we lack the

exchange rule
Rules for left and right residuation:

Γ⇒α ∆, β, Σ ⇒ θ α, Γ ⇒ β
(\ ⇒) (⇒ \)
∆, Γ, α\β, Σ ⇒ θ Γ ⇒ α\β
Γ⇒α ∆, β, Σ ⇒ θ Γ, α ⇒ β
(/ ⇒) (⇒ /)
∆, β/α, Γ, Σ ⇒ θ Γ ⇒ β/α
Negations
The negation ¬α means that assuming α leads to contradiction

and thus it can be defined as
¬α = α → 0
Negations
The negation ¬α means that assuming α leads to contradiction

and thus it can be defined as
¬α = α → 0
Without exchange rule, we also need two kinds of negation
∼ α = α\0
and
−α = 0/α
Lambek Calculus
Lambek calculus was proposed as a formalism of natural language

syntax motivated by the principle of compositionality
Lambek Calculus

It lacks all three structural rules and thus works as the prototypical
substructural logic to be extended to other members of the family
by adding more rules
Lambek Calculus

As it is more like a ”grammar” than a logic, it is natural to

understand implications in lambek calculus as analogous to
function types in lambda calculus
Lambek Calculus

As it is more like a ”grammar” than a logic, it is natural to

understand implications in lambek calculus as analogous to
function types in lambda calculus
B/A is the type of phrases results in a phrase of type B when

followed by a phrase of type A, and A\B is the type of phrases
results in a phrase of type B when preceded by a phrase of type A
Other Examples
Other logics belonging to this family is linear logic which lacks (or
has only limited use of) weakening and contraction rules
Other Examples
The lack of contraction rule makes assumptions to be ”consumed”

(as it can only be used at most once) which is the reason linear
logic is often interpreted as a model of resource (rather than of
truth) in areas including programming language semantics and
quantum information
Other Examples

quantum information
Relevant logic is another example of substructural logic which

lacks weakening rule
Other Examples

quantum information
Relevant logic is another example of substructural logic which

lacks weakening rule
Without weakening rule, assumptions have to be used at least once

and this mandates any assumption to be relevant to the conclusion
Partially Ordered Monoids
A partially ordered monoid is a structure hL; ·, 1; ≤i such that


hL; ≤i is a poset

hL; ≤i is a poset
hL; ·, 1i is a monoid such that
x ≤ y ⇒ xz ≤ yz ∧ zx ≤ zy

hL; ≤i is a poset
hL; ·, 1i is a monoid such that
x ≤ y ⇒ xz ≤ yz ∧ zx ≤ zy
A partially order monoid is residuated if operators \ and / such

that
xy ≤ z ⇔ x ≤ z/y ⇔ y ≤ x\z
can be defined
Residuated Lattices
When hL; ≤i forms a lattice, the algebra hL; ∧, ∨, ·, 1, \, /i is called

a residuated lattice
Residuated Lattices

If a residuated lattice is commutative, residuation can be defined

as x → y = x\y = x/y and negation as ¬x =∼ x = −x
Residuated Lattices

If a residuated lattice is commutative, residuation can be defined

as x → y = x\y = x/y and negation as ¬x =∼ x = −x
An FL-algebra is a residuated lattice with an additional constant 0

and two negations can be defined as ∼ x = x\0 and −x = 0/x
FL-algebras
FL-algebras are the Lindenbaum-Tarski algebras of FL

(intuitionistic logic minus all three substructural rules) and the
class of all FL-algebras forms a variety FL
FL-algebras

For any substructural logic there exist a subvariety of FL of which

constituting algebras are Lindenbaum-Tarski algebras of such logic
(we will see some examples in the next slide)
FL-algebras


FLew -algebra is a bounded integral commutative FL-algebra with

0 as the minimal and 1 as the maxiaml element, i.e. 0 ≤ x ≤ 1
FL-algebras


FLew -algebra is a bounded integral commutative FL-algebra with

0 as the minimal and 1 as the maxiaml element, i.e. 0 ≤ x ≤ 1
As can be reasonably inferred from its name, boundedness and

integrality corresponds to the regaining of weakening and
commutativity to exchange
MTL-, BL-, and MV-algebras
Prelinearity: (x → y ) ∨ (y → x) = 1
MTL-algebra = FLew -algebra + prelinearity
Divisibility: x ∧ y = x · (x → y )
BL-algebra = MTL-algebra + divisibility
Double negation: ¬¬x = x

MV-algebra = BL-algebra + double negation
Double negation: ¬¬x = x

MV-algebra = BL-algebra + double negation
MTL-, BL-, and MV-algebras are Lindenbaum-Tarski algebras of

monoidal t-norm based logic, (Hájek’s) basic fuzzy logic, and
infinite-valued Lukasiewicz logic, respectively
References
Petr Hájek (1998)

Metamathematics of Fuzzy Logic
Springer
Hiroakira Ono (2003)

Substructural logics and residuated lattices — an introduction
Trends in Logic 20: 177–212
Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski, Hiroakira Ono (2007)

Residuated lattices: an algebraic glimpse at substructural logics
Elsevier
Petr Hájek, Petr Cintula, Carles Noguera (2011)
Handbook of Mathematical Fuzzy Logic
College Publications
The End

Substructural Logics and FL-algebras: Albert Yoo

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Substructural Logics and FL-algebras: Albert Yoo

Uploaded by

Copyright:

Available Formats

Substructural Logics FL-algebras

Substructural Logics and FL-algebras

January 28, 2021

What is meant by ”Substructural”?

They are a family of logics lacking one or more structural rules

What is meant by ”Substructural”?

They are a family of logics lacking one or more structural rules

What is meant by ”Substructural”?

They are a family of logics lacking one or more structural rules

What is meant by ”Substructural”?

They are a family of logics lacking one or more structural rules

What is meant by ”Substructural”?

They are a family of logics lacking one or more structural rules

Structural rules constitute sequent system of classical

What is meant by ”Substructural”?

They are a family of logics lacking one or more structural rules

Structural rules constitute sequent system of classical

Examples of such logics includes fuzzy logics, linear logic, and

Here I will introduce (Gentzen style) sequent system as the

Here I will introduce (Gentzen style) sequent system as the

A sequent is an expression of a form:

which can be interpreted as ”β follows from α1 , · · · , αm ”

Here I will introduce (Gentzen style) sequent system as the

A sequent is an expression of a form:

which can be interpreted as ”β follows from α1 , · · · , αm ”

A sequent system consists of initial sequents (axioms) and rules

These rules are about commas in sequents

Classical rules for implication:

Classical rules for implication:

However, we need two kinds of ”implication” when we lack the

Classical rules for implication:

However, we need two kinds of ”implication” when we lack the

Rules for left and right residuation:

The negation ¬α means that assuming α leads to contradiction

The negation ¬α means that assuming α leads to contradiction

Without exchange rule, we also need two kinds of negation

Lambek calculus was proposed as a formalism of natural language

Lambek calculus was proposed as a formalism of natural language

Lambek calculus was proposed as a formalism of natural language

As it is more like a ”grammar” than a logic, it is natural to

Lambek calculus was proposed as a formalism of natural language

As it is more like a ”grammar” than a logic, it is natural to

B/A is the type of phrases results in a phrase of type B when

The lack of contraction rule makes assumptions to be ”consumed”

The lack of contraction rule makes assumptions to be ”consumed”

Relevant logic is another example of substructural logic which

The lack of contraction rule makes assumptions to be ”consumed”

Relevant logic is another example of substructural logic which

Without weakening rule, assumptions have to be used at least once

Partially Ordered Monoids

A partially ordered monoid is a structure hL; ·, 1; ≤i such that

Partially Ordered Monoids

A partially ordered monoid is a structure hL; ·, 1; ≤i such that

Partially Ordered Monoids

A partially ordered monoid is a structure hL; ·, 1; ≤i such that

Partially Ordered Monoids

A partially ordered monoid is a structure hL; ·, 1; ≤i such that

A partially order monoid is residuated if operators \ and / such

When hL; ≤i forms a lattice, the algebra hL; ∧, ∨, ·, 1, \, /i is called

When hL; ≤i forms a lattice, the algebra hL; ∧, ∨, ·, 1, \, /i is called

If a residuated lattice is commutative, residuation can be defined

When hL; ≤i forms a lattice, the algebra hL; ∧, ∨, ·, 1, \, /i is called