p-morphism


Let ℱ1=(W1,R1) and ℱ2=(W2,R2) be Kripke frames. A p-morphism from ℱ1 to ℱ2 is a function f:W1→W2 such that

  • •

    if u⁢R1⁢w, then f⁢(u)⁢R2⁢f⁢(w),

  • •

    if s⁢R2⁢t and s=f⁢(u) for some u∈W1, then u⁢R1⁢w and t=f⁢(w) for some w∈W1,

We write f:ℱ1→ℱ2 to denote that f is a p-morphism from ℱ1 to ℱ2.

Let M1=(ℱ1,V1) and M2=(ℱ2,V2) be Kripke models of modal propositional logicPlanetmathPlanetmath PLM. A p-morphism from M1 to M2 is a p-morphism f:ℱ1→ℱ2 such that

Proposition 1.

For any wff A, M1⊧wA iff M2⊧f⁢(w)A.

Proof.

Induct on the number n of logical connectives in A. When n=0, A is either ⟂ or a propositional variable. The case when A is ⟂ is obvious, and the other case is definition. Next, suppose A is B→C, then M1⊧wA iff M1⊧̸wB or M1⊧wC iff M2⊧̸f⁢(w)B or M2⊧f⁢(w)C iff M2⊧f⁢(w)A. Finally, suppose A is □⁢B, and M1⊧wA. To show M2⊧f⁢(w)A, let t be such that f⁢(w)⁢R2⁢t. Then there is a u such that t=f⁢(u) and w⁢R1⁢u, so that M1⊧uB. By inductionMathworldPlanetmath, M2⊧f⁢(u)B, or M2⊧tB. Hence M2⊧f⁢(w)A. Conversely, suppose M2⊧f⁢(w)A. To show M1⊧wA, let u be such that w⁢R1⁢u. So f⁢(w)⁢R2⁢f⁢(u), and therefore M2⊧f⁢(u)B. By induction, M1⊧uB, whence M1⊧wA. ∎

Proposition 2.

If a p-morphism f:F1→F2 is one-to-one, then F2⊧A implies F1⊧A for any wff A.

Proof.

Suppose ℱ2⊧A. Let M=(W1,R1,V1) be any model based on ℱ1 and w any world in W1. We want to show that M⊧wA.

Define a Kripke model M′:=(W2,R2,V2) as follows: for any propositional variable p, let V2⁢(p):={s∈W2∣f-1⁢(s)∩V1⁢(p)≠∅}. Then M⊧wp iff w∈V1⁢(p) iff f-1⁢(f⁢(w))={w}⊆V1⁢(p) (since f is one-to-one) iff f-1⁢(f⁢(w))∩V1⁢(p)≠∅ iff f⁢(w)∈V2⁢(p) iff M′⊧f⁢(w)p. This shows that f is a p-morphism from M to M′.

Now, let w∈W1. Then M′⊧f⁢(w)A by assumptionPlanetmathPlanetmath. By the last propositionPlanetmathPlanetmath, M⊧wA. ∎

Proposition 3.

If a p-morphism f:F1→F2 is onto, then F1⊧A implies F2⊧A for any wff A.

Proof.

Suppose ℱ1⊧A. Let M=(W2,R2,V2) be any model based on ℱ2 and s any world in W2. We want to show that M⊧sA.

Define a Kripke model M′:=(W1,R1,V1) as follows: for any propositional variable p, let V1⁢(p):={w∈W1∣f⁢(w)∈V2⁢(p)}. Then w∈V1⁢(p) iff f⁢(w)∈V2⁢(p), so f is a p-morphism from M′ to M, and by assumption M′⊧A for any wff A.

Now, let w∈W1 be a world such that f⁢(w)=s. Since M′⊧A, M′⊧wA in particular, and therefore M⊧f⁢(w)A or M⊧sA by the last proposition. ∎

Corollary 1.

If f:F1→F2 is bijectiveMathworldPlanetmathPlanetmath, then F1⊧A iff F2⊧A for any wff A.

A frame ℱ′ is said to be a p-morphic image of a frame ℱ if there is an onto p-morphism f:ℱ→ℱ′. Let 𝒞 be the class of all frames validating a wff. Then by the third proposition above, 𝒞 is closed under p-morphic images: if a frame is in 𝒞, so is any of its p-morphic images. Using this property, we can show the following: if 𝒞 is the class of all frames validating a wff A, then 𝒞 can not be

  • •

    the class of all irreflexiveMathworldPlanetmath frames

  • •

    the class of all asymetric frames

  • •

    the class of all anti-symmetric frames

Proof.

Let ℱ1=(ℕ,<) and ℱ2=({0},R), where 0⁢R⁢0. Notice that ℱ1 is in both the class of irreflexive frames and the class of asymetric frames, but ℱ2 is in neither. Let f:ℕ→{0} be the obvious surjection. Clearly, m<n implies f⁢(m)⁢R⁢f⁢(n). Also, if f⁢(m)⁢R⁢0, then f⁢(m)⁢R⁢f⁢(m+1). So f is a p-morphism. Suppose 𝒞 is either the class of all irreflexive frames or the class of all asymetric frames. If A is validated by 𝒞, A is validated by ℱ1 in particular (since ℱ1 is in 𝒞), so that A is validated by ℱ2 as well, which means ℱ2 is 𝒞 too, a contradictionMathworldPlanetmathPlanetmath. Therefore, no such an A exists.

Next, let ℱ3=(ℕ,S), where n⁢S⁢(n+1) for all n∈ℕ and ℱ4=({0,1},R), where R={(0,1),(1,0)}. Let 𝒞 be the class of all anti-symmetric frames. Then ℱ3 is in 𝒞 but ℱ4 is not. Let f:ℱ3→ℱ4 be given by f⁢(n)=0 if n is even and f⁢(n)=1 if n is odd. If a⁢S⁢b, then f⁢(a) and f⁢(b) differ by 1, so f⁢(a)⁢R⁢f⁢(b). On the other hand, if f⁢(a)⁢R⁢x, then x is either 0 or 1, depending on whether a odd or even. Pick b=a+1, so a⁢S⁢b and f⁢(b)=x. This shows that f is a p-morphism. By the same argument as in the last paragraph, no wff A is validated by precisely the members of 𝒞. ∎

Title p-morphism
Canonical name Pmorphism
Date of creation 2013-03-22 19:34:54
Last modified on 2013-03-22 19:34:54
Owner CWoo (3771)
Last modified by CWoo (3771)
Numerical id 12
Author CWoo (3771)
Entry type Definition
Classification msc 03B45
Related topic Bisimulation
\@unrecurse