# A Comparison of Implications in  Orthomodular Quantum Logic—Morphological Analysis of Quantum Logic

Authors: Mitsuhiko Fujio
Journal: International Journal of Mathematics and Mathematical Sciences
 (2012)

---

## Abstract

Morphological operators are generalized to lattices as adjunction pairs (Serra, 1984; Ronse, 1990; Heijmans and Ronse, 1990; Heijmans, 1994). In particular, morphology for set lattices is applied to analyze logics through Kripke semantics (Bloch, 2002; Fujio and Bloch, 2004; Fujio, 2006). For example, a pair of morphological operators as an adjunction gives rise to a temporalization of normal modal logic (Fujio and Bloch, 2004; Fujio, 2006). Also, constructions of models for intuitionistic logic or linear logics can be described in terms of morphological interior and/or closure operators (Fujio and Bloch, 2004). This shows that morphological analysis can be applied to various non-classical logics. On the other hand, quantum logics are algebraically formalized as orhomodular or modular ortho-complemented lattices (Birkhoff and von Neumann, 1936; Maeda, 1980; Chiara and Giuntini, 2002), and shown to allow Kripke semantics (Chiara and Giuntini, 2002). This suggests the possibility of morphological analysis for quantum logics. In this article, to show an efficiency of morphological analysis for quantum logic, we consider the implication problem in quantum logics (Chiara and Giuntini, 2002). We will give a comparison of the 5 polynomial implication connectives available in quantum logics.


---

## Body

## 1. Mathematical Morphology

Mathematical morphology is a method of non-linear signal processing using simple set-theoretic operations, which has the feasibility of extracting the characteristic properties of shapes [1, 2]. In this paper we will adopt the formulation thereof generalized on lattices [3–7].We identify a binary relationR⊆X×A and the correspondence from X to A. Namely, R(x)={a∈A∣(x,a)∈R} for x∈X. We call the relation R with X and A exchanged, the transpose of R and denote it by Rt.


### 1.1. Dilation and Erosion

LetX, A be partially ordered sets. If for any family {xλ}⊆X of X which has a supremum ⋁λxλ in X, the image {f(xλ)}⊆A has the supremum ⋁λf(xλ) in A and f(⋁λxλ)=⋁λf(xλ) holds, then we call the mapping f:X→A a dilation from X to A. Similarly, by changing supremum by infimum, we may introduce an erosion. We call dilation and erosion morphological operations. For two elements x≤y of X, we have x∨y=y, x∧y=x, the morphological operations are monotone.Example 1.1 (morphology of set lattices [7]).
Given setsX and A, consider the lattices of their power sets 𝒳=2X, 𝒜=2A. Let R be a binary relation in X×A. Then the mappings DR:𝒜→𝒳 and ER:𝒜→𝒳 defined by
(1.1)DR(B)={x∈X∣R(x)∩B≠∅},ER(B)={x∈X∣R(x)⊆B}
are a dilation and an erosion, respectively.
From the transposeRt we may similarly define the dilation and erosion DRt:𝒳→𝒜, ERt:𝒳→𝒜.The importance of this example lies in the fact that all morphological operations between set lattices are expressed in this form, whence it follows that giving a framework of morphological operations and a binary relationR are equivalent. In particular, in the Kripke semantics, accessibility relationships being binary operations between possible worlds, we contend that giving the Kripke framework amounts to giving morphological operations.


### 1.2. Adjunctions

Suppose two mappingsf:X→A and g:A→X between partially ordered sets satisfy the condition
(1.2)f(x)≤a⟺x≤g(a)
for any x∈X, a∈A. Then the mapping pair (f,g) is called an adjunction and is written as f⊣g and f is called the lower adjoint of g, with g is the upper adjoint of f. Notice that every adjoint is uniquely determined if exists.Proposition 1.2.
For two monotone mappingsf:X→A and g:A→X between partially ordered sets to satisfy f⊣g, it is necessary and sufficient that for any x∈X, a∈A, the relation
(1.3)f(g(a))≤a,x≤g(f(x))
holds.Relations between morphological operations and adjunctions are given by the following.Proposition 1.3.
LetX, A be partially ordered sets and f:X→A, g:A→X. (1)
Iff has the upper adjoint, then it is a dilation. Conversely, if A is a complete upper semilattice, then a dilation has the upper adjoint.(2)
Ifg has the lower adjoint, then it is an erosion. Conversely, if X is a complete lower semilattice, then a dilation has the lower adjoint.Example 1.4 (adjunctions of set lattices [7]).
In Example1.1, we have DR⊣ERt and DRt⊣ER. Note that in each adjunction pair, dilation and erosion, R and Rt are to be interchanged.


