This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
-r-,p. Now the Brouwersche axiom can be written: 108
(5.1.3.1)
Quantum
Logic
p->D-iD-ip and if •—i is read as some kind of strong form of negation ("necessarily not") then the axiom looks like the corresponding IL-valid, or Brouwerian, axiom (5.1.3.1), hence the terminology. T h e set of modal formulae—i.e. the set of well-formed formulae in the usual language of P C , with • and O now included —will be denoted by O M . A modal formula a which can be deduced from the axioms and inference rules listed above is called a theorem of the modal B-system, and we write:
if a is a theorem of the modal B-system. A (Kripke) B-modelis a triple 2S = ( W , =, v ) , where W i s a set (of "worlds"), = a proximity relation on W and v : O M X W —> 2 is a function satisfying: V I . F o r each w € W,
v( ,w):<$>M—>2 is a Boolean valuation
with respect to —i and A . T h a t is: v(—\Ot,w) = —iv(a,w), v ( a A / 3 , u ; ) =v(a,w)
and AV((3,W)
V 2 . F o r any modal formula a,
;
v(U\a,w)
= 1 iff v(a,v)
= 1 for
every v such that v ~ w. It follows that: V 3 . v ( a v j 3 , w ) =v(a,w)v
v((3,w),
where v denotes the classi-
cal disjunct, and V 4 . F o r any modal formula a, v(Oa,w) 3v with v ~ w) such that v(a,v)
109
= 1.
= 1 iff 3v ~ w (i.e.
Quanta, Logic and Spacetime (In general a Kripke model is a frame (W, J?) together with a set of valuations—indexed by worlds—of the type specified above: namely, they are Boolean valued, and act on modal formulae in the manner specified. Since each such valuation v( ,w) is determined by its behavior on atoms, a completely equivalent way of specifying the conditions listed above could be expressed in terms of a countable family of subsets of W, to be construed as the truth sets of atoms, the truth set of the atom a ; being the set of worlds at which—please see below—at is declared true. Some authors prefer this formulation: cf. Chellas 1980.) A modal formula a is said to be: true at the world w in the B-modefSi, written w\=^a,
iff v(a,w) = 1; true on the set EczW,
iff w^a
written E\=^a,
for all w 6 E;
true in the B-model S& iff W\=^a; B-valid, written \=a, if it is true in all B-models. These models characterize the B-system: THEOREM
5.1.3.1
(This is proved in the references cited above.) That this resemblance between Kripke models for OL and models for the modal B-system goes deeper, seems to have been noticed almost simultaneously by R. Goldblatt (Goldblatt 1974) and H. Dishkant (Dishkant 1977). Since the means are at our disposal, and since we wish to exploit this result as a springboard to a more constructive externalization of OL, we shall sketch a proof of a simplified version of their result that OL may be interpreted within the 110
Quantum
Logic
modal B-system. Specifically, we shall sketch below a proof that theorems of O L admit a translation into theorems of the B-system. These results have provided important insights into the peculiarities of O L when compared with classical logic, since properties of the ambient B-system were well-known. Extensive elaborations of these results were obtained by Dalla Chiara and others. Cf. references in Dalla Chiara et aL 2002 and Burghardt 1984. T h e translation recursively assigns t o each orthoformula a 6 <J> a modal formula a ° e $ M as follows: T l ) For atomic formulae a^. a° =\JOa{ T2) (anP)0
=
a0Ap°
T3) ( ~ a ) 0 = D - . a ° (Note that the "quantization" of at, namely D O G ^ , is really a kind of double negation of a{ since D O = •—iD—i, which amounts to a double J_ on sets of worlds: cf. the remark following equation (5.1.2.11).) W e will prove that a is an orthotheorem iff a° is a theorem of the B-system. Suppose a Kripke orthomodel M — \W,~, Q) is given. T h e n a B-model %=(W,~,ve)
(5.1.3.2)
may be constructed by defining, for w G W and atomic formulae a,•: \\ y(ai,w) = \
ifweg(at)
which may then be inductively extended to O rules (V1)-(V4) given above.
Ill
M
(5.1.3.3)
according to the
Quanta, Logic and Spacetime Let us write, for each modal formula a and B-model
\\a\L={weW:w\=*a}.
(5.1.3.4)
Then it is clear that: l|ttAj3B 9 =H 9 n|j8| 9 ,
(5.1.3.5)
lb"la=IMI a .
(5.1.3.6)
IP«IL=n||«IL
(5.1.3.7)
«0«L = 0|«L.
(5.1.3.8)
and
where the right hand sides are as in equations (5.1.2.3), etc. (We will often drop the subscript when the context is clear.) Returning to the B-model 26^ we note that lkll 9 ,= 0(
5.1.3.1
For atomic 8 , 6 $ L
w^DOtti
2 w
- ^P~^ai
iffwegiaj
iffw^Qi-a,)
112
(5-1-3.9)
Quantum Logic PROOF
1. v ff (DOa i ,«;) = lifF w4nOal\\=nO\\ai\\=DOg(al)
=
g(ai)±1=g(at).
2. v e (D- 1 a i ,iy) = lifF w e I p - i a J I = D - , | | a J = D | | a J c = D^(a,) c = ^ a ^ = g^a,).
I
It follows easily from (T3) and (M8) that
K-^rihln^aJi. In particular, ve((~ai)°,w)
= 1 iff vg (n-,aitw)
= 1
(5.1.3.10)
so the last lemma can be restated as: COROLLARY
5.1.3.1 L w
^=»Ma° iffwegiaj
PROPOSITION
5.1.3.1 For any a £ $ w
^mMa°
iffweg{a).
The proof is an easy induction on the complexity (i.e. length) of a, the base case being covered by the last corollary. 113
Quanta, Logic and Spacetime PROPOSITION
5.1.3.2 For a e $ \—Ba° implies \—QOL.
PROOF
Choose a Kripke orthomodel M — (W,~,g). Then, \—Bot° implies that a° is true in the B-model associated with M, namely, %i = (W,~,vg) (equation (5.1.3.2)): that is, w\=^a0 for all w e W. Then, by the last proposition, g(a) = W, so a is true in the arbitrarily chosen Kripke orthomodel M, hence in every such orthomodel, so \—Qa (Theorem 5.1.2.1). I Now, given a B-model 2S = (W, ~, v) we may construct a Kripke orthomodel M = (W,~, gv), where gv is given on atoms by
QM) S I
(5.1.3.11)
(which is a proposition by Lemma 5.1.2.1 (3)), and defined inductively on O. The following lemma is again an easy induction on complexityLEMMA
5.1.3.2 For any a e $
2v(a) = i"°la-
114
Quantum Logic PROPOSITION
5.1.3.3 For a e O \—Q a implies \—B a°.
PROOF
Choose any B-model 95 = (W, ~, v). Then if \—Qa, a is true in the associated Kripke orthomodel M (Theorem 5.1.2.1): that is, Qv(a) = W. So, by the last lemma, Ha 0 ^ = W showing that a° is true in the arbitrary B-model SS and hence B-valid. So \~B a°. I Thus, from the last two propositions, we obtain the modal translation theorem, namely: THEOREM
5.1.3.2 For a G O
h0aiffhBa°. We shall return to the modal interpretation of OL in the next chapter. It is to be remarked at this point that the Kripke frames that arise in the physics of quantum systems are of the following type. Let i£> denote a (complex) Hilbert space with inner product ( | ). Then, with f) denoting the set ^) — {0} of non-zero vectors in ^), and with £-Lr] iff (g\rj) = 0 for £, 17 e l ) , (fy-L) is an orthogonality space. Recall that if E is a subset of I) then the smallest closed subspace of $Q containing E, which we shall denote by [E], is just E U {0}, with terminology as in equation (5.1.1.10). Thus if E is a subset of I) we have
115
Quanta, Logic and Spacetime
= [E]-{0}
(5.1.3.12)
so if E is a proposition (of ^) E=[E]-{0}.
(5.1.3.13)
Thus, a proposition of I) is a closed subspace of tQ with the zero element removed. Conversely if .Fis a closed subspace of !g it is quickly seen that F — {0} is a proposition of I). So the propositions of I) correspond with the closed subspaces of & via the assignment £? I—> [£?], a correspondence immediately seen to be bijective. This bijection is also easily seen to preserve the respective ortholattice structures. (Note that in this correspondence 0 I—> [ 0 ] ={0}.) That is, the ortholattice R(fy) is isomorphic with the ortholattice of closed subspaces of S~). 5-1.4
The Implication Problem and Orthomodular Logic
In ordinary classical P C the interpretation of material implication, p—>q, as —\pvq has the consequence that for any Boolean algebra valued valuation v, v{p^q)=v(pYvv(q) = l iff v(p)
(5.1.4.1)
This situation fails to hold in OL, however, as the following example shows:
116
Quantum Logic
(5.1.4.2)
In this (nondistributive) ortholattice, known as the Chinese lantern, we have a'ub=\ but a[£6. Thus (5.1.4.1) would fail for certain valuations into this lattice of certain orthoformulae, showing that ~au/3 would not be a viable interpretation of a deduction (x\—QP in OL, in view of Theorem 5.1.1.1. There is another characterization of classical implication. In any Boolean algebra the element p—>q, defined as above, is characterized by the property: r