Program Semantics and Classical Logic



continuity while the second lemma proves a generalisation related to weak
anticontinuity. Lemma 6 will be applied immediately in the proof of lemma
8 below, but the application of lemma 7 will have to wait a bit, until we come
to the proof of Scott’s Induction Rule.

Lemma 6 Let Aα be continuous in ξ1 , . . . , ξn, then

[ V (A, α[RJ7ξι,..., Rn∙∕ξn]) = V (A[RT∕ξι,     R£∕ξn])

m

Proof. Repeated application of continuity gives us that

[ ... [ V (A, a[R∕ξι,..., Rnmn ∕ξn]) = V (A, a[Rω ∕ξι,..., R ∕ξn])

m1 mn

That the lefthand side of this equation is equal to

[ V (A, a[R1m ∕ξ1,...,Rnm∕ξn])
m

follows by the monotonicity of A in each of the variables ξ1,..., ξn.   

Lemma 7 Let Aα be continuous in ξ1 , . . . , ξn , while B is weakly anticontin-
uous in
ζα, and ξ1 , . . . , ξn are not free in B. For each k (1 k n), let
R0k R1k . . . Rkm . . . be a chain, then

\ V([A∕ζ]B, a[R1m∕ξ1,..., Rnm∕ξn]) ⊆V([A∕ζ]B,a[R1ω∕ξ1,...,Rnω∕ξn])
m

Proof. For each m ∈ N let Sm  = V(A, a[R1m ∕ξ1 , . . . , Rnm ∕ξn ]). From the

monotonicity of A in each ξk we obtain that S0 S1 . . . Sm ⊆ ....

Hence, by the usual Substitution Theorem and the weak anticontinuity of B
in ζ,

\ V ([A∕ζ]B, a[RT∕ξι,..., Rn∙∕ξJ) = \ V (B, a[S m∕ζ ]) ⊆ V (B, a[Sω ∕ζ ])
mm

From Lemma 6 it follows that Sω = V(A, a [R1ω∕ξ1, . . . , Rnω∕ξn ]) for each m,
so that

V(B, a[Sω∕ζ]) =V([A∕ζ]B,a[R1ω∕ξ1,...,Rnω∕ξn])

18



More intriguing information

1. The name is absent
2. Income Taxation when Markets are Incomplete
3. Hemmnisse für die Vernetzungen von Wissenschaft und Wirtschaft abbauen
4. Weather Forecasting for Weather Derivatives
5. The name is absent
6. Menarchial Age of Secondary School Girls in Urban and Rural Areas of Rivers State, Nigeria
7. The name is absent
8. The name is absent
9. PERFORMANCE PREMISES FOR HUMAN RESOURCES FROM PUBLIC HEALTH ORGANIZATIONS IN ROMANIA
10. The name is absent