### 1.3. Interior and Closure Operators

An idempotent monotone mappingf:X→X on a partially ordered set X is called a filter mapping. A filter mapping with extensibility (x≤f(x)) is called a closure operator and one with antiextensibility (f(x)≤x) is called an interior operator.Proposition 1.5.
LetX, A be partially ordered sets and f:X→A, g:A→X and f⊣g. Then g∘f:X→X is a closure operator of X and f∘g:A→A is an interior operator of A.Example 1.6 (closing and opening).
The closure operatorER∘DRt and the interior operator DR∘ERt on 𝒳 which are induced by the adjunctions in Example 1.4 are called closing and opening by R, respectively. Similarly, we may define the closing and opening by Rt as operators on 𝒜.In any complete lattice, closure operators are characterized by the notion of Moore family [8], where a Moore family is a subset M of a partially ordered set X which satisfies the following condition. For any subset S⊆M, if S has the infimum ⋀S in X, then ⋀S∈M holds true.Proposition 1.7 (see [7, 8]).
LetX be a partially ordered set. (1)
For any closure operatorφ:X→X, the totality of all φ-closed sets 𝔉φ={x∈X∣φ(x)=x} forms a Moore family.(2)
IfX is a complete lattice, then for any Moore family M⊆X, there exists a unique closure operator on X such that M=𝔉φ holds.We may establish similar properties of interior operators by appealing to the duality of a Moore family [7].


## 1.1. Dilation and Erosion

LetX, A be partially ordered sets. If for any family {xλ}⊆X of X which has a supremum ⋁λxλ in X, the image {f(xλ)}⊆A has the supremum ⋁λf(xλ) in A and f(⋁λxλ)=⋁λf(xλ) holds, then we call the mapping f:X→A a dilation from X to A. Similarly, by changing supremum by infimum, we may introduce an erosion. We call dilation and erosion morphological operations. For two elements x≤y of X, we have x∨y=y, x∧y=x, the morphological operations are monotone.Example 1.1 (morphology of set lattices [7]).
Given setsX and A, consider the lattices of their power sets 𝒳=2X, 𝒜=2A. Let R be a binary relation in X×A. Then the mappings DR:𝒜→𝒳 and ER:𝒜→𝒳 defined by
(1.1)DR(B)={x∈X∣R(x)∩B≠∅},ER(B)={x∈X∣R(x)⊆B}
are a dilation and an erosion, respectively.
From the transposeRt we may similarly define the dilation and erosion DRt:𝒳→𝒜, ERt:𝒳→𝒜.The importance of this example lies in the fact that all morphological operations between set lattices are expressed in this form, whence it follows that giving a framework of morphological operations and a binary relationR are equivalent. In particular, in the Kripke semantics, accessibility relationships being binary operations between possible worlds, we contend that giving the Kripke framework amounts to giving morphological operations.


## 1.2. Adjunctions

Suppose two mappingsf:X→A and g:A→X between partially ordered sets satisfy the condition
(1.2)f(x)≤a⟺x≤g(a)
for any x∈X, a∈A. Then the mapping pair (f,g) is called an adjunction and is written as f⊣g and f is called the lower adjoint of g, with g is the upper adjoint of f. Notice that every adjoint is uniquely determined if exists.Proposition 1.2.
For two monotone mappingsf:X→A and g:A→X between partially ordered sets to satisfy f⊣g, it is necessary and sufficient that for any x∈X, a∈A, the relation
(1.3)f(g(a))≤a,x≤g(f(x))
holds.Relations between morphological operations and adjunctions are given by the following.Proposition 1.3.
LetX, A be partially ordered sets and f:X→A, g:A→X. (1)
Iff has the upper adjoint, then it is a dilation. Conversely, if A is a complete upper semilattice, then a dilation has the upper adjoint.(2)
Ifg has the lower adjoint, then it is an erosion. Conversely, if X is a complete lower semilattice, then a dilation has the lower adjoint.Example 1.4 (adjunctions of set lattices [7]).
In Example1.1, we have DR⊣ERt and DRt⊣ER. Note that in each adjunction pair, dilation and erosion, R and Rt are to be interchanged.


