Simulating non-prenex cuts in quantified propositional calculus
|
|
- Άμωσις Μάγκας
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Simulating non-prenex cuts in quantified propositional calculus Emil Jeřábek Phuong Nguyen May 2, 2011 Abstract We show that the quantified propositional proof systems G i are polynomially equivalent to their restricted versions that require all cut formulas to be prenex Σ q i (or prenex Π q i ). Previously this was known only for the treelike systems G i. 1 Introduction The quantified propositional sequent calculus G and its subsystems G i and G i were introduced in [4, 5, 3]. The systems G i and G i were slightly redefined in [1] so that they can prove all quantified propositional tautologies. Under the new definition some subtle but interesting issues arise when we look at G i -proofs of tautologies that are not in Σ q i Πq i. For example, can the target formulas be restricted to be the constants, without increasing the size of the proofs by more than a polynomial factor? Another question is whether the cut formulas can be restricted to be prenex formulas. More precisely, G i is defined so that it allows cuts on Σ q i Πq i -formulas, where these classes have a fairly permissive definition (e.g., they are closed under and ). Morioka [6] (cf. [2, Thm. VII.4.7]) has shown that in the case of the treelike fragments G i, we can restrict cut formulas to prenex Σq i, up to polynomial simulation. The purpose of this note is to generalize this result to daglike G i and thus answer the second question above, see Theorem 2.3 below. Morioka proves his result essentially by transforming the given G i -proof so that all cut formulas and their ancestors become prenex. More precisely, quantifiers inside each cut formula are successively moved outward by standard prenexation rules, and these changes are propagated to its ancestors up to the point where the quantifier is introduced. For this transformation the assumption that the proof is treelike is crucial. In particular, it is not directly applicable to the case of daglike proofs, because here a sequent may be used in Institute of Mathematics of the Academy of Sciences, Žitná 25, Praha 1, Czech Republic, jerabek@math.cas.cz, URL: Supported by Institutional Research Plan AV0Z , grant IAA of GA AV ČR, project 1M0545 of MŠMT ČR, and a grant from the John Templeton Foundation. School of Computer Science, McGill University, 3480 University Street, Montreal, Quebec, Canada H3A 2A7, pnguyen@cs.toronto.edu, URL: Supported by an NSERC Postdoctoral Fellowship. 1
2 several different inferences, and so modifying a formula of a sequent S that is used as a cut formula may invalidate other inferences that involve S. In order to make it work for daglike proofs, we perform instead a uniform global transformation of the whole proof: we modify every sequent in π by replacing each Σ q i Πq i formula ψ by a prenex Σ q i formula ψ, which is a prenex form of either ψ or ψ (depending on ψ and where it appears antecedent or succedent.) Note that we do not modify Σ q i Πq i subformulas of other formulas in π. The main task now is to show that the transformed sequents can be augmented to a valid proof of ϕ, which boils down essentially to providing short G i -proofs of the equivalence of a Σ q i (or Πq i ) formula to its prenex forms. This turns out to be rather technically involved, and it is the main contribution of this paper. 2 Definitions We refer to [3, 2] for basic definitions of quantified propositional formulas (or just formulas) and the sequent calculus G. In short, a G-proof of a sequent S is a sequence of sequents S 1, S 2,..., S m where S m = S, and each S k follows from some of the sequents S k, k < k, by an inference rule. The proof is said to be treelike if every S l is used exactly once to derive another S k (where k > l). (Generally proofs are daglike.) The rules of G are listed below: initial rule: i ϕ ϕ weakening rules: w-l Γ ϕ, Γ Γ w-r Γ, ϕ exchange rules: x-l Γ 1, ϕ, ψ, Γ 2 Γ 1, ψ, ϕ, Γ 2 Γ 1, ϕ, ψ, 2 x-r Γ 1, ψ, ϕ, 2 contraction rules: c-l Γ, ϕ, ϕ Γ, ϕ Γ, ϕ, ϕ c-r Γ, ϕ constant introduction rules: -l -r 2
3 -introduction rules: -l Γ, ϕ ϕ, Γ -r ϕ, Γ Γ, ϕ -introduction rules: -l ϕ, ψ, Γ (ϕ ψ), Γ -r Γ, ϕ Γ, ψ Γ, (ϕ ψ) -introduction rules: -l ϕ, Γ ψ, Γ (ϕ ψ), Γ Γ, ϕ, ψ -r Γ, (ϕ ψ) -introduction rules: -l -introduction rules: -l cut rule: ϕ(x/ψ), Γ x ϕ, Γ ϕ(x/p), Γ x ϕ, Γ Γ, ϕ(x/p) -r Γ, x ϕ Γ, ϕ(x/ψ) -r Γ, x ϕ cut Γ, ϕ ϕ, Γ Γ For the rules -l and -r, ϕ(x/ψ) is the result of substituting ψ for all free occurrences of x in ϕ. The formula ψ is called the target formula and may be any quantifier-free formula (i.e., with no bound variables; also called open below) that is free for substitution for x in ϕ (i.e., no free occurrence of x in ϕ is within the scope of a quantifier Qy such that y occurs in ψ). The variable p in the rules -r and -l must not occur free in the bottom sequent and is called an eigenvariable. The size of a formula ϕ, ϕ, is the total number of symbols appearing in it. The size of a proof is the total size of all formulas in the proof. We say that a (quantified) propositional proof system P 1 p-simulates another system P 2, in notation P 2 p P 1, if there is a polytime function F so that for every P 2 -proof π of a sequent S, F (π) is a P 1 -proof of S. We say that P 1 and P 2 are p-equivalent, denoted by P 1 p P 2, if both P 1 p P 2 and P 2 p P 1. The subsystems of G are defined by restricting the set of cut formulas. Definition 2.1 Σ q 0 = Πq 0 = ˆΣ q 0 = ˆΠ q 0 is the set of quantifier-free propositional formulas. For i > 0, Σ q i, Πq i, ˆΣq i, and ˆΠ q i are defined inductively as the smallest sets of quantified propositional formulas such that for all formulas ϕ, ψ and variables x: (i) Σ q i 1 Πq i 1 Σq i Πq i, 3
4 (ii) if ϕ, ψ Σ q i, then ϕ ψ, ϕ ψ, x ϕ Σq i and ϕ Πq i, (iii) if ϕ, ψ Π q i, then ϕ ψ, ϕ ψ, x ϕ Πq i and ϕ Σq i, (iv) ˆΣ q i 1 ˆΠ q i 1 ˆΣ q i ˆΠ q i, (v) if ϕ ˆΣ q i then x ϕ ˆΣ q i, (vi) if ϕ ˆΠ q i then x ϕ ˆΠ q i. That is, ˆΣ q i and ˆΠ q i consist of prenex formulas in Σq i and Πq i, respectively. Definition 2.2 Let i 0. G i, Ĝi, and Ĝ i denote the fragments of the quantified propositional sequent calculus that only allow cuts on Σ q i Πq i -formulas, ˆΣq i -formulas, and ˆΠ q i -formulas, respectively. For any fragment P of the sequent calculus, P denotes its treelike version. The main result of this paper is: Theorem 2.3 For any i, G i p Ĝ i p Ĝ i and G i p Ĝ i p Ĝ i. As mentioned in the introduction, the statement about treelike proof systems is Morioka s theorem. However our proof here applies to both treelike and daglike systems. 3 The proof First we fix our procedure for putting a formula in prenex form. We use the following auxiliary operations. Given a formula, the result of our prenexation procedure will be defined in Definition 3.4. Definition 3.1 Fix an infinite set X of variables. For any prenex formulas ϕ, ψ, we define prenex formulas ϕ ψ, ϕ ψ, ϕ ψ, ϕ ψ, and ϕ as follows: (i) ϕ = ϕ and ϕ Q ψ = ϕ ψ if ϕ, ψ are open, (ii) Qx ϕ = Qx ϕ, (iii) (Qx ϕ) Q ψ = Qy (ϕ(x/y) Q ψ), (iv) ψ Q (Qx ϕ) = Qy (ψ Q ϕ(x/y)) if ψ does not start with Q, (v) ϕ Q ψ = ϕ Q ψ if neither ϕ nor ψ start with Q, where {, }, Q {, }, Q denotes the dual quantifier to Q, and y is the first variable from X with no free occurrences in ψ such that either x = y or y does not appear (free or bound) in ϕ. 4
5 The Q, Q, and operators perform one prenexing step, namely they provide a prenex form of ϕ ψ, ϕ ψ, or ϕ (resp.) if ϕ and ψ are already prenex. The superscript Q indicates what kind of quantifiers we prefer to pull to the prefix first: for example, if ϕ and ψ are quantifier-free, then (up to renaming of variables) ( x ϕ(x)) ( y ψ(y)) = x y (ϕ(x) ψ(y)), and ( x ϕ(x)) ( y ψ(y)) = y x (ϕ(x) ψ(y)). This is needed to ensure that we do not introduce too many quantifier alternations in the prenex formula. Lemma 3.2 Let ϕ, ψ be prenex formulas, Q {, }, and {, }. (i) ϕ = 1 + ϕ, ϕ Q ψ = 1 + ϕ + ψ. (ii) ϕ and ϕ Q ψ are polynomial-time computable given ϕ, ψ. (iii) If ϕ, ψ ˆΣ q i, then ϕ ψ ˆΣ q i and ϕ ˆΠ q i. (iv) If ϕ, ψ ˆΠ q i, then ϕ ψ ˆΠ q i and ϕ ˆΣ q i. (v) ϕ Q ψ is equivalent to ϕ ψ, and ϕ is equivalent to ϕ. Proof: By induction on the length of ϕ, ψ. Lemma 3.3 Given prenex formulas ϕ, ψ and Q {, }, there are polynomial-time constructible treelike cut-free proofs of the sequents ϕ, ψ ϕ Q ψ (ϕ Q ψ) ϕ, ψ ϕ Q ψ ϕ ϕ (ϕ Q ψ) ϕ Q ψ ψ ψ (ϕ Q ψ) ϕ Q ψ ϕ, ψ ϕ, ψ (ϕ Q ψ) ϕ ϕ Q ψ ψ ϕ Q ψ (ϕ Q ψ) ϕ (ϕ Q ψ) ψ ϕ, ϕ ϕ, ϕ ϕ ϕ ϕ ϕ Proof: By induction on the complexity of ϕ, ψ. For example, we will treat the sequents involving (ϕ Q ψ). Assume that ϕ = Qx ϕ (x), and let y be as in Definition 3.1. We have ϕ = Qx ϕ (x) and (ϕ Q ψ) = Qy (ϕ (y) Q ψ). By the induction hypothesis, we can construct proofs of the sequents (ϕ (y) Q ψ) ϕ (y), ψ, ϕ (y) (ϕ (y) Q ψ), ψ (ϕ (y) Q ψ). We derive (ϕ Q ψ) ϕ, ψ using one of the proofs (ϕ (y) ψ) ϕ (y), ψ -l y (ϕ (y) ψ) ϕ (y), ψ -r y (ϕ (y) ψ) x ϕ (x), ψ -l -r (ϕ (y) ψ) ϕ (y), ψ (ϕ (y) ψ) x ϕ (x), ψ y (ϕ (y) ψ) x ϕ (x), ψ 5
6 depending on Q. Similarly, we derive ϕ (y) (ϕ (y) Q ψ) Q-l,Q-r, Qx ϕ (x) Qy (ϕ (y) Q ψ) ψ (ϕ (y) Q ψ) Q-r. ψ Qy (ϕ (y) Q ψ) The other cases are similar. We can now define the prenexation of any formula. As above, we will define two prenex forms to each formula, depending on the preference for what kind of quantifiers to pull out first. This is necessary, as for some formulas there does not exist a single prenex form preserving the complexity classification of the formula. For example, the formula χ = x ϕ(x) y ψ(y), where ϕ and ψ are open, is Σ q 2 Πq 2, and it is equivalent to a ˆΣ q 2 -formula χ = x y (ϕ(x) ψ(y)) and to a ˆΠ q 2 -formula χ = y x (ϕ(x) ψ(y)), but it is not in general equivalent to any prenex formula that would be both ˆΣ q 2 and ˆΠ q 2 (in fact, ˆΣ q 2 ˆΠ q 2 = ˆΣ q 1 ˆΠ q 1 ). Definition 3.4 For any formula ϕ, we define prenex formulas ϕ and ϕ by induction on the complexity of ϕ: (i) ϕ Q = ϕ if ϕ is open, (ii) (Cx ϕ) Q = Cx ϕ C, (iii) ( ϕ) Q = ϕ Q, (iv) (ϕ ψ) Q = ϕ Q Q ψ Q, where Q, C {, } and {, }. Lemma 3.5 Let ϕ be a formula, and Q {, }. (i) ϕ Q = ϕ, and ϕ Q is polynomial-time computable given ϕ. (ii) If ϕ Σ q i, then ϕ ˆΣ q i. If ϕ Πq i, then ϕ ˆΠ q i. (iii) ϕ Q is equivalent to ϕ. Proof: By induction on the complexity of ϕ. Lemma 3.6 Let ϕ be a formula. (i) If ϕ Σ q i, there are polynomial-time constructible Ĝ i -proofs of the sequents and Ĝ i -proofs of the sequents ϕ ϕ ; ϕ ϕ, ϕ, ( ϕ) ; ϕ, ( ϕ). 6
7 (ii) If ϕ Π q i, there are polynomial-time constructible Ĝ i -proofs of the sequents and Ĝ i -proofs of the sequents ϕ ϕ ; ϕ ϕ, ϕ, ( ϕ) ; ϕ, ( ϕ). Proof: We prove (i) and (ii) by simultaneous induction on the complexity of ϕ. The base case of quantifier-free ϕ is straightforward. The case ϕ = x ψ. Note that ϕ = ϕ = x ψ and ( ϕ) = ( ϕ) = x ( ψ). If ϕ Σ q i, we construct the proofs -l ψ ψ -r ψ x ψ x ψ x ψ -l ψ ψ -r ψ x ψ x ψ x ψ -l -l ψ, ( ψ) ψ, x ( ψ) x ψ, x ( ψ) -r -r ψ, ( ψ) x ψ, ( ψ) x ψ, x ( ψ) using the induction hypothesis. If ϕ Π q i, then in fact ϕ Σq i 1, hence the just constructed proofs in Ĝ i 1 and Ĝ i 1 are also valid in both Ĝ i and Ĝ i. The case ϕ = x ψ is dual. The case ϕ = ψ. Let ψ Π q i, the other case is dual. We construct the proofs -r ψ, ( ψ) ( ψ) ψ -l ψ, ( ψ) ψ ( ψ) ˆΠ q i -cut ψ ψ ψ ψ ψ ( ψ) -r ψ, ( ψ) ˆΠ q i -cut -l ψ ψ ψ ψ ( ψ) ψ ψ, ( ψ) using the induction hypothesis and Lemma 3.3. The case ϕ = ψ χ. Let ψ, χ Σ q i, the other case is similar. Notice that ( (ψ χ)) = (ψ χ ). We construct the proofs ψ, χ ψ χ ψ ψ ˆΣ q i -cut ψ, χ (ψ χ) χ χ ˆΣ q i -cut ψ, χ (ψ χ) -l ψ χ (ψ χ) ˆΣ q i -cut ψ χ ψ ψ ψ (ψ χ) ψ -r ψ χ χ χ χ ˆΣ q i -cut (ψ χ) χ (ψ χ) ψ χ 7
8 (ψ χ ) ψ, χ ( ψ), ψ ˆΠ q i -cut ψ, ( (ψ χ)) ( χ) ( χ), χ ˆΠ q i -cut ψ, χ, ( (ψ χ)) -l ψ χ, ( (ψ χ)) ψ (ψ χ ) ψ, ( ψ) χ (ψ χ ) χ, ( χ) ψ, ( (ψ χ)) χ, ( (ψ χ)) -r ψ χ, ( (ψ χ)) using the induction hypothesis and Lemma 3.3. The case ϕ = ψ χ is dual to ψ χ. Lemma 3.7 Let ϕ Σ q i Πq i. (i) There are polynomial-time constructible Ĝ i -proofs of the sequents and Ĝ i -proofs of the sequents (ii) There are polynomial-time constructible Ĝ i ϕ, ( ϕ) ; ϕ, ( ϕ), ϕ, ( ϕ) ; ϕ, ( ϕ). -proofs and Ĝ i -proofs of the sequents ϕ ϕ ; ϕ ϕ. Proof: (i): By induction on the complexity of ϕ. The case of ϕ open is obvious, and the cases ϕ = x ψ and ϕ = x ψ follow from Lemma 3.3, as ( Cx ψ) Q = (Cx ψ) Q = (Cx ψ) Q. The case ϕ = ψ: use cut on the induction hypothesis and the sequents ϕ Q ϕ Q and ϕ Q ϕ Q from Lemma 3.3. The case ϕ = ψ χ: note that ( ϕ) = (ψ χ ). We prove cut χ, ( χ) ψ, χ ψ χ ψ, ( ψ) cut ψ ( χ), (ψ χ) ( ψ), ( χ), (ψ χ) cut ( ψ), ( χ), (ψ χ) ψ (ψ χ ) cut (ψ χ ), ( χ), (ψ χ) χ (ψ χ ) ( (ψ χ)), (ψ χ) using the induction hypothesis and Lemma 3.3. The other cases are similar. (ii): We use cut on (i) and Lemma 3.3: ϕ Q, ( ϕ) Q ϕ Q, ϕ Q ϕq, ( ϕ)q ϕq, ϕq ϕ Q ϕ Q ϕ Q ϕ Q 8
9 Lemma 3.8 Let α be an open formula with no occurrence of variables from X, x / X, and Q {, }. (i) If ϕ and ψ are prenex formulas, then ϕ(x/α) = ( ϕ)(x/α), and ϕ(x/α) Q ψ(x/α) = (ϕ Q ψ)(x/α), where {, }. (ii) ϕ(x/α) Q = ϕ Q (x/α). Proof: By induction on complexity. Now we are ready to prove the main theorem. Proof (of Theorem 2.3): We will show G i p Ĝ i, the other cases are similar. Assume that we are given a G i -proof. Define the set X in Definition 3.1 as the set of propositional variables not appearing in the proof. We apply the following transformation to each sequent in the proof: (i) We negate all (Π q i Σq i )-formulas and move them to the other side of the sequent. (ii) We replace each Σ q i -formula ϕ (including those resulting from the previous step) with ϕ. With each transformed sequent we include a short subproof which ensures that the sequent is correctly derived from previous sequents. This subproof will depend on the rule by which the sequent was derived in the original proof. Initial sequents and structural rules translate to instances of the same rules. Instances of (Σ q i Πq i )-cut translate to ˆΣ q i -cut. Assume that a sequent was derived by an instance Γ, ϕ Γ ϕ, of -r. If ϕ / Σ q i Πq i, it translates to a valid instance of -r. If ϕ Πq i Σq i, the assumption and conclusion of the rule translate to the same sequent of the form Γ ( ϕ),. If ϕ Σ q i, we replace the rule with one of the cut inferences Γ, ϕ ϕ, ( ϕ) Γ, ϕ ϕ ϕ Γ ( ϕ), Γ, ( ϕ) depending on whether ϕ is in Σ q i Πq i or Σq i Πq i. Here, the sequent ϕ ϕ comes from Lemma 3.3, and ϕ, ( ϕ) is from Lemma 3.7. The -l rule is similar. Consider an instance Γ ϕ, Γ ψ, Γ ϕ ψ, of -r. If ϕ, ψ Σ q i, we simulate the rule by two cuts with the sequent ϕ, ψ ϕ ψ from Lemma 3.3. If ϕ, ψ Π q i Σq i, we use similarly a cut inference 9
10 Γ, ( ϕ) Γ, ( (ϕ ψ)) ( ϕ),. Γ, ( ψ) (ϕ ψ ) ϕ, ψ Γ, ( (ϕ ψ)) If ϕ Σ q i Πq i and ψ Πq i Σq i or vice versa, we use the same inference, but we first derive Γ ϕ, Γ, ( ϕ) ϕ, ( ϕ) using Lemma 3.7. In the remaining cases (i.e., either at least one of ϕ, ψ is not in Σ q i Πq i, or one is in Σ q i Πq i and the other is in Πq i Σq i ) the formula ϕ ψ is not in Σq i Πq i. We use an instance of the -r rule Γ ϕ, Γ ψ,, Γ ϕ ψ, but if ϕ is in Σ q i or Πq i Σq i, we first include one of the derivations Γ ϕ, ϕ ϕ Γ, ( ϕ) ϕ, ( ϕ) Γ ϕ, Γ ϕ, using Lemma 3.6, and similarly for ψ. The other and rules are handled similarly. Consider an instance Γ, ϕ(x/α) Γ, x ϕ of -l, where α is an open formula free for substitution for x in ϕ. Note that ϕ(x/α) = ϕ (x/α) by Lemma 3.8. Assume first that ϕ Π q i 1 and i > 1, so that x ϕ Σq i. We can derive Γ, (ϕ(α)) -l Γ, (ϕ(α)) Γ, ( x ϕ) using Lemma 3.7. If ϕ Π q i (Πq i 1 Σq i ), we can derive (ϕ(α)) (ϕ(α)) Γ ( ϕ(α)), -r, Γ x ( ϕ), noting that ( x ϕ) = x ( ϕ). If ϕ Π q i Σq i, and ϕ / Πq i 1 derivation, but we first infer or i = 1, we use the same Γ, ϕ(α) ϕ(α), ( ϕ(α)) Γ ( ϕ(α)), using Lemma 3.7. Otherwise ϕ / Π q i, which means x ϕ / Σq i Πq i. If ϕ / Σq i Πq i, we can directly apply the -l rule; if ϕ Σ q i, we first derive 10
11 Γ, (ϕ(α)) ϕ(α) (ϕ(α)) Γ, ϕ(α) using Lemma 3.6. The other quantifier rules are handled in a similar way. In this way we obtain a Ĝi-proof of the translation of the end-sequent of the original G i -proof. We use cuts with sequents given by Lemma 3.6 to derive the original end-sequent. References [1] Stephen Cook and Tsuyoshi Morioka, Quantified propositional calculus and a second-order theory for NC 1, Archive for Mathematical Logic 44 (2005), no. 6, [2] Stephen Cook and Phuong Nguyen, Logical foundations of proof complexity, Cambridge University Press, New York, [3] Jan Krajíček, Bounded arithmetic, propositional logic, and complexity theory, Cambridge University Press, [4] Jan Krajíček and Pavel Pudlák, Quantified propositional calculi and fragments of bounded arithmetic, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 36 (1990), no. 1, [5] Jan Krajíček and Gaisi Takeuti, On induction-free provability, Annals of Mathematics and Artificial Intelligence 6 (1992), [6] Tsuyoshi Morioka, Logical approaches to the complexity of search problems: Proof complexity, quantified propositional calculus, and bounded arithmetic, Ph.D. thesis, University of Toronto,
Simulation of G i with prenex cuts
Simulation of G i with prenex cuts Emil Jeřábek Phuong Nguyen November 25, 2010 Abstract We show that the quantified propositional proof systems G i are polynomially equivalent to their restricted versions
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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 :
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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.
Διαβάστε περισσότερα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
Διαβάστε περισσότεραω ω ω ω ω ω+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 +
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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.
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραLecture 34 Bootstrap confidence intervals
Lecture 34 Bootstrap confidence intervals Confidence Intervals θ: an unknown parameter of interest We want to find limits θ and θ such that Gt = P nˆθ θ t If G 1 1 α is known, then P θ θ = P θ θ = 1 α
Διαβάστε περισσότεραλρ-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,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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,...,
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραNotes on the Open Economy
Notes on the Open Econom Ben J. Heijdra Universit of Groningen April 24 Introduction In this note we stud the two-countr model of Table.4 in more detail. restated here for convenience. The model is Table.4.
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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) =
Διαβάστε περισσότεραΜηχανική Μάθηση Hypothesis Testing
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΣυστήματα Διαχείρισης Βάσεων Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Συστήματα Διαχείρισης Βάσεων Δεδομένων Φροντιστήριο 9: Transactions - part 1 Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Tutorial on Undo, Redo and Undo/Redo
Διαβάστε περισσότεραStrain gauge and rosettes
Strain gauge and rosettes Introduction A strain gauge is a device which is used to measure strain (deformation) on an object subjected to forces. Strain can be measured using various types of devices classified
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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)
Διαβάστε περισσότερα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:
Διαβάστε περισσότεραInstruction Execution Times
1 C Execution Times InThisAppendix... Introduction DL330 Execution Times DL330P Execution Times DL340 Execution Times C-2 Execution Times Introduction Data Registers This appendix contains several tables
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότεραCoefficient Inequalities for a New Subclass of K-uniformly Convex Functions
International Journal of Computational Science and Mathematics. ISSN 0974-89 Volume, Number (00), pp. 67--75 International Research Publication House http://www.irphouse.com Coefficient Inequalities for
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότεραAssalamu `alaikum wr. wb.
LUMP SUM Assalamu `alaikum wr. wb. LUMP SUM Wassalamu alaikum wr. wb. Assalamu `alaikum wr. wb. LUMP SUM Wassalamu alaikum wr. wb. LUMP SUM Lump sum lump sum lump sum. lump sum fixed price lump sum lump
Διαβάστε περισσότεραHomework 8 Model Solution Section
MATH 004 Homework Solution Homework 8 Model Solution Section 14.5 14.6. 14.5. Use the Chain Rule to find dz where z cosx + 4y), x 5t 4, y 1 t. dz dx + dy y sinx + 4y)0t + 4) sinx + 4y) 1t ) 0t + 4t ) sinx
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα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
Διαβάστε περισσότερα( y) Partial Differential Equations
Partial Dierential Equations Linear P.D.Es. contains no owers roducts o the deendent variables / an o its derivatives can occasionall be solved. Consider eamle ( ) a (sometimes written as a ) we can integrate
Διαβάστε περισσότερα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 Άδειες Χρήσης
Διαβάστε περισσότεραDESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Διαβάστε περισσότερα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
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραSOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM
SOLUTIONS TO MATH38181 EXTREME VALUES AND FINANCIAL RISK EXAM Solutions to Question 1 a) The cumulative distribution function of T conditional on N n is Pr T t N n) Pr max X 1,..., X N ) t N n) Pr max
Διαβάστε περισσότερα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
Διαβάστε περισσότεραdepartment listing department name αχχουντσ ϕανε βαλικτ δδσϕηασδδη σδηφγ ασκϕηλκ τεχηνιχαλ αλαν ϕουν διξ τεχηνιχαλ ϕοην µαριανι
She selects the option. Jenny starts with the al listing. This has employees listed within She drills down through the employee. The inferred ER sttricture relates this to the redcords in the databasee
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραBlock Ciphers Modes. Ramki Thurimella
Block Ciphers Modes Ramki Thurimella Only Encryption I.e. messages could be modified Should not assume that nonsensical messages do no harm Always must be combined with authentication 2 Padding Must be
Διαβάστε περισσότεραRight Rear Door. Let's now finish the door hinge saga with the right rear door
Right Rear Door Let's now finish the door hinge saga with the right rear door You may have been already guessed my steps, so there is not much to describe in detail. Old upper one file:///c /Documents
Διαβάστε περισσότερα2. THEORY OF EQUATIONS. PREVIOUS EAMCET Bits.
EAMCET-. THEORY OF EQUATIONS PREVIOUS EAMCET Bits. Each of the roots of the equation x 6x + 6x 5= are increased by k so that the new transformed equation does not contain term. Then k =... - 4. - Sol.
Διαβάστε περισσότερα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
Διαβάστε περισσότεραΑλγόριθμοι και πολυπλοκότητα NP-Completeness (2)
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών NP-Completeness (2) x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 11 13 21
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότερα