11institutetext: Institut für Logic and Computation, Technische Universität Wien, 1040 Wien, Austria
11email: {kees,lyon}@logic.at
Appendix for: Cut-free Calculi and Relational Semantics for Temporal STIT logics
Kees van Berkel
11
Tim Lyon
11
Abstract
This paper is an appendix to the paper “Cut-free Calculi and Relational Semantics for Temporal STIT logics” by Berkel and Lyon, 2019 [2]. It provides the completeness proof for the basic STIT logic Ldm (relative to irreflexive, temporal Kripke STIT frames) as well as gives the derivation of the independence of agents axiom for the logic Xstit.
Appendix 0.A Completeness of Ldm
We give the definitions and lemmas sufficient to prove the completeness of Ldm relative to Tstit frames [4, 2]. We make use of the canonical model of Ldm (obtained by standard means [3, 1]) to construct a Tstit model. A truth-lemma is then given relative to this model, from which, completeness follows as a corollary.
Definition 1 (Ldm-CS, Ldm-MCS)
A set Θ⊂LLdm is a Ldm consistent set (Ldm-CS) iff Θ⊢Ldm⊥. We call a set Θ⊂LLdm a Ldm maximally consistent set (Ldm-MCS) iff Θ is a Ldm-CS and for any set Θ′ such that Θ⊂Θ′, Θ′⊢Ldm⊥.
Lemma 1 (Lindenbaum’s Lemma [3])
Every Ldm-CS can be extended to a Ldm-MCS.
Definition 2 (Present and Future Pre-Canonical Tstit Model)
The present pre-canonical Tstit model is the tuple Mpres=(Wpres,R□pres, {Ripres∣i∈Ag},Vpres) defined below left, and the future pre-canonical Tstit model is the tuple Mfut=(Wfut,R□fut,{Rifut∣i∈Ag},Vfut) defined below right:
Wpres is the set of all Ldm-MCSs;
R□preswu iff for all □ϕ∈w, ϕ∈u;
Ripreswu iff for all [i]ϕ∈w, ϕ∈u;
Vpres(p)={w∈W∣p∈w}.
Wfut=Wpres;
R□fut(w)=⋂i∈AgRipres(w);
Rifut(w)=⋂i∈AgRipres(w);
Vfut(p)=Vpres(p).
Definition 3 (Canonical Temporal Kripke STIT Model)
We define the canonical temporal Kripke STIT model to be the tuple MLdm=(WLdm,R□Ldm, {RiLdm∣i∈Ag},RAgLdm,RGLdm,RHLdm, VLdm) such that:
WLdm=Wpres×N111Note that we choose to write each world (w,j)∈WLdm as wj to simplify notation. Moreover, we write ϕ∈wj to mean that the formula ϕ is in the Ldm-MCS w associated with j.;
R□Ldmwjuj iff (i) R□preswu and j=0, or (ii) R□futwu and j>0;
RiLdmwjuj iff (i) Ripreswu and j=0, or (ii) Rifutwu and j>0;
RAgLdm(wj)=⋂1≤i≤nRiLdm(wj);
RGLdm={(wj,wk)∣wj,wk∈WLdm and j<k};
RHLdm={(ui,wi)∣(wi,ui)∈RGLdm};
VLdm(p)={wj∈WLdm∣w∈Vpres(p)}.
Lemma 2
For all α∈{□,Ag}∪Ag, if RαLdmwjuk for j,k∈N, then j=k.
Proof
Follows by definition of the canonical Tstit model.
Lemma 3
For all j∈N with k≥1, (wj,uj)∈RAgLdm iff (wj+k,uj+k)∈RAgLdm.
Proof
This follows from the fact that u0∈RAgLdm(w0) iff u∈⋂i∈AgRipres(w) iff u∈Rifut(w) for each i∈Ag iff u∈⋂i∈AgRifut(w) iff uk∈⋂i∈AgRiLdm(wk) for any k>0.
Lemma 4 ([3])
(i) For all x∈{pres,fut,Ldm}, R□xwu iff for all ϕ, if ϕ∈u, then ◊ϕ∈w. (ii) For all x∈{pres,fut,Ldm}, Rixwu iff for all ϕ, if ϕ∈u, then ⟨i⟩ϕ∈w.
Lemma 5 (Existence Lemma [3])
(i) For any world wj∈WLdm, if ◊ϕ∈wj, then there exists a world uj∈WLdm such that R□Ldmwjuj and ϕ∈uj. (ii) For any world wj∈WLdm, if ⟨i⟩ϕ∈wj, then there exists a world uj∈WLdm such that RiLdmwjuj and ϕ∈uj.
Lemma 6
The Canonical Model is a temporal Kripke STIT model.
Proof
We prove that MLdm has all the properties of a Tstit model:
By lemma 1, the Ldm consistent set {p} can be extended to a Ldm-MCS, and therefore Wpres is non-empty. Since N is non-empty as well, Wpres×N=WLdm is a non-empty set of worlds.
We argue that R□Ldm is an equivalence relation between worlds of WLdm, and omit the arguments for RiLdm and RAgLdm, which are similar. Suppose that wj∈WLdm. We have two cases to consider: (i) j=0, and (ii) j>0. (i) Standard canonical model arguments apply and R□Ldm is an equivalence relation between all worlds of the form w0∈WLdm (See [3] for details). (ii) If we fix a j>0, then R□Ldm will be an equivalence relation for all worlds of the form wj∈WLdm since the intersection of equivalence relations produces another equivalence relation. Last, since R□Ldm is an equivalence relation for each fixed j∈N, and because each Wpres×{j}⊂WLdm is disjoint from each Wpres×{j′}⊂WLdm for j=j′, we know that the union all such equivalence relations will be an equivalence relation.
Let i be in Ag and assume that (wj,uj)∈RiLdm. We split the proof into two cases: (i) j=0, or (ii) j>0. (i) Assume that □ϕ∈w0. Since w is a Ldm-MCS, it contains the axiom □ϕ→[i]ϕ, and so, [i]ϕ∈w as well. Since (w,u)∈Ripres (because j=0), we know that ϕ∈u by the definition of the relation; therefore, (w,u)∈R□pres, which implies that (w0,u0)∈R□Ldm by definition. (ii) The assumption that j>0 implies that u∈Rifut(w) =⋂i∈AgRipres(w)=R□fut(w) by definition, which implies that (wj,uj)∈R□Ldm.
Let u1j,...,unj∈WLdm and assume that R□Ldmuijukj for all i,k∈{1,...,n}. We split the proof into two cases: (i) j=0, or (ii) j>0. (i) We want to show that there exists a world wj∈WLdm such that wj∈⋂1≤i≤nRiLdm(uij). Let w^j=⋃1≤i≤n{ϕ∣[i]ϕ∈uij}. Suppose that w^j is inconsistent to derive a contradiction. Then, there are ψ1,…,ψk such that ⊢Ldm⋀1≤l≤kψi→⊥. For each i∈Ag, we define Φi={ψl∣[i]ψl∈uij}⊆{ψ1,...,ψk}. Observe that for each i∈Ag, [i]⋀Φi∈uij because ⋀[i]Φi∈uij and ⊢Ldm⋀[i]Φi→[i]⋀Φi. Since by assumption R□Ldmuijukj for all i,k∈{1,...,n}, this means that for any umj we pick (with 1≤m≤n), ◊[i]⋀Φi∈umj for each i∈Ag by lemma 4; hence, ⋀i∈Ag◊[i]⋀Φi∈umj. By the (IOA) axiom, this implies that ◊⋀i∈Ag[i](⋀Φi)∈umj. By lemma 5, there must exist a world vj such that R□Ldmumjvj and ⋀i∈Ag[i](⋀Φi)∈vj. But then, since ⊢Ldm[i](⋀Φi)→⋀Φi by reflexivity, ⊢Ldm⋀i∈Ag(⋀Φi)↔⋀1≤i≤kψi, and ⊢Ldm⋀1≤i≤kψi→⊥, it follows that ⊥∈vj, which is a contradiction since vj is a Ldm-MCS. Therefore, w^j must be consistent and by lemma 1, it may be extended to a Ldm-MCS wj. Since for each [i]ϕ∈uij, ϕ∈wj, we have that w∈Ripres(ui) for each i∈Ag. Hence, w∈⋂1≤i≤nRipres(ui), and so, wj∈⋂1≤i≤nRiLdm(uij). (ii) Suppose that j>0, so that tj∈R□Ldm(sj) iff t∈R□fut(s) = ⋂i∈AgRipres(s). By assumption then, umj∈⋂i∈AgRipres(ukj)=Rifut(ukj) for all k,m∈{1,...,n} and each i∈Ag. Hence, umj∈⋂i∈AgRifut(ukj) for all k,m∈{1,...,n}. If we therefore pick any ukj, it follows that ukj∈⋂i∈AgRifut(uij), meaning that the intersection ⋂1≤i≤nRiLdm(uij) is non-empty.
Follows by definition.
RGLdm is a transitive and serial by definition, and RHLdm is the converse of RGLdm by definition as well.
For all uj,uk,ul∈WLdm, suppose that RGLdmujuk and RGLdmujul. Then, j<k and j<l, and since N is linearly ordered, we have that k<l, k=l, or k>l, implying that RGLdmukul, uk=ul, or RGLdmuluk.
Similar to previous case.
Suppose that (uj,vj+k)∈RGLdm∘R□Ldm with k≥1. By definition of RGLdm, uj+k is the only element in RGLdm(uj) associated with j+k, and so, (uj+k,vj+k)∈R□Ldm (By lemma 2 no other uj+k′ with k′=k can relate to vj+k in R□Ldm.). Since k≥1, vj+k∈R□Ldm(uj+k) iff v∈R□fut(u)=⋂i∈AgRipres(u) iff v0∈RAgLdm(u0). By lemma 3, (uj,vj)∈RAgLdm. This implies that, and since (vj,vj+k)∈RGLdm by definition, we have that (uj,vj+k)∈RAgLdm∘RGLdm.
Follows from the definition of the RGLdm relation.
Last, it is easy to see that the valuation function VLdm is indeed a valuation function.
Lemma 7 (Truth-Lemma)
For any formula ϕ, MLdm,w0⊨ϕ iff ϕ∈w0.
Proof
Shown by induction on the complexity of ϕ (See [3]).
Appendix 0.B G3Xstit Derivation of IOAx Axiom
We make use of the system of rules (IOAX), to derive the Xstit IOA axiom in G3Xstit.
[TABLE]
[TABLE]
[TABLE]