## 1.3. Interior and Closure Operators

An idempotent monotone mappingf:X→X on a partially ordered set X is called a filter mapping. A filter mapping with extensibility (x≤f(x)) is called a closure operator and one with antiextensibility (f(x)≤x) is called an interior operator.Proposition 1.5.
LetX, A be partially ordered sets and f:X→A, g:A→X and f⊣g. Then g∘f:X→X is a closure operator of X and f∘g:A→A is an interior operator of A.Example 1.6 (closing and opening).
The closure operatorER∘DRt and the interior operator DR∘ERt on 𝒳 which are induced by the adjunctions in Example 1.4 are called closing and opening by R, respectively. Similarly, we may define the closing and opening by Rt as operators on 𝒜.In any complete lattice, closure operators are characterized by the notion of Moore family [8], where a Moore family is a subset M of a partially ordered set X which satisfies the following condition. For any subset S⊆M, if S has the infimum ⋀S in X, then ⋀S∈M holds true.Proposition 1.7 (see [7, 8]).
LetX be a partially ordered set. (1)
For any closure operatorφ:X→X, the totality of all φ-closed sets 𝔉φ={x∈X∣φ(x)=x} forms a Moore family.(2)
IfX is a complete lattice, then for any Moore family M⊆X, there exists a unique closure operator on X such that M=𝔉φ holds.We may establish similar properties of interior operators by appealing to the duality of a Moore family [7].


## 2. Quantum Logic

We refer to [9, 10] for quantum logic and lattice theory associated to it and we assemble here the minimum requisites for the subsequent discussions.For simplicity’s sake, we assume that the latticeL always has the maximum element 1 and the minimum element 0 throughout in what follows.


### 2.1. OL and OQL

Anortho-complemented latticeL is a lattice which has an involutive and complementary operation ·′:L→L reversing the order:(1)
a∧a′=0, a∨a′=1.(2)
(a′)′=a.(3)
a≤b⇒b′≤a′.If, moreover, fora and its complement a′, the modular relation
(2.1)b≤a′⇒(a∨b)∧a′=b
holds, then L is called an orthomodular lattice.An ortho-complemented lattice satisfying the modular relation(2.2)c≤b⇒(c∨a)∧b=c∨(a∧b)
for any a, b is an orthomodular, but not conversely. A Boolean lattice is an ortho-complemented lattice satisfying the modular relation. The inclusion order among these classes of lattices is
(2.3)Boolean⊂modularortho-complemented⊂orthomodular⊂ortho-complemented.In general, we call collectivelyquantum logic (QL) both orthologic (OL) modelled on an ortho-complemented lattice and orthomodular logic (OQL) modelled on an orthomodular lattice. An orthomodular lattice being an ortho-complemented lattice, we mostly work with OL, with additional mentioning of some special features intrinsic of OQL.The language of QL consists of a countable number of propositional variablesp,q,r,…, and logical connectives ¬ (negation), ∧ (conjunction). Denote by α,β,… the formulae with Φ their totality. The disjunction ∨ is defined as an abbreviation of ¬(¬α∧¬β).


### 2.2. Kripke Semantics

The pair𝔉=(Ω,R) of the set of all possible worlds Ω≠∅ and the reflexive and accessibility relations R⊆Ω×Ω is called a Kripke frame or orthogonal frame of OL. Intuitionally, the binary relation ϖ∈R(ω) means that ω and ϖ are “not  orthogonal". Indeed, defining ω⊥ϖ by ϖ∉R(ω), then we see that the reflexiveness corresponds to ω⊥ω, while symmetry to ϖ⊥ω⇒ω⊥ϖ.For any set of possible worldsX⊆Ω, we define its ortho-complement set by
(2.4)X′={ω∈Ω∣ω⊥ξ(∀ξ∈X)}.
Then in view of this, the power set lattice 2Ω of Ω becomes ortho-complemented. The orthogonality of a set X and the possible worlds ω is defined by
(2.5)ω⊥X⟺ω∈X′.
Expressing the orthogonality in terms of morphological operations
(2.6)ω⊥X⟺ω∈DR(X)∁=ER(X∁).In an orthogonal frame𝔉=(Ω,R), we consider a special class of subsets called propositions in 𝔉, that is, X is a proposition in 𝔉 means that X′′=X holds. As we shall see below, it immediately follows from the definition that formulae in OL may be interpreted by assigning propositions in an orthogonal frame.Proposition 2.1.
In an orthogonal frame𝔉=(Ω,R), for X⊆Ω to be a proposition, it is necessary and sufficient that it is an R-closed set (ER(DR(X))=X) in the sense of morphology.
(Note thatR being symmetric, we have DR=DRt.)Proof.
By (2.6), we have X′=DR(X)∁, whence
(2.7)X′′=DR(DR(X)∁)∁=ER(DR(X)).Corollary 2.2.
The totality𝔓𝔉 of all propositions of 𝔉 forms a lower semi-complete ortho-complemented sublattice of 2Ω.Proof.
Note thatDR(∅)=∅, and that from reflexibility of R, we have DR(X)=X, so that ∅′′=∅, X′′=X. Hence, ∅, X∈𝔓𝔉. Since 𝔓𝔉 is a Moore family, and a fortiori lower semi-complete. Also, since DR∘ER∘DR=DR, we have for X∈𝔓𝔉, (X′)′′=(X′′)′=(DR(ER(DR(X))))∁=DR(X)∁=X′, whence we obtain X′∈𝔓𝔉. Hence, 𝔓𝔉 is closed with respect to the complementation '.
LetΠ be a lower semi-complete ortho-complemented sub-lattice of 𝔓𝔉 and let ρ:Φ→Π be a mapping such that (1)
ρ(¬α)=ρ(α)'(2)
ρ(α∧β)=ρ(α)∧ρ(β).We call the set 𝔐=(Ω,R,Π,ρ) a Kripke model of OL, consisting of both this and the Kriplke frame 𝔉=(Ω,R).
Ifω∈ρ(α) holds true, we write ω⊨𝔐α and say that the formula α is true in the possible world α. We call the formula α such that ρ(α)=Ω is true in the model 𝔐 and write ⊨𝔐α. More generally, if for any β belonging to a set T of formulae, we have ρ(β)⊆ρ(α), then we say that α is a consequence of T in the model 𝔐 and write T⊨𝔐α. If further, these hold true in any models, then we say that they are logically true in or logical consequences of, OL respectively.
The Kripke semantics of the orthomodular logic OQL may be defined by considering asΠ only those satisfying the orthomodular condition
(2.8)X⊈Y⇒X∩(X∩Y)′≠∅.


## 2.1. OL and OQL

Anortho-complemented latticeL is a lattice which has an involutive and complementary operation ·′:L→L reversing the order:(1)
a∧a′=0, a∨a′=1.(2)
(a′)′=a.(3)
a≤b⇒b′≤a′.If, moreover, fora and its complement a′, the modular relation
(2.1)b≤a′⇒(a∨b)∧a′=b
holds, then L is called an orthomodular lattice.An ortho-complemented lattice satisfying the modular relation(2.2)c≤b⇒(c∨a)∧b=c∨(a∧b)
for any a, b is an orthomodular, but not conversely. A Boolean lattice is an ortho-complemented lattice satisfying the modular relation. The inclusion order among these classes of lattices is
(2.3)Boolean⊂modularortho-complemented⊂orthomodular⊂ortho-complemented.In general, we call collectivelyquantum logic (QL) both orthologic (OL) modelled on an ortho-complemented lattice and orthomodular logic (OQL) modelled on an orthomodular lattice. An orthomodular lattice being an ortho-complemented lattice, we mostly work with OL, with additional mentioning of some special features intrinsic of OQL.The language of QL consists of a countable number of propositional variablesp,q,r,…, and logical connectives ¬ (negation), ∧ (conjunction). Denote by α,β,… the formulae with Φ their totality. The disjunction ∨ is defined as an abbreviation of ¬(¬α∧¬β).


## 2.2. Kripke Semantics

The pair𝔉=(Ω,R) of the set of all possible worlds Ω≠∅ and the reflexive and accessibility relations R⊆Ω×Ω is called a Kripke frame or orthogonal frame of OL. Intuitionally, the binary relation ϖ∈R(ω) means that ω and ϖ are “not  orthogonal". Indeed, defining ω⊥ϖ by ϖ∉R(ω), then we see that the reflexiveness corresponds to ω⊥ω, while symmetry to ϖ⊥ω⇒ω⊥ϖ.For any set of possible worldsX⊆Ω, we define its ortho-complement set by
(2.4)X′={ω∈Ω∣ω⊥ξ(∀ξ∈X)}.
Then in view of this, the power set lattice 2Ω of Ω becomes ortho-complemented. The orthogonality of a set X and the possible worlds ω is defined by
(2.5)ω⊥X⟺ω∈X′.
Expressing the orthogonality in terms of morphological operations
(2.6)ω⊥X⟺ω∈DR(X)∁=ER(X∁).In an orthogonal frame𝔉=(Ω,R), we consider a special class of subsets called propositions in 𝔉, that is, X is a proposition in 𝔉 means that X′′=X holds. As we shall see below, it immediately follows from the definition that formulae in OL may be interpreted by assigning propositions in an orthogonal frame.Proposition 2.1.
In an orthogonal frame𝔉=(Ω,R), for X⊆Ω to be a proposition, it is necessary and sufficient that it is an R-closed set (ER(DR(X))=X) in the sense of morphology.
(Note thatR being symmetric, we have DR=DRt.)Proof.
By (2.6), we have X′=DR(X)∁, whence
(2.7)X′′=DR(DR(X)∁)∁=ER(DR(X)).Corollary 2.2.
The totality𝔓𝔉 of all propositions of 𝔉 forms a lower semi-complete ortho-complemented sublattice of 2Ω.Proof.
Note thatDR(∅)=∅, and that from reflexibility of R, we have DR(X)=X, so that ∅′′=∅, X′′=X. Hence, ∅, X∈𝔓𝔉. Since 𝔓𝔉 is a Moore family, and a fortiori lower semi-complete. Also, since DR∘ER∘DR=DR, we have for X∈𝔓𝔉, (X′)′′=(X′′)′=(DR(ER(DR(X))))∁=DR(X)∁=X′, whence we obtain X′∈𝔓𝔉. Hence, 𝔓𝔉 is closed with respect to the complementation '.
LetΠ be a lower semi-complete ortho-complemented sub-lattice of 𝔓𝔉 and let ρ:Φ→Π be a mapping such that (1)
ρ(¬α)=ρ(α)'(2)
ρ(α∧β)=ρ(α)∧ρ(β).We call the set 𝔐=(Ω,R,Π,ρ) a Kripke model of OL, consisting of both this and the Kriplke frame 𝔉=(Ω,R).
Ifω∈ρ(α) holds true, we write ω⊨𝔐α and say that the formula α is true in the possible world α. We call the formula α such that ρ(α)=Ω is true in the model 𝔐 and write ⊨𝔐α. More generally, if for any β belonging to a set T of formulae, we have ρ(β)⊆ρ(α), then we say that α is a consequence of T in the model 𝔐 and write T⊨𝔐α. If further, these hold true in any models, then we say that they are logically true in or logical consequences of, OL respectively.
The Kripke semantics of the orthomodular logic OQL may be defined by considering asΠ only those satisfying the orthomodular condition
(2.8)X⊈Y⇒X∩(X∩Y)′≠∅.


## 3. Morphological Analysis of Implication Connectives

### 3.1. Implication Problem in QL

