Disjunction Property and Finite Model Property for An Intuitionistic Epistemic Logic
|
|
- Πύθιος Βαμβακάς
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Disjunction Property and Finite Model Property for An Intuitionistic Epistemic Logic Yoichi Hirai March 28, 2010 Abstract We show finite model property, disjunction property and decidability for an intuitionistic epistemic logic IEC. Intuitionistic logic is originally a formalisation of a single mathematician whose knowledge increases over time. The logic IEC formalises multiple agents that communicate asynchronously and whose knowledge increases over time. Although soundness and strong completeness for IEC for a Kripke semantics was straightforward, finite model property and disjunction property required a special technique called modal map on sets of formulas. 1 Introduction This work extends Hirai [1]. Although the definition of logic IEC, soundness and strong completeness are given by Hirai [1], disjunction property and finite model property are new. Intuitionistic Epistemic Logic Agents in asynchronous systems can obtain knowledge about other agents only by receiving some constructions from them, not by waiting for a fixed length of time. This specific style of knowledge, where obtaining knowledge requires obtaining a physical construction, is the same as the style of knowledge of intuitionistic, constructive reasoners. That is the reason why we deliberately choose intuitionistic not classical meanings for the basic logical connectives, especially im- The Department of Computer Science, The University of Tokyo plication and disjunction. The Kripke model for asynchronous communication can be seen as a description of agents passing around constructions that ensure propositions. We extend the language of intuitionistic propositional logic with a unary operator K a, whose meaning can be expressed as: a proof of K a ϕ is a construction that witnesses agent a s acknowledgement of a proof of ϕ and also contains the acknowledged proof. This meaning is different from that of classical epistemic logic where the meaning of K a can be expressed as: K a ϕ is valid if and only if ϕ is valid in all possible worlds that agent a thinks possible. One advantage of our meaning of K a over that of classical meaning is that it can express communication without the help of another modality. Namely, in our meaning, a proof of K b K a P is a construction that is passed from agent a to agent b. On the other hand, in classical meaning, the same formula expresses nothing about communication: K b K a P is valid when P is valid in all possible worlds that agent b in any possible world that agent a thinks possible thinks possible. Intuitionistic logic can be seen as a logic describing an agent whose knowledge increases over time. The logic IEC can be seen as a logic describing multiple agents that asynchronously communicate with each other and increase their knowledge. Although IEC deals with communication, the logic has only epistemic modalities so that it has simpler syntax than many other logics for communication. 1
2 1.1 Preliminaries and Notations We assume inductive definitions using BNF and coinductive definition. P(X) denotes the powerset of X. For a symbol or a sequence of symbols p, p + denotes repetition of p more than zero times and p denotes repetition of p more than or equal to zero times. 2 Definitions and Old Results In this section, we review a logic called intuitionistic epistemic logic proposed by Hirai [1]. The logic has epistemic modality K a in addition to ordinary logical connectives (,,, ) of propositional logic. We explain the meaning of the new modality K a informally, by extending the Brouwer Heyting Kolmogorov interpretation (BHK-interpretation) [3] of logical connectives. 2.1 Formulas We fix a countably infinite set of propositional symbols PVar and a finite set of agents A. Let P, Q,... run over the propositional symbols. Definition 1. We define a formula ϕ by the BNF: ϕ ::= P (K a ϕ) (ϕ ϕ) (ϕ ϕ) (ϕ ϕ) where a A stands for an agent. The unary operators connect more strongly than the binary operators. We sometimes omit the parentheses when no confusion occurs. We use = for syntactic equality of formulas. The notation ( ϕ) stands for (ϕ ). For a sequence of formulas Γ = (ϕ i ) i I or a set of formulas Γ, the notation K a Γ stands for the sequence (K a ϕ i ) i I or the set {K a ϕ ϕ Γ} respectively. 2.2 Informal Explanation by BHK- Interpretation Intuitionistic meanings for logical connectives can be presented as sentences called BHK-interpretation. In this paper, we consider extending BHKinterpretation with another clause for epistemic modality: (HK) A proof of K a ϕ is a construction that witnesses agent a s acknowledgement of a proof of ϕ and also contains the acknowledged proof. We choose to regard knowledge as acknowledgement of proofs so that the modality K a informally describes knowledge of agent a. The formalisation of knowledge is different from that in classical epistemic logic, where knowledge is described as a limitation on the ability to distinguish possible worlds. 2.3 Deduction System We give a proof system of IEC in natural deduction. Most of the rules are common with intuitionistic propositional logic while some rules are added to define the meaning of the K a modality. Definition 2. We define the proof system of IEC by Figure 1. Rationales for the rules on modalities While the rules (T), (ispec) and (nec) are admissible in classical epistemic logic, we have an additional rule ( K) which needs explanation. In this paragraph, we are going to give a rationale for the rule ( K) withthe help of BHK-interpretation given in Section 2.2. A proof for the premise of the rule ( K) is a construction that witnesses agent a s acknowledgement of a proof of ϕ ψ. Since a proof of ϕ ψ is either a proof of ϕ or a proof of psi, agent a s acknowledge of a proof of ϕ ψ implies either agent a s acknowledgement of a proof of ϕ or agent a s acknowledgement of a proof of ψ. Also, we are informally assuming logical omniscience of the agents by rule (nec), that is, we assume agents have complete command on intuitionistic epistemic logic so that they acknowledge every formulas deducible from the set of formulas they acknowledge. We do not try to convince that every conceivable agent has logical omniscience. We only speculate that agents without logical omniscience are hard to represent in a formal system. Notational conventions For a set of formula Γ and a formula ϕ, Γ ϕ denotes a relation where there 2
3 (ax) ϕ ϕ (w) ψ, (c) ϕ, ϕ, Γ,ϕ,ψ, Γ θ ϕ, (e) Γ,ψ,ϕ,Γ θ ( -E 0 ) ψ ( -I) Γ ψ Γ, Γ ϕ ψ ( -E 1 ) ψ Γ ψ Γ ψ 0 ψ 1 Γ,ψ 0 ϕ Γ, ψ 1 ϕ ( -I 0 ) ( -E) ψ ( -I 1 ) Γ ψ ϕ ϕ, Γ ψ Γ ψ 0 ψ 1 Γ ψ 0 ( -I) ( -E) ψ Γ ψ 1 Γ ( -E) (T) Ka ϕ ϕ (ispec) Ka ϕ K a K a ϕ (nec) Ka Γ K a ϕ ( K) Ka (ϕ ψ) K a ϕ K a ψ Figure 1: Deduction rules of IEC. (ax) stands for axiom, (w) for weakening, (c) for contraction, (e) for exchange, (ispec) for introspection and (nec) for necessitation. ( -I) denotes the introduction rule for connective. ( -E) denotes the elimination rule for connective. is such a finite sequence Γ 0 that Γ 0 ϕ is deducible and that Γ 0 contains only formulas in Γ. 2.4 Semantics We define validity of a formula on a state in a model. A model is a Kripke model for propositional intuitionistic logic equipped with an additional mapping f a : W W for each agent a A where W is the set of possible states. Definition 3. A model W,, (f a ) a A,ρ is a tuple with following properties: 1. W, is a partial order, 2. f a : W W is a function satisfying (a) (descendance) f a (w) w, (b) (idempotency) f a (f a (w)) = f a (w), and (c) (monotonicity) w v implies f a (w) f a (v) for all v, w W, 3. ρ: PVar P(W ) is a function such that each ρ(p ) is upward-closed with respect to, i.e., w w ρ(p ) implies w ρ(p ). Definition 4. We define the validity relation = of a model W,, (f a ) a A,ρ, a state w W of the model and a formula ϕ. Let us fix a model M = W,, (f a ) a A,ρ. The definition of M,w = ϕ is inductive on the structure of ϕ. (Case ϕ = ) M,w = never holds. (Case ϕ = P ) M,w = P if and only if w ρ(p ). (Case ϕ = K a ψ) M,w = K a ψ if and only if M,f a (w) = ψ. (Case ϕ = ψ 0 ψ 1 ) M,w = ψ 0 ψ 1 if and only if both M,w = ψ 0 and M,w = ψ 1 hold. (Case ϕ = ψ 0 ψ 1 ) M,w = ψ 0 ψ 1 if and only if either M,w = ψ 0 or M,w = ψ 1 holds. (Case ϕ = ψ 0 ψ 1 ) M,w = ψ 0 ψ 1 if and only if for any w W with w w, the validity M,w = ψ 0 implies the validity M,w = ψ 1. Theorem 5 (Kripke monotonicity). M,w = ϕ and w v imply M,v = ϕ. Proof. By routine structural induction on ϕ. Monotonicity of f a is used. 3
4 Notation 6. For a model M and a state w of the model, we write M,w = Γwhen the validity M,w = ϕ holds for any formula ϕ in Γ. Notation 7. Γ = ϕ stands for the relation of formula sequences Γ and a formula ϕ that holds if and only if for any model M and w M, M,w = Γ implies M,w = ϕ. Definition 8. Γ = ϕ stands for the relation of a set of a formulas Γ and a formula ϕ where M,w = Γ implies M,w = ϕ for any model M and a state w M. For a sequence of formulas Γ, we let u(γ) denote the set of formulas appearing in Γ. We abbreviate u(γ) = ϕ into Γ = ϕ. We will sometimes write Γ instead of u(γ) for the sake of brevity. Theorem 9 (Soundness and strong completeness). Γ = ϕ. Proof. Standard. The proof is in Hirai [1]. 3 Disjunction Property We modify Aczel s slash and prove disjunction property. We referred Troelstra and van Dalen s textbook [3, 3.5] for the proof of disjunction property of intuitionistic propositional logic. The main originality of this paper is the following definition of the function f a we call the modal map. Informally, for a set Γ of formulas, f a (Γ) is agent a s view of the set Γ. Definition 10. For an agent a A, we define two functions g a,f a : P(Fml) P(Fml) as g a (Γ) = {ϕ Fml (K a ) + ϕ Γ and ϕ does not begin with K a }, f a (Γ) = g a (Γ) K a g a (Γ) {ϕ Fml Γ }. Proposition 11. Γ implies g a (Γ) g a ( ). Proof. By the form of definition of g a in Definition 10. Proposition 12. g a ( Γ) = g a ( ) g a (Γ). Proof. By the form of definition of g a in Definition 10. Proposition 13. f a ( Γ) is equal to f a ( ) f a (Γ) provided Γ. Proof. f a ( Γ) = g a ( Γ) K a g a ( Γ) = g a ( ) g a (Γ) K a g a ( ) K a g a (Γ) = f a ( ) f a (Γ). Proposition 14. Γ implies f a (Γ) f a ( ). Proof. If, f a (Γ) Fml = f a ( ). Otherwise, there exists a set Γ with Γ Γ =. Using Proposition 13 suffices. Proposition 15. For any ϕ K a f a (Γ), holds. Proof. ϕ = K a ψ where ψ f a (Γ) = g a (Γ) K a g a (Γ) {ϕ Fml Γ }. (Case ψ g a (Γ)) By definition of g a,(k a ) + ψ Γ. By rule (T), Γ K a ψ. This is what we sought:. (Case ψ K a g a (Γ)) ψ = K a ψ where ψ g a (Γ). By the same argument, Γ K a ψ. By rule (inspec), Γ K a K a ψ. This is what we sought:. (Case Γ ) By rule ( -E), holds. Proposition 16. For any ϕ f a (Γ), holds. Proof. K a ϕ K a f a (Γ). By Proposition 15, Γ K a ϕ holds. By rule (T), deducibility holds. Proposition 17. f a (f a (Γ)) = f a (Γ). Proof. If Γ, by Proposition 16, f a (Γ) also holds. f a (f a (Γ)) = f a (g a (Γ) K a g a (Γ)) (def. of f a ) = f a (g a (Γ)) f a (K a g a (Γ)) (Prop. 13) = f a (Γ) (def. of f a,g a ) = f a (Γ). Otherwise, if Γ, f a (Γ) = Fml = f a (f a (Γ)). 4
5 Definition 18. We define the slash relation as follows: Γ Γ, Γ P Γ P, Γ K a ϕ f a (Γ) ϕ Γ ϕ ψ Γ ϕ and Γ ψ, Γ ϕ ψ Γ ϕ or Γ ψ, Γ ϕ ψ ϕ implies ψ for any Γ and also ψ. Lemma 19. Γ ϕ. Proof. By induction on ϕ. (Case ϕ = )(Case ϕ = P ) By definition of. (Case ϕ = K a ψ) The assumption Γ K a ψ is equivalent to f a (Γ) ψ. By induction hypothesis, f a (Γ) ψ. By rule (nec), K a f a (Γ) K a ψ. By Proposition 15, the deducibility Γ K a ψ holds. (Case ϕ = ψ 0 ψ 1 ) Γ ψ 0 ψ 1. By definition of, Both Γ ψ 0 and Γ ψ 1 hold. By induction hypothesis, both Γ K x ψ 0 and Γ K x ψ 1 hold. By logic, Γ K x (ψ 0 ψ 1 ) holds. (Case ϕ = ψ 0 ψ 1 ) Similar to the case above. (Case ϕ = ψ 0 ψ 1 ) By definition of. Lemma 20. Γ ϕ and Γ imply ϕ. Proof. By induction on ϕ. (Case ϕ = ) (Case ϕ = P ) (Case ϕ = ψ 0 ψ 1 ) By definition of the slash relation. (Case ϕ = ψ 0 ψ 1 ) (Case ϕ = ψ 0 ψ 1 ) Directly from induction hypotheses. (Case ϕ = K a ψ) By Proposition 14, f a (Γ) f a ( ) holds. By induction hypothesis, f a (Γ) ψ implies f a ( ) ψ, which is equivalent to ϕ holds. Lemma 21. For any set Γ of formulas with Γ ψ for all ψ Γ, ϕ g a (Γ) implies f a (Γ) ϕ. Proof. By definition of g a,(k a ) (n) ϕ Γ for some n 1, where (K a ) (n) denotes an n-time repetition of K a s. By assumption, Γ (K a ) (n) ϕ. By definition of, f a (n) (Γ) ϕ. Sincef a is idempotent (Proposition 17), f a (Γ) ϕ. Definition 22. A hereditary f-closed set Γ is coinductively defined as: Γ is a hereditary f-closed set if and only if f a (Γ) is hereditary f-closed and f a (Γ) Γ for all a A. For example, the set Γ = {K b K a K a P } is not hereditary f-closed because f b (Γ) is not hereditary f-closed. f b (Γ) is not hereditary f-closed because K a P f a (f b (Γ)) while K a P / f b (Γ). Lemma 23. For any hereditary f-closed set Γ and aformulaϕ, Γ implies Γ ϕ. Proof. By induction on ϕ. (Case ϕ = ) (Case ϕ = P ) implies Γ ϕ because ϕ is atomic. (Case ϕ = K a ψ) Since f a (Γ) is also hereditary f- closed and inf a (Γ), by induction hypothesis, f a (Γ) ψ. This is equivalent to Γ K a ψ. (Case ϕ = ψ 0 ψ 1 ) (Case ϕ = ψ 0 ψ 1 ) Directly from induction hypothesis. (Case ϕ = ψ 0 ψ 1 ) By rule ( -E), Γ ψ 0 ψ 1. For all Γ, by induction hypothesis, ψ 1 holds. These two facts show ψ 0 ψ 1. Lemma 24. For any hereditary f-closed set Γ of formulas, if Γ ψ for all ψ Γ, f a (Γ) ϕ for all ϕ f a (Γ). Proof. By induction on the structure of ϕ. However, most cases are uniformly treated in the last clause. (Case ϕ = K x ψ) Assume K x ψ f a (Γ) = g a (Γ) K a g a (Γ) {θ Fml Γ }. 5
6 (Case K x ψ g a (Γ)) By Lemma 21, f a (Γ) K x ψ. (Case K x ψ K a g a (Γ)) Note x = a. By Lemma 21, f a (Γ) ψ holds. Since f a is idempotent, f a (f a (Γ)) ψ holds. By definition of, f a (Γ) K a ψ. (Case Γ ) f a (Γ) also holds. By Lemma 23, f a (Γ) ϕ holds. (Other cases) Assume ϕ f a (Γ) = g a (Γ) K a g a (Γ) {θ Fml Γ }. If Γ,by Lemma 23 and definition of f a, f a (Γ) ϕ. Otherwise, since the formula ϕ does not begin with K a, ϕ g a (Γ). By Lemma 21, f a (Γ) ϕ. Lemma 25. Γ K a ϕ Γ ϕ if Γ is f a -closed. Proof. Immediate from Lemma 20. Lemma 26. Γ ψ and Γ {ψ} ϕ imply Γ ϕ. Proof. By induction on ϕ. (Case ϕ = ) (Case ϕ = P ) Since Γ ψ, by Lemma 19, the deducibility Γ ψ holds. Likewise since Γ {ψ} ϕ, thededucibilityγ {ψ} ϕ holds. These combined imply. By definition of the slash relation, the relation Γ ϕ holds because ϕ is atomic. (Case ϕ = ψ 0 ψ 1 ) (Case ϕ = ψ 0 ψ 1 ) Directly from induction hypotheses. (Case ϕ = K a θ) Since Γ {ψ} K a θ, by definition of the slash relation, f a (Γ {ψ}) θ holds. If Γ {ψ}, by the assumption, Γ. Thus, by Lemma 23, holds. Otherwise, since f a (Γ {ψ}) =f a (Γ) f a ({ψ}), we have f a (Γ) f a ({ψ}) θ. If ψ = K a ψ,γ ψ is equivalent to f a (Γ) ψ. By induction hypothesis, f a (Γ) θ. This is equivalent to f a (Γ) K a θ. This is what we sought: f a (Γ) ϕ. Otherwise, if ψ does not begin with K a, f a ({ψ}) =. Thus, f a (Γ) θ. This means Γ K a θ. (Case ϕ = ψ 0 ψ 1 ) Since Γ {ψ} ψ 0 ψ 1,by Lemma 19, Γ {ψ} ψ 0 ψ 1 holds. In addition to this, {ψ} ψ 0 implies {ψ} ψ 1 for any Γ. We claim that ψ 0 implies ψ 1 for any Γ. To show that, we assume ψ 0.By Lemma 20, {ψ} ψ 0 holds. By assumption, {ψ} ψ 1 holds. By induction hypothesis, ψ 1 holds. We have shown that ψ 0 implies ψ 1. In addition to this, by Γ ψ and Γ {ψ} ψ 0 ψ 1,thededucibilityΓ ψ 0 ψ 1 holds. The slash relation Γ ψ 0 ψ 1 has been proved. Lemma 27. If Γ and are provably equivalent and satisfy f a (Γ) = f a ( ) for all a A, Γ ϕ is equivalent to ϕ. Proof. By the form of the definition of the slash relation. Theorem 28. For any hereditary f-closed set Γ of formulas, if Γ ϕ holds for any ϕ Γ, implies Γ ϕ. Proof. By induction on definition of. (ax) (w) (c) (e) Trivial. ( -E i )( -I) ( -I i ) By definition of the slash relation. ( -E) ( -I) Γ ψ 0 ψ 1 Γ,ψ 0 ϕ Γ, ψ 1 ϕ By an induction hypothesis, Γ ψ 0 ψ 1 holds. By definition of the slash relation, either Γ ψ 0 or Γ ψ 1 holds. (Case Γ ψ 0 ) By another induction hypothesis, Γ {ψ 0 } ϕ holds. By Lemma 26, Γ ϕ holds. (Case Γ ψ 1 ) Similar. ϕ, Γ ψ ψ 6
7 By induction hypothesis, ϕ Γ ψ holds. Thus for any Γ, ϕ ψ holds. ϕ implies ψ by Lemma 26. This fact and the deducibility ψ imply Γ ϕ ψ. ( -E) Γ ψ 0 ψ 1 Γ ψ 0 Γ ψ 1 By induction hypothesis, Γ ψ 0 ψ 1 holds. By definition of the slash relation, Γ ψ 0 implies Γ ψ 1. Actually, Γ ψ 0 holds by an induction hypothesis. Thus, Γ ψ 1 holds. ( -E) By Lemma 23. (T) K a ϕ ϕ Assume K a ϕ Γ. By assumption of the theorem, Γ K a ϕ.sinceγisf a -closed, by Lemma 25, Γ ϕ. (nec) ( K) ϕ K a K a ϕ We can assume K a Γ and that ϕ Γimplies Γ ϕ. Also, by induction hypothesis, any Γ with Γ and ψ Γ Γ ψ, Γ ϕ holds. Since is a finite sequence, there exists a natural number n with f a (Γ) K a f a (Γ) (K a ) (n) f a (Γ). By induction hypothesis, f a (Γ) K a f a (Γ) (K a ) (n) f a (Γ) ϕ holds. By Lemma 27, this is equivalent to f a (Γ) ϕ. By definition of, Γ K a ϕ holds. K a (ϕ ψ) (K a ϕ) K a ψ Γ K a (ϕ ψ) f a (Γ) ϕ ψ f a (Γ) ϕ or f a (Γ) ψ Γ K a ϕ or Γ K a ψ Γ K a ϕ K a ψ Using the apparatus prepared above, we can finally show disjunction property, which is the standard for constructive logic. Theorem 29 (Disjunction property). If ϕ ψ holds, either ϕ or ψ holds. Proof. Taking Γ = in Theorem 28, ϕ ψ implies ϕ or ψ. By Lemma 19, either ϕ or ψ holds. 4 Finite Model Property This model construction below inspired by Sato s paper [2] and Troelstra and van Dalen s textbook [3]. However, the notion of f -subformula-closed sets is new and original. Definition 30. We modify f a introduced in the last section (Definition 10) and define f a as: f a(γ) = g a (Γ) K a g a (Γ). Definition 31. For a set of formulas Ω, a set of formulas Γ Ω is Ω-saturated if and only if 1. Γ is Ω-deductively closed, i.e., Ω ϕ Γ, 2. ψ or Γ ψ if ϕ, ψ Ω, 3. Γ. Definition 32. A hereditary f -subformula-closed set Γ is coinductively defined as: Γ is a hereditary f -subformula-closed set if and only if f a(γ) is hereditary f -closed, Γ is closed for taking subformulas and f a(γ) Γ. Definition 33. We define s a (ϕ) inductively on ϕ: s a (ϕ) = s a (K a ψ) ϕ (if ϕ = K a K a ψ), (otherwise). The function s a replaces every K a K a with K a repeatedly so that there are no K a K a occurrences left. Lemma 34. For a hereditary f -subformula-closed set Ω, ifγ is an Ω-saturated set, f a (Γ) is an f a(ω)- saturated set. 7
8 Proof. We first make sure that f a (Γ) is a subset of f a(ω). By definition of f a, f a (Γ) = g a (Γ) K a g a (Γ) { Fml Γ }. Since Γ is an Ω-saturated set, Γ so that f a (Γ) = g a (Γ) K a g a (Γ). On the other hand, f a(ω) = g a (Ω) K a g a (Ω). Since g a (Γ) g a (Ω) by Proposition 11, f a (Γ) f a(ω) holds. We check each condition of Definition 31 to make sure that f a (Γ) is actually an f a(ω)-saturated set. 1. Assume f a (Γ) ϕ and ϕ f a(ω). ϕ g a (Ω) K a g a (Ω) holds. (Case ϕ g a (Ω)) Note that ϕ does not begin with K a. By definition of g a,(k a ) + ϕ Ω. Since Ω is subformula-closed, K a ϕ Ω holds. By Γ K a ϕ, since Γ is Ω-saturated, K a ϕ Γ. Thus, ϕ f a (Γ). (Case ϕ K a g a (Ω)) ϕ = K a ϕ and ϕ g a (Ω) hold. Note that ϕ does not begin with K a. By definition of g a,(k a ) + ϕ Ω. This implies K a ϕ Ω. Since Γ K a K a ϕ, Γ K a ϕ holds. Thus, since Γ is Ω- saturated, K a ϕ Γ holds. This means ϕ = K a ϕ f a (Γ). 2. Assume f a (Γ) ϕ ψ and ϕ, ψ f a(ω). By rule (nec), K a f a (Γ) K a (ϕ ψ) holds. By Proposition 15, the formulas in K a f a (Γ) are deducible from Γ. Thus, Γ K a (ϕ ψ) holds. By rule ( K) and the fact that Γ is saturated, either K a s a (ϕ) Γ or K a s a (ψ) Γ holds. We can assume K a s a (ϕ) Γ without loss of generality. This implies f a (Γ) ϕ and then ϕ f a (Γ). 3. Seeking contradiction, assume f a (Γ).Since Γ K a,thededucibilityγ holds, which contradicts the fact that Γ is an Ω-saturated set. Lemma 35 (Saturation lemma). For sets of formulas Γ and Ω with, Γ Ω and ϕ Ω, there exists an Ω-saturated set Γ ω with Γ ω ϕ and Γ Γ ω. Proof. Since both PVar and A are countable, we can enumerate all formulas of Ω in a sequence (ϕ i ) i N +. We define Γ i inductively: (Case i =0) Γ 0 = Γ, (Case i>0) {ϕ i } Γ i 1 (if {ϕ i } Γ i 1 ϕ), Γ i = Γ i 1 {ϕ i ϕ} (o.w. if ϕ i ϕ Ω), Γ i 1 (o.w.). Using these Γ i,wedefineγ ω = i ω Γi. Claim: Γ ω ϕ. Seeking contradiction, assume a deducibility Γ ω ϕ. Since only finite number of formulas in Γ are used to prove ϕ, there exists a minimal i with Γ i ϕ. SinceΓ ϕ, i is not 0. Since Γ i =Γ i 1, either Γ i = {ϕ i } Γ i 1 or Γ i = {ϕ i ϕ} Γ i 1 holds. The first case is explicitly forbidden. In the second case, Γ i 1,ϕ i ϕ ϕ holds. That means Γ i 1 (ϕ i ϕ) ϕ. Also, since we could not take the first case, Γ i 1,ϕ i ϕ holds. That means Γ i 1 ϕ i ϕ. By these combined, Γ i 1 ϕ holds, which contradicts to the minimality of i. The claim is now proved. Claim: Γ ω is an Ω-saturated set. Proof of Claim. We check each condition listed in Definition 31: 1. Assume Γ ω ψ Ω. There is i N + with ϕ i = ψ. We know that Γ i 1 {ϕ i } ϕ. It means ψ Γ ω. 2. Assume ψ 0 ψ 1 Γ ω and ψ 0,ψ 1 Ω. Seeking contradiction, assume ψ 0 / Γ ω and ψ 1 / Γ ω. By construction, both Γ ω ψ 0 ϕ and Γ ω ψ 1 ϕ hold. Since Γ ω is deductively closed, by ( -E) rule, we have Γ ω ϕ, which contradicts to the previous fact. 3. Since Γ ω ϕ, byrule( -E), Γ ω. Since Γ 0 = Γ, Γ ω contains Γ. The lemma is now proved. Definition 36 (Canonical model candidate). For a set of formulas Ω, we define M c (Ω) as a tuple W c, c, (f c a ) a A,ρ c where: W c is the set of pairs of the form (Ω, Γ) where Γ is an Ω -saturated set and Ω is a hereditary f -subformula-closed subset of Ω. 8
9 (Ω, Γ) c (Ω, ) if and only if Ω Ω and Γ, f c a ((Ω, Γ)) = (f a(ω),f a (Γ)) ρ c (P )={(Ω, Γ) W c P Γ}. Lemma 37 (Canonical model). The tuple M c is a model. Proof. First of all, f c a is actually a function W c W c by Lemma 34. We check each condition in Definition 3 to make sure the tuple is actually a model: 1. c is a partial order because set theoretic inclusion is a partial order. 2. (a) f c a ((Ω, Γ)) = (f a(ω ),f a (Γ)). Since Ω is hereditary f -subset-closed, f a(ω ) Ω holds. Now, showing Γ f a (Γ) is enough. Take an arbitrary ϕ f a (Γ). Since Γ, either ϕ g a (Γ) or ϕ K a g a (Γ) holds. In either case, (K a ) ϕ Γ holds. That means. Sinceϕ Ω, ϕ Γ holds. Thus we have shown Γ f a (Γ). This completes the proof of f c a ((Ω, Γ)) c (Ω, Γ). (b) By Lemma 17, f a (f a (Γ)) = f a (Γ) holds. Similar argument gives f a(f a(ω )) = f a(ω ). These combined imply that f c a is idempotent. (c) Both f a and f a are monotonic with respect to set theoretic inclusion. This implies that f c a is monotonic with respect to c. 3. Immediate. Lemma 38. For a state (Ω, Γ) W c in the canonical model M c and ϕ Ω, ϕ is an element of Γ if and only if M c,(ω, Γ) = ϕ holds. Proof. By induction on ϕ. (Case ϕ = ) Neither side ever holds because Γ is Ω -saturated. (Case ϕ = P ) By definition of ρ c and =, the equivalency ϕ Γ (Ω, Γ) ρ(p ) M c, (Ω, Γ) = P holds. (Case ϕ = ψ 0 ψ 1 )(Case ϕ = ψ 0 ψ 1 ) Directly from the induction hypothesis. (Case ϕ = K a ψ) ( ) Assume M c (Ω), (Ω, Γ) = K a ψ. By definition of = and induction hypothesis, ψ f a (Γ) = g a (Γ) K a g a (Γ). If ψ g a (Γ), (K a ) + ψ Γ holds. This means Γ K a ψ. Otherwise, if ψ K a g a (Γ), ψ = K a ψ where ψ g a (Γ). This means Γ K a ψ and consequently Γ K a ψ. In either case Γ K a ψ holds. Also by the assumption of the lemma, K a ψ Ω. These imply K a ψ Γ because Γ is an Ω -saturated set. ( ) Assume K a Γ. There exists ψ that does not begin with K a such that ψ =(K a ) ψ. By definition of f a, ψ f a (Γ). By induction hypothesis, (fa(ω ),f a (Γ)) = ψ. This is equivalent to M c (Ω), (Ω, Γ) = K a ψ. Since f c a is idempotent, M c (Ω), (Ω, Γ) = K a ψ. (Case ϕ = ψ 0 ψ 1 ) ( ) Assume M c (Ω), (Ω, Γ) = ψ 0 ψ 1. Seeking contradiction, assume ψ 0 ψ 1 / Γ. Since Γ is deductively closed, Γ {ψ 0 } ψ 1. By Lemma 35, there exists an Ω -saturated set Γ with Γ Γ {ψ 0 } and Γ ψ 1.Byinduction hypothesis, M c (Ω), (Ω, Γ ) = ψ 0 but not M c (Ω), (Ω, Γ ) = ψ 1. Since (Ω, Γ ) (Ω, Γ), this contradicts to M c (Ω), Γ = ψ 0 ψ 1. ( ) For an Ω -saturated set Γ, assume ψ 0 ψ 1 Γ. Take a state (Ω, ) with (Ω, Γ) c (Ω, ) and M c (Ω), (Ω, ) = ψ 0. Showing M c (Ω), (Ω, ) = ψ 1 is enough. By induction hypothesis, ψ 0. Since ψ 0 ψ 1 Γ and is an Ω -saturated set, ψ 1. By induction hypothesis, M c (Ω), (Ω, ) = ψ 1 holds. Definition 39. We define the length of a formula ϕ inductively on ϕ: len( ) =len(p )=1, len(k a ϕ)=len(ϕ)+1, len(ϕ ψ) =len(ϕ)+len(ψ)+1, len(ϕ ψ) =len(ϕ)+len(ψ)+1, len(ϕ ψ) =len(ϕ)+len(ψ)+1. 9
10 Notation 40. We denote a set of formulas which only contain the propositional variables in V PVar as Fml V. Lemma 41. For a set of propositional variables V Fml, the length-limited set of formulas Γ n = {ϕ Fml V len(ϕ) n} is hereditary f -subformulaclosed. Proof. By induction on n, we show a stronger proposition: both Γ n and Γ n K a Γ n are hereditary f - subformula-closed for any a A. (Case n =0) Since Γ 0 =, Γ 0 K a Γ 0 =. Both are hereditary f -subformula-closed. (Case n = n 0 +1) By definition of Γ n and the definition of subformula, Γ n is subformula-closed set. For any a A, since g a (Γ n ) = Γ n0, fa(γ) = Γ n0 K a Γ n0 Γ n holds. Thus, by induction hypothesis, fa(γ) is a hereditary f - subformula-closed set. These facts imply Γ n is a hereditary f -subformula-closed set. We also show Γ n K b Γ n is a hereditary f - subformula-closed set. Since Γ n K b Γ n is subformula-closed, we only have to check that f c(γ n K b Γ n )isf -subformula-closed. (Case c = b) f c(γ n K b Γ n )=f c(γ n ), which is shown to be a hereditary f -subformulaclosed set. (Case c = b) f c(γ n K b Γ n ) = f c(f c(γ n )) = f c(γ n ), which is shown to be a hereditary f -subformula-closed set. Theorem 42 (Finite model property). If ϕ is not a theorem of IEC, there is a finite model M with M = ϕ. finite, the model M c (Ω) is finite. In fact, the number of the states of M c (Ω) is at most 4 Ω. Theorem 43. It is decidable whether a formula ϕ is a theorem of IEC or not. Proof. Since both proofs and finite models are recursively enumerable, the set of theorems and its complement are both recursively enumerable. 5 Conclusion We proved disjunction property and finite model property for an intuitionistic modal logic called intuitionistic epistemic logic (IEC for short). Disjunction property ensures that the intuitionistic epistemic logic is a constructive logic. Finite model property tells us it is unnecessary to consider non well-founded models, which does not seem to model any computation. References [1] Y. Hirai. An intuitionistic epistemic logic for sequential consistency on shared memory. accepted to LPAR-16, [2] M. Sato. A study of Kripke-type models for some modal logics by Gentzen s sequential method. Publications of the research institute for mathematical sciences, 13:381, [3] A.S. Troelstra and D. van Dalen. Constructivism in Mathematics: An Introduction: Vol.: 1. North-Holland, Proof. Since a formula ϕ is finitary, it contains only a finite number of propositional variables. Let V be the set of propositional variables occurring in ϕ. The set Ω = {ψ Fml V len(ψ) len(ϕ)} is finite and hereditary f -subformula-closed by Lemma 41. By Lemma 35, there exist an Ω-saturated set Γ with ϕ/ Γ. By Lemma 38, M c (Ω), (Ω, Γ) = ϕ. SinceΩis 10
Lecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότεραSequent Calculi for the Modal µ-calculus over S5. Luca Alberucci, University of Berne. Logic Colloquium Berne, July 4th 2008
Sequent Calculi for the Modal µ-calculus over S5 Luca Alberucci, University of Berne Logic Colloquium Berne, July 4th 2008 Introduction Koz: Axiomatisation for the modal µ-calculus over K Axioms: All classical
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραMINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS
MINIMAL CLOSED SETS AND MAXIMAL CLOSED SETS FUMIE NAKAOKA AND NOBUYUKI ODA Received 20 December 2005; Revised 28 May 2006; Accepted 6 August 2006 Some properties of minimal closed sets and maximal closed
Διαβάστε περισσότεραHomomorphism in Intuitionistic Fuzzy Automata
International Journal of Fuzzy Mathematics Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 39-45 Research India Publications http://www.ripublication.com/ijfms.htm Homomorphism in Intuitionistic
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότεραA Note on Intuitionistic Fuzzy. Equivalence Relation
International Mathematical Forum, 5, 2010, no. 67, 3301-3307 A Note on Intuitionistic Fuzzy Equivalence Relation D. K. Basnet Dept. of Mathematics, Assam University Silchar-788011, Assam, India dkbasnet@rediffmail.com
Διαβάστε περισσότεραORDINAL ARITHMETIC JULIAN J. SCHLÖDER
ORDINAL ARITHMETIC JULIAN J. SCHLÖDER Abstract. We define ordinal arithmetic and show laws of Left- Monotonicity, Associativity, Distributivity, some minor related properties and the Cantor Normal Form.
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραLTL to Buchi. Overview. Buchi Model Checking LTL Translating LTL into Buchi. Ralf Huuck. Buchi Automata. Example
Overview LTL to Buchi Buchi Model Checking LTL Translating LTL into Buchi Ralf Huuck Buchi Automata Example Automaton which accepts infinite traces δ A Buchi automaton is 5-tuple Σ, Q, Q 0,δ, F Σ is a
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραCongruence Classes of Invertible Matrices of Order 3 over F 2
International Journal of Algebra, Vol. 8, 24, no. 5, 239-246 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/.2988/ija.24.422 Congruence Classes of Invertible Matrices of Order 3 over F 2 Ligong An and
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραChapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Διαβάστε περισσότερα2. Let H 1 and H 2 be Hilbert spaces and let T : H 1 H 2 be a bounded linear operator. Prove that [T (H 1 )] = N (T ). (6p)
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 2005-03-08 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότεραCommutative Monoids in Intuitionistic Fuzzy Sets
Commutative Monoids in Intuitionistic Fuzzy Sets S K Mala #1, Dr. MM Shanmugapriya *2 1 PhD Scholar in Mathematics, Karpagam University, Coimbatore, Tamilnadu- 641021 Assistant Professor of Mathematics,
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραProblem Set 3: Solutions
CMPSCI 69GG Applied Information Theory Fall 006 Problem Set 3: Solutions. [Cover and Thomas 7.] a Define the following notation, C I p xx; Y max X; Y C I p xx; Ỹ max I X; Ỹ We would like to show that C
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραLecture 15 - Root System Axiomatics
Lecture 15 - Root System Axiomatics Nov 1, 01 In this lecture we examine root systems from an axiomatic point of view. 1 Reflections If v R n, then it determines a hyperplane, denoted P v, through the
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραλρ-calculus 1. each λ-variable is a λρ-term, called an atom or atomic term; 2. if M and N are λρ-term then (MN) is a λρ-term called an application;
λρ-calculus Yuichi Komori komori@math.s.chiba-u.ac.jp Department of Mathematics, Faculty of Sciences, Chiba University Arato Cho aratoc@g.math.s.chiba-u.ac.jp Department of Mathematics, Faculty of Sciences,
Διαβάστε περισσότεραSOME PROPERTIES OF FUZZY REAL NUMBERS
Sahand Communications in Mathematical Analysis (SCMA) Vol. 3 No. 1 (2016), 21-27 http://scma.maragheh.ac.ir SOME PROPERTIES OF FUZZY REAL NUMBERS BAYAZ DARABY 1 AND JAVAD JAFARI 2 Abstract. In the mathematical
Διαβάστε περισσότεραω ω ω ω ω ω+2 ω ω+2 + ω ω ω ω+2 + ω ω+1 ω ω+2 2 ω ω ω ω ω ω ω ω+1 ω ω2 ω ω2 + ω ω ω2 + ω ω ω ω2 + ω ω+1 ω ω2 + ω ω+1 + ω ω ω ω2 + ω
0 1 2 3 4 5 6 ω ω + 1 ω + 2 ω + 3 ω + 4 ω2 ω2 + 1 ω2 + 2 ω2 + 3 ω3 ω3 + 1 ω3 + 2 ω4 ω4 + 1 ω5 ω 2 ω 2 + 1 ω 2 + 2 ω 2 + ω ω 2 + ω + 1 ω 2 + ω2 ω 2 2 ω 2 2 + 1 ω 2 2 + ω ω 2 3 ω 3 ω 3 + 1 ω 3 + ω ω 3 +
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραHomomorphism of Intuitionistic Fuzzy Groups
International Mathematical Forum, Vol. 6, 20, no. 64, 369-378 Homomorphism o Intuitionistic Fuzz Groups P. K. Sharma Department o Mathematics, D..V. College Jalandhar Cit, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότεραAbout these lecture notes. Simply Typed λ-calculus. Types
About these lecture notes Simply Typed λ-calculus Akim Demaille akim@lrde.epita.fr EPITA École Pour l Informatique et les Techniques Avancées Many of these slides are largely inspired from Andrew D. Ker
Διαβάστε περισσότεραA Conception of Inductive Logic: Example
A Conception of Inductive Logic: Example Patrick Maher Department of Philosophy, University of Illinois at Urbana-Champaign This paper presents a simple example of inductive logic done according to the
Διαβάστε περισσότεραBounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραOn density of old sets in Prikry type extensions.
On density of old sets in Prikry type extensions. Moti Gitik December 31, 2015 Abstract Every set of ordinals of cardinality κ in a Prikry extension with a measure over κ contains an old set of arbitrary
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραOn a four-dimensional hyperbolic manifold with finite volume
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Numbers 2(72) 3(73), 2013, Pages 80 89 ISSN 1024 7696 On a four-dimensional hyperbolic manifold with finite volume I.S.Gutsul Abstract. In
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραSCITECH Volume 13, Issue 2 RESEARCH ORGANISATION Published online: March 29, 2018
Journal of rogressive Research in Mathematics(JRM) ISSN: 2395-028 SCITECH Volume 3, Issue 2 RESEARCH ORGANISATION ublished online: March 29, 208 Journal of rogressive Research in Mathematics www.scitecresearch.com/journals
Διαβάστε περισσότεραFinite Field Problems: Solutions
Finite Field Problems: Solutions 1. Let f = x 2 +1 Z 11 [x] and let F = Z 11 [x]/(f), a field. Let Solution: F =11 2 = 121, so F = 121 1 = 120. The possible orders are the divisors of 120. Solution: The
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότεραMath 446 Homework 3 Solutions. (1). (i): Reverse triangle inequality for metrics: Let (X, d) be a metric space and let x, y, z X.
Math 446 Homework 3 Solutions. (1). (i): Reverse triangle inequalit for metrics: Let (X, d) be a metric space and let x,, z X. Prove that d(x, z) d(, z) d(x, ). (ii): Reverse triangle inequalit for norms:
Διαβάστε περισσότεραTHE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS. Daniel A. Romano
235 Kragujevac J. Math. 30 (2007) 235 242. THE SECOND ISOMORPHISM THEOREM ON ORDERED SET UNDER ANTIORDERS Daniel A. Romano Department of Mathematics and Informatics, Banja Luka University, Mladena Stojanovića
Διαβάστε περισσότεραPartial Differential Equations in Biology The boundary element method. March 26, 2013
The boundary element method March 26, 203 Introduction and notation The problem: u = f in D R d u = ϕ in Γ D u n = g on Γ N, where D = Γ D Γ N, Γ D Γ N = (possibly, Γ D = [Neumann problem] or Γ N = [Dirichlet
Διαβάστε περισσότεραGenerating Set of the Complete Semigroups of Binary Relations
Applied Mathematics 06 7 98-07 Published Online January 06 in SciRes http://wwwscirporg/journal/am http://dxdoiorg/036/am067009 Generating Set of the Complete Semigroups of Binary Relations Yasha iasamidze
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραAbstract Storage Devices
Abstract Storage Devices Robert König Ueli Maurer Stefano Tessaro SOFSEM 2009 January 27, 2009 Outline 1. Motivation: Storage Devices 2. Abstract Storage Devices (ASD s) 3. Reducibility 4. Factoring ASD
Διαβάστε περισσότεραCompleteness Theorem for System AS1
11 The Completeness Theorem for System AS1 1. Introduction...2 2. Previous Definitions...2 3. Deductive Consistency...2 4. Maximal Consistent Sets...5 5. Lindenbaum s Lemma...6 6. Every Maximal Consistent
Διαβάστε περισσότεραSolutions to Exercise Sheet 5
Solutions to Eercise Sheet 5 jacques@ucsd.edu. Let X and Y be random variables with joint pdf f(, y) = 3y( + y) where and y. Determine each of the following probabilities. Solutions. a. P (X ). b. P (X
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότερα5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραk A = [k, k]( )[a 1, a 2 ] = [ka 1,ka 2 ] 4For the division of two intervals of confidence in R +
Chapter 3. Fuzzy Arithmetic 3- Fuzzy arithmetic: ~Addition(+) and subtraction (-): Let A = [a and B = [b, b in R If x [a and y [b, b than x+y [a +b +b Symbolically,we write A(+)B = [a (+)[b, b = [a +b
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραMain source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1
Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a
Διαβάστε περισσότεραFinitary proof systems for Kozen s µ
Finitary proof systems for Kozen s µ Bahareh Afshari Graham Leigh TU Wien University of Gothenburg homc & cdps 16, Singapore 1 / 17 Modal µ-calculus Syntax: p p φ ψ φ ψ φ φ x µx φ νx φ Semantics: For Kripke
Διαβάστε περισσότεραOverview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
Διαβάστε περισσότεραIntuitionistic Fuzzy Ideals of Near Rings
International Mathematical Forum, Vol. 7, 202, no. 6, 769-776 Intuitionistic Fuzzy Ideals of Near Rings P. K. Sharma P.G. Department of Mathematics D.A.V. College Jalandhar city, Punjab, India pksharma@davjalandhar.com
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραSome new generalized topologies via hereditary classes. Key Words:hereditary generalized topological space, A κ(h,µ)-sets, κµ -topology.
Bol. Soc. Paran. Mat. (3s.) v. 30 2 (2012): 71 77. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.v30i2.13793 Some new generalized topologies via hereditary
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραb. Use the parametrization from (a) to compute the area of S a as S a ds. Be sure to substitute for ds!
MTH U341 urface Integrals, tokes theorem, the divergence theorem To be turned in Wed., Dec. 1. 1. Let be the sphere of radius a, x 2 + y 2 + z 2 a 2. a. Use spherical coordinates (with ρ a) to parametrize.
Διαβάστε περισσότερα1. Introduction and Preliminaries.
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:1 (2008), 97 106 ON δ SETS IN γ SPACES V. Renuka Devi and D. Sivaraj Abstract We
Διαβάστε περισσότεραΜηχανική Μάθηση Hypothesis Testing
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραPotential Dividers. 46 minutes. 46 marks. Page 1 of 11
Potential Dividers 46 minutes 46 marks Page 1 of 11 Q1. In the circuit shown in the figure below, the battery, of negligible internal resistance, has an emf of 30 V. The pd across the lamp is 6.0 V and
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραTridiagonal matrices. Gérard MEURANT. October, 2008
Tridiagonal matrices Gérard MEURANT October, 2008 1 Similarity 2 Cholesy factorizations 3 Eigenvalues 4 Inverse Similarity Let α 1 ω 1 β 1 α 2 ω 2 T =......... β 2 α 1 ω 1 β 1 α and β i ω i, i = 1,...,
Διαβάστε περισσότεραLecture 13 - Root Space Decomposition II
Lecture 13 - Root Space Decomposition II October 18, 2012 1 Review First let us recall the situation. Let g be a simple algebra, with maximal toral subalgebra h (which we are calling a CSA, or Cartan Subalgebra).
Διαβάστε περισσότερα12. Radon-Nikodym Theorem
Tutorial 12: Radon-Nikodym Theorem 1 12. Radon-Nikodym Theorem In the following, (Ω, F) is an arbitrary measurable space. Definition 96 Let μ and ν be two (possibly complex) measures on (Ω, F). We say
Διαβάστε περισσότεραJesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
Διαβάστε περισσότεραforms This gives Remark 1. How to remember the above formulas: Substituting these into the equation we obtain with
Week 03: C lassification of S econd- Order L inear Equations In last week s lectures we have illustrated how to obtain the general solutions of first order PDEs using the method of characteristics. We
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραLAP 2013 Problems in formulating the consecution calculus of contraction less relevant logics
LAP 2013 Problems in formulating the consecution calculus of contraction less relevant logics Mirjana Ilić, Branislav Boričić Faculty of Economics, Belgrade, Serbia mirjanailic@ekof.bg.ac.rs boricic@ekof.bg.ac.rs
Διαβάστε περισσότεραParametrized Surfaces
Parametrized Surfaces Recall from our unit on vector-valued functions at the beginning of the semester that an R 3 -valued function c(t) in one parameter is a mapping of the form c : I R 3 where I is some
Διαβάστε περισσότεραStrukturalna poprawność argumentu.
Strukturalna poprawność argumentu. Marcin Selinger Uniwersytet Wrocławski Katedra Logiki i Metodologii Nauk marcisel@uni.wroc.pl Table of contents: 1. Definition of argument and further notions. 2. Operations
Διαβάστε περισσότεραDémographie spatiale/spatial Demography
ΠΑΝΕΠΙΣΤΗΜΙΟ ΘΕΣΣΑΛΙΑΣ Démographie spatiale/spatial Demography Session 1: Introduction to spatial demography Basic concepts Michail Agorastakis Department of Planning & Regional Development Άδειες Χρήσης
Διαβάστε περισσότεραPartial Trace and Partial Transpose
Partial Trace and Partial Transpose by José Luis Gómez-Muñoz http://homepage.cem.itesm.mx/lgomez/quantum/ jose.luis.gomez@itesm.mx This document is based on suggestions by Anirban Das Introduction This
Διαβάστε περισσότεραTMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
Διαβάστε περισσότεραMath 6 SL Probability Distributions Practice Test Mark Scheme
Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry
Διαβάστε περισσότερα5.4 The Poisson Distribution.
The worst thing you can do about a situation is nothing. Sr. O Shea Jackson 5.4 The Poisson Distribution. Description of the Poisson Distribution Discrete probability distribution. The random variable
Διαβάστε περισσότεραCardinals. Y = n Y n. Define h: X Y by f(x) if x X n X n+1 and n is even h(x) = g
Cardinals 1. Introduction to Cardinals We work in the base theory ZF. The definitions and many (but not all) of the basic theorems do not require AC; we will indicate explicitly when we are using choice.
Διαβάστε περισσότεραD Alembert s Solution to the Wave Equation
D Alembert s Solution to the Wave Equation MATH 467 Partial Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Objectives In this lesson we will learn: a change of variable technique
Διαβάστε περισσότερα