In quantum logic QL, the implication problem is important [10]. Not only those in quantum logic, but in general, an implication connective → is required to satisfy, for any model 𝔐, at least the conditions(1)
⊨𝔐α→α,(2)
If⊨𝔐α and ⊨𝔐α→β, then ⊨𝔐β.In QL, this condition may be stated as follows. For any Kripke model𝔐, we have
(3.1)⊨𝔐α→β⟺ρ(α)⊆ρ(β).
Thus, we take (3.1) as a requirement for an implication connective → in QL [10]. Then we note that the forumula α→β:=¬α∨β in classical logic is not an implication connective in the sense of QL.On the other hand, there are several candidates for implication connectives. However, there are only 5 polynomial ones in the sense that they are expressed in finitely many¬, ∨, ∧ [10]:  (i)
α→1β:=¬α∨(α∧β),(ii)
α→2β:=β∨(¬α∧¬β),(iii)
α→3β:=(¬α∧β)∨(α∧β)∨(¬α∧¬β),(iv)
α→4β:=(¬α∧β)∨(α∧β)∨((¬α∨β)∧¬β),(v)
α→5β:=(¬α∧β)∨(¬α∧¬β)∨(α∧(¬α∨β)).These are the all candidates for polynomial implications in the free orthomodular lattice generated by two elements satisfying(3.2)a≤b⟺a→*b=1.
There is a distinction between OL and OQL in that they are really implications in the respective logic.Theorem 3.1 (see [10]).
The polynomial implications→i(1≤i≤5) are all implications in OQL but none of them are so in OL.Proof.
Proof depends on the fact that for (3.1) to hold for each i, it is necessary and sufficient that ϖ satisfies the orthomodular condition (2.8). For details we refer to [10].Theorem 3.2.
In OQL,α→iβ(i=1,2,4,5) are logical consequences of α→3β, that is, in any Kripke model 𝔐=(Ω,R,Π,ρ), we have
(3.3)ρ(α→3β)⊆ρ(α→iβ)(i=1,2,4,5).Proof.
We fix a Kripke model𝔐=(Ω,R,Π,ρ). Interpretation of each implication is as follows, where we denote the interpretations of the formulae α, β by A=ρ(α), B=ρ(β), respectively.〈1〉ρ(α→1β)=(A∩(A∩B)′)′,〈2〉ρ(α→2β)=(B′∩(A′∩B′)′)′,〈3〉ρ(α→3β)=((A′∩B)′∩(A∩B)′∩(A′∩B′)′)′,〈4〉ρ(α→4β)=((A′∩B)′∩(A∩B)′∩((A∩B′)′∩B′)′)′,〈5〉  ρ(α→5β)=((A′∩B)′∩(A′∩B′)′∩(A∩(A∩B′)′)′)′.
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
1
β
)
. It suffices to prove A⊆(A′∩B)′∩(A′∩B′)′, which reads in morphological operations,
(3.4)A⊆DR(DR(A)∁∩B)∁∩DR(DR(A)∁∩DR(B)∁)∁.
Taking complements of bothsides, we obtain
(3.5)A∁⊇DR(DR(A)∁∩B)∪DR(DR(A)∁∩DR(B)∁)=DR((DR(A)∁∩B)∪(DR(A)∁∩DR(B)∁))
by the definition of dilation. Then by adjunction, this is equivalent to the following:
(3.6)ER(A∁)⊇(DR(A)∁∩B)∪(DR(A)∁∩DR(B)∁)=(ER(A∁)∩B)∪(ER(A∁)∩DR(B)∁).
The last equality follows from the duality between DR and ER. However, this inclusion relation is always true.
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
2
β
). It suffices to prove B′⊆(A′∩B)′∩(A∩B)′, which can be done as in the proof of ρ(α→3β)⊆ρ(α→1β).
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
4
β
). (A′∩B′)′⊇((A∩B′)′∩B′)′, or what amounts to the same thing, it is enough to show A′∩B′⊆(A∩B′)′∩B′. Further for this to be true, it is necessary and sufficient that A′⊆(A∩B′)′, which is true, being equivalent to A⊇A∩B′.
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
5
β
). Enough to prove (A∩B)′⊇(A∩(A∩B′)′)′ and the proof can be done in the same way as the proof of ρ(α→3β)⊆ρ(α→4β).


## 3.1. Implication Problem in QL

In quantum logic QL, the implication problem is important [10]. Not only those in quantum logic, but in general, an implication connective → is required to satisfy, for any model 𝔐, at least the conditions(1)
⊨𝔐α→α,(2)
If⊨𝔐α and ⊨𝔐α→β, then ⊨𝔐β.In QL, this condition may be stated as follows. For any Kripke model𝔐, we have
(3.1)⊨𝔐α→β⟺ρ(α)⊆ρ(β).
Thus, we take (3.1) as a requirement for an implication connective → in QL [10]. Then we note that the forumula α→β:=¬α∨β in classical logic is not an implication connective in the sense of QL.On the other hand, there are several candidates for implication connectives. However, there are only 5 polynomial ones in the sense that they are expressed in finitely many¬, ∨, ∧ [10]:  (i)
α→1β:=¬α∨(α∧β),(ii)
α→2β:=β∨(¬α∧¬β),(iii)
α→3β:=(¬α∧β)∨(α∧β)∨(¬α∧¬β),(iv)
α→4β:=(¬α∧β)∨(α∧β)∨((¬α∨β)∧¬β),(v)
α→5β:=(¬α∧β)∨(¬α∧¬β)∨(α∧(¬α∨β)).These are the all candidates for polynomial implications in the free orthomodular lattice generated by two elements satisfying(3.2)a≤b⟺a→*b=1.
There is a distinction between OL and OQL in that they are really implications in the respective logic.Theorem 3.1 (see [10]).
The polynomial implications→i(1≤i≤5) are all implications in OQL but none of them are so in OL.Proof.
Proof depends on the fact that for (3.1) to hold for each i, it is necessary and sufficient that ϖ satisfies the orthomodular condition (2.8). For details we refer to [10].Theorem 3.2.
In OQL,α→iβ(i=1,2,4,5) are logical consequences of α→3β, that is, in any Kripke model 𝔐=(Ω,R,Π,ρ), we have
(3.3)ρ(α→3β)⊆ρ(α→iβ)(i=1,2,4,5).Proof.
We fix a Kripke model𝔐=(Ω,R,Π,ρ). Interpretation of each implication is as follows, where we denote the interpretations of the formulae α, β by A=ρ(α), B=ρ(β), respectively.〈1〉ρ(α→1β)=(A∩(A∩B)′)′,〈2〉ρ(α→2β)=(B′∩(A′∩B′)′)′,〈3〉ρ(α→3β)=((A′∩B)′∩(A∩B)′∩(A′∩B′)′)′,〈4〉ρ(α→4β)=((A′∩B)′∩(A∩B)′∩((A∩B′)′∩B′)′)′,〈5〉  ρ(α→5β)=((A′∩B)′∩(A′∩B′)′∩(A∩(A∩B′)′)′)′.
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
1
β
)
. It suffices to prove A⊆(A′∩B)′∩(A′∩B′)′, which reads in morphological operations,
(3.4)A⊆DR(DR(A)∁∩B)∁∩DR(DR(A)∁∩DR(B)∁)∁.
Taking complements of bothsides, we obtain
(3.5)A∁⊇DR(DR(A)∁∩B)∪DR(DR(A)∁∩DR(B)∁)=DR((DR(A)∁∩B)∪(DR(A)∁∩DR(B)∁))
by the definition of dilation. Then by adjunction, this is equivalent to the following:
(3.6)ER(A∁)⊇(DR(A)∁∩B)∪(DR(A)∁∩DR(B)∁)=(ER(A∁)∩B)∪(ER(A∁)∩DR(B)∁).
The last equality follows from the duality between DR and ER. However, this inclusion relation is always true.
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
2
β
). It suffices to prove B′⊆(A′∩B)′∩(A∩B)′, which can be done as in the proof of ρ(α→3β)⊆ρ(α→1β).
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
4
β
). (A′∩B′)′⊇((A∩B′)′∩B′)′, or what amounts to the same thing, it is enough to show A′∩B′⊆(A∩B′)′∩B′. Further for this to be true, it is necessary and sufficient that A′⊆(A∩B′)′, which is true, being equivalent to A⊇A∩B′.
Proof of
ρ
(
α
→
3
β
)
⊆
ρ
(
α
→
5
β
). Enough to prove (A∩B)′⊇(A∩(A∩B′)′)′ and the proof can be done in the same way as the proof of ρ(α→3β)⊆ρ(α→4β).


## 4. Conclusion

By applying morphological analysis to a Kripke model in quantum logics, we have shown that→3 is the strongest among the 5 polynomial implication connectives in OQL. Once one sees the result, one may feel that one could do without morphological analysis. However, the point lies in whether by just looking at the defining equation ((i)~(v)) or its interpretation, one could recognize the conclusion. Thus, the merit of morphological analysis seems to be its intuitive lucidness as “Calculus.”We would like to return to the analysis of connectives other than→3.



---

*Source: 259541-2012-11-05.xml*