1. The leves re either lbeled with sentences in ;, or with sentences of the form All X re X. 2. The interior leves hve two children drwn bove them) if
|
|
- Johnathan Lloyd
- 7 years ago
- Views:
Transcription
1 Q520 Notes on Nturl Logic Lrry Moss We hve seen exmples of wht re trditionlly clled syllogisms lredy: All men re mortl. Socrtes is mn. Socrtes is mortl. The ide gin is tht the sentences bove the line should semnticlly entil the one below the line. Speciclly, inevery context 1 in which All men re mortl nd Socrtes is mn re true, it must be the cse tht Socrtes is mortl is lso true. Wht we wnt to do here is to turn this semntic entilment into the rule in forml proof system. 1 The frgment with sentences All X re Y. It will be esier to postpone the introduction of nmes bit, so to begin we'll only del with sentences All X re Y. More formlly, we hve vribles X 1 X 2 ::: X n ::: rnging over common nouns. The X's denote the v vribles. A sentence is n expression S of the form All X re Y, where X nd Y re one of the v vribles. For exmple, All X 12 re X 7132 is sentence in this rst frgment. Next, we need notion of semntics for this frgment. In this discussion, model or interprettion, or context), will be pir U [ ]), where U is set, nd [[X i ] U for ll i. We then use this to dene the truth or flsity ofsentences. The denition is [[All X re Y ] = true if [X ] [Y ] flse otherwise If ; is set of sentences nd S be sentence, we sytht;semnticlly implies S nd we write ; j= S if: for ll contexts U [ ]]), if [A]] = true for ll A 2 ;, then lso [S]] = true. For exmple, fall X 1 re X 2 All X 2 re X 3 gj= All X 1 re X 3 : On the other hnd, fall X 1 re X 2 All X 3 re X 2 g 6j= All X 1 re X 3 : Wht one wnts to do in forml system of logic is to give purely syntctic counterprt ` to j=. We red ` s \proves" or \derives". The gol is to give denition of reltion ; ` S nd then to check tht it grees with the erlier notion ; j= S. A proof tree over ; for this frgment is tree with the following properties: 1 In these notes, we use \context" nd \model" synonymously. 1
2 1. The leves re either lbeled with sentences in ;, or with sentences of the form All X re X. 2. The interior leves hve two children drwn bove them) if the lbel of the prent on the bottom) is All X re Y, then the lbel of the left child is All X re Z, nd the lbel of the right child is All Z re Y. We drw these trees with the root t the bottom nd the leves t the top. We summrize this schemticlly by indicting the inference rules s follows: All X re Z All Z re Y All X re Y All X re X If there is proof tree over ; whose root is lbeled S, wesy;` S. This is how our proof system works. Here is n exmple: Let ; be fall A re B All Q re A All B re D All C re D All A re Qg Let S be All Q re D. Here is proof tree showing tht ; ` S: All Q re A All A re B All B re B All A re B All B re D All A re D All Q re D Note tht ll of the leves belong to ; except for one tht is All B re B. Note lso tht some elements of ; re not used s leves. This is permitted ccording to our denition. The proof tree bove shows tht ; ` S. Also, there is smller proof tree tht does this, since the use of All B re B is not relly needed. The reson why we llow leves to be lbeled like this is so tht tht we cn hve one-element trees lbeled with sentences of the form All A re A. Lemm 1.1 Soundness) If ; ` S, then ; j= S. Proof To prove this formlly, you need the notion of induction on proof trees. We didn't relly cover this, so our proof will be bit new. Suppose T is tree tht shows ; ` S. If T is one-element tree, let S be the lbel on the one node. Either S belongs to ;, or else S is of the form All A re A. In the rst cse, every model stisfying every sentence in ; clerly stises S, ss belongs to ;. And in the second cse, every model whtsoever stises S. So we know our result for one-element trees T. In more generl setting, let's suppose tht we hve treet tht hs s immedite subtrees T 1 nd T 2. Wht do the lbels look like? Well, the lbel on T must be sentence All X re Z, nd then for some Y the lbel of the left child is All X re Y, nd the lbel of the right child is All X re Y. Now T 1 nd T 2 re smller thn our T. So we ssume the result we re trying to estblish bout T for the smller trees T 1 nd T 2. This is where induction comes in!) This tells us tht ; j= All X re Y, nd lso ; j= All Y re Z. We clim tht ; j= All X re Y. Tke nycontent inwhich ll sentences in ; re true. Then [X ] [Y ]by our rst point bove. And [Y ]] [[Z ]by second. So [[X ] [Z ]] by trnsitivity of subset. Since the context here is rbitrry, we conclude tht ; j= All X re Z. Theorem 1.2 Completeness) In the frgment with All, if; j= S, then; ` S. Proof Let Z 1 ::: Z k be ll the vribles tht occur in ; or in S. Let S be All X re Y. 2
3 Dene model by U = fg, 2 nd [[Z i ] = U if ; ` All X re Zi otherwise 1) We clim tht if ; contins All V re W, then [V ] [[W ]. For this, we my ssume tht [[V ] 6= otherwise the result is trivil). So [[V ]] =U. Thus ; ` All X re V. So we hve proof tree s on the left below:. All X re V All V re W All X re W The tree overll hs s leves All V re W plus the leves of the tree bove All X re V. Overll, we see tht ll leves re lbelled by sentences in ;. This tree shows tht ; ` All X re W. From this we conclude tht [[W ]] =U. In prticulr, [[V ] [W ]. Now our clim implies tht the context we hve dened mkes ll sentences in ; true. So it must mke the conclusion true. Therefore [[X ] [Y ]]. And [[X ]] = U, since we hve one-point tree for All X re X. Hence [[Y ]=U s well. But this mens tht ; ` All X re Y, just s desired. A Stronger Result Theorem 1.2 proves the completeness of the logicl system. But it doesn't give us ll the informtion we would need to hve n ecient proceedure to decide whether or not ; ` S in this frgment. For tht, we need little more. Dene reltion on the vribles in question by: V W if there is sequence V = V 0 V 1 ::: V k = Z such tht for i = 0 ::: k ; 1, ; ` All V i re V i+1. We llow the sequence to just hve V = V 0 = V, so tht we hve V V for ll V. Lemm 1.3 Let ; be set of sentence in our frgment, nd dene by Then 1. For ll U, U U. 2. If U V nd V W,thenU W. U V i ; ` All U re V 2) Theorem 1.4 Let ; be ny set of sentences in this frgment, let be sbove. Let X nd Y be ny vribles. Then the following re equivlent: 1. ; ` All X re Y. 2 This just mens tht U is some one-element set. It doesn't mtter which one-element set. Actully, it doesn't even mtter tht U hs just one element: ny non-empty set U would work. 3
4 2. ; j= All X re Y. 3. X Y. The originl denition of the entilment reltion ; j= S involves looking t ll models of the lnguge. Theorem 1.4 is importnt becuse prt 3) gives criterion the entilment reltion tht is lgorithmiclly sensible. To see whether ; j= All X re Y or not, we only need to compute from ;. This mounts to constructing. This is the reexive-trnsitive closure of reltion, so it is computtionlly very mngeble. In grph theoretic terms, one cn mke grph of the vribles in question using s the edge reltion the reltion! given by Y! Z i ; ` All Y re Z. Then just mens tht there is pth in this grph from Y to Z.) Exercise 1 Prove Theorem 1.4. [Hint: show 1)=)2), 2)=)3), nd 3)=)1). The hrd step is 2)=)3). For this, ssume tht X 6 Y. Build context which mkes ll the sentences in ; true nd All X re Y flse. You'll need to modify 1).] ] 2 We wnt to now enrich our lnguge by dding ssertions. We cll these sentences existentils, since formlizing them in logic would use the existentil quntier 9. We extend our semntics by [ ] = true flse if [X ]] \ [[Y ] 6= otherwise We gin write ; j= S for the semntic entilment reltion dened the sme wy s before. Exercise 2 Check tht f Some Y re Zg 6j= Some X re Z by building model in which [[X ]] \ [[Y ] 6= nd [Y ]] \ [[Z ] 6=, but[x ] \ [[Z ]] =. We dd the following three proof rules to our system: Some Y re X Some X re X All Y re Z Some X re Z At this point we hve new proof system, but we keep the nottion ; ` S. If we need to dierentite the proof system here from the previous one, we would need to indicte this somehow in our nottion. Theorem 2.1 Completeness) In the frgment with All nd Some, if; j= S, then ; ` S. Proof Suppose tht ; j= S. There re two cses, depending on whether S is of the form 4
5 All X re Y or of the form. The cses re hndled dierently. Since the rst is esier, we leve it to you s n Exercise. So we x X nd Y s suppose tht ; j=. We need proof of this fct in our system. List ll of the existentil sentences in ; in list: Some V 1 re W 1 Some V 2 re W 2 ::: Some V n re W n 3) Note tht we might hve repets mong the V 's nd W s, nd tht some of these might well coincide with the X nd Y tht we re deling with in this proof. For the universe U we tke f1 ::: ng, wheren is the number in 3). For ech vrible Z, we dene [Z ] = fi : either V i Z or W i Zg: 4) The reltion is dened in 2).) This denes n model of the lnguge. Consider sentence All P re Q in ;. Then P Q. It follows from 3) nd Lemm 1.3 tht [P ] [Q ]. Second, tke n existentil sentence Some V i re W i on our list in 3) bove. Then i itself belongs to [[V i ] \ [W i ]], so this intersection is not empty. These fcts imply tht ll sentences in ; re mde true in our model. Recll tht our sentence S is. By our ssumption tht ; j=,[x ] \ [Y ]] 6=. Let i belong to this set. We hve four cses, depending on whether V i X or V i Y, nd whether W i X or W i Y. One cse is when V i X nd W i Y. Reclling tht Some V i re W i belongsto;,wehve proof tree s follows: All V i re X All W i re Y Some V i re W i Some W i re V i Some W i re X Some X re W i The other cses re similr. Exercise 3 Complete the proof of Theorem 2.1 by showing tht if ; is set of sentences in the frgment of this section nd ; j= All X re Y, then lso ; ` All X re Y. You will need to modify the proof of Theorem 1.2 little bit, since ; now myhve existentil sentences. Exercise 4 Adpt the proof of Theorem 2.1 to show tht if ; 6` : then there is model mking ll sentences in ; true nd lso mking flse. By directly following the construction, the size of the model will be the number of existentil sentences in ;. Cn we do better? 1. Show by modifying 4) tht we cn shrink our model down to one of size t most Show tht 2 is the smllest we cn get by showing tht if we only look t one-element models f Some Y re Zg j= Some X re Z 5
6 Exercise 5 Give n lgorithm which tkes nite sets ; in the frgment of this section nd lso single sentences S nd tells whether ; j= S or not. [You my be sketchy, s we were in our discussion of this mtter t the end of Section 1.] Exercise 6 Suppose tht one wnts to sy tht All X re Y is true when [X ] [Y ] nd lso [[X ] 6=. Then the following rule becomes sound: All X re Y Show tht if we dd this rule to our proof system, then we get complete system for the modied semntics. [Hint: Given ;, let ; be ; with ll sentences such tht All X re Y belongs to ;. Show tht ; ` S in the modied system i ; ` S in the old system.] Exercise 7 Wht would you do to the system to dd sentences of the form Some X exists? 3 Adding nmes Wecontinue by dding nmes so tht we cn del with sentences like John is secretry. To our forml lnguge we dd individul vribles X 1 ::: X n ::: we bbrevite these J M J 1 ::: J n :::, etc. The sentences we dd to the frgment re J is n X nd J is M, wherej nd M re individul vribles nd X is common noun vrible. We ssume tht in model U, [J ] 2 U. We hve to sy when sentences with nmes re true nd when they re flse. The nturl denition is: true if [[J ]] 2 [X ] [J is n X ] = flse otherwise [J is M ] = true if [[J ]] =[M ] flse otherwise To get proof system, we dd the remining rules in Figure 1. We intend to show the completeness of the logic in Figure 1. For this, we need denition. Fix set ; of sentences in this frgment. Let be the reltion on nmes dened by Lemm 3.1 is n equivlence reltion. J M i ; ` J is M: 5) Theorem 3.2 Soundness nd Completeness) ; ` S i ; j= S. Proof [Sketch] The soundness hlf of this result is routine. We omit some of the detils which re similr to the completeness proof we hve lredy seen. Assume tht ; j= S. We must show tht ; ` S. Agin, we hve cses s to the syntctic form of S. Perhps the most interesting is when S is. As before, we dene to be from 2). We lso hve the equivlence reltion from 5). Let the existentil sentences in ; be listed s in 3). Let the set of equivlence clsses of be [J 1 ] ::: [J m ]. 6
7 All X re Z All Z re Y All X re Y Some Y re X All X re X Some X re X All Y re Z Some X re Z All X re Y J is n X J is Y J is J M is J J is M J is n X J is Y J is M M is F J is F M is n X J is M J is n X Figure 1: The rules of our forml logic for the sentences in this section. We tke U to be f1 ::: ng[f[j 1 ] ::: [J m ]g. We ssume these sets re disjoint. We dene [Z ] = fi : either V i Z or W i Zg [f[j] : for some M 2 [J], ; ` M is Zg To nish dening our context, we tke [J ]=[J]. Tht is, the semntics of J is the equivlence clss [J]. It is esy to see tht the semntics is monotone in the sense tht if V W, then[v ] [W ]]. This implies tht ll of the universl ssertions of ; re true in our model. The existentil ssertions in ; re Some V i is W i for i n, nd for ech i, the number i belongs to [[V i ] \ [[W i ]]. Finlly, consider sentence J is Z in ;. Then ; ` J is Z. So [[J ]=[J] 2 [Z ]. This mens tht our sentence J is Z is true in our context. We conclude tht lso is true in this context. If there is some number i in [[X ]\[[Y ]], then the proof of Theorem 2.1 shows tht ; `. The only lterntiveis when for some J, [J] 2 [X ] \ [Y ]. By the denition in 6), there re M 2 [J] nd N 2 [J] such tht ; ` M is n X nd ; ` N is Y. Since M 2 [J] nd N 2 [J] we lso hve ; ` M is N. We exhibit proof tree over ;:.. N is Y. M is N M is n X M is Y The verticl dots. men tht there is some tree over ; estblishing the sentence t the bottom of the dots. So ; `, s desired. Exercise 8 Red the sttement of the Completeness Theorem bove. The proof tht I gve only covers the cses when S is of the form. The other cses re esier. Give the rguments in those cses. 7 6)
8 4 No In this section, we consider the frgment withno X re Y on top of All X re Y. In ddition to the rules of Section 1, we tke thefollowing: All X re Z No Z re Y No X re Y The soundness of this system is routine. No X re Y No Y re X No X re X No X re Y No X re X All X re Y Theorem 4.1 Completeness) In the frgment with All nd No, if ; j= S, then ; ` S. Proof Fix set ;. We construct model U ; =U [[ ]]) nd then show thts is true in U ; i ; ` S. We tkeforu the set of nonempty sets s of vribles stisfying the following conditions: 1. If V 2 s nd V W, then W 2 s. 2. If V W 2 s, then;6` No V re W. Note s specil cse of the lst condition tht if V 2 s, then ; 6` No V re V.) We set [V ] = fs 2 U : V 2 sg: 7) We clim tht ech sentence in ; is true in U ;. Condition 1) implies tht if All V re W belongs to ;, then [V ] [W ]. Suppose tht No V re W belongs to ;. Let s 2 [[V ]. Then V 2 s. By condition 2), W =2 s. So s =2 [W ]. This rgument shows tht [[V ] \ [[W ]=. We showthtifs is true in U ;, then ; ` S. We rst del with the cse tht S is the of the form All X re Y. Let s = fz : X Zg: Cse I: s =2 U. Then there re V W 2 s such tht;` No V re W. In this cse, All X re V No V re W No X re W All X re W No W re X No X re X All X re Y 8) Cse II: s 2 U. Then since s 2 [[X ], we hve s 2 [Y ]]. 7) tells us tht Y 2 s, nd so ; ` All X re Y, s desired. This concludes our work when S is All X re Y. Suppose tht S is No X re Y. Let s = fz : X Z or Y Zg: Note tht X Y 2 s. Then s =2 U, lest s 2 [[X ] \ [[Y ]. So there re V W 2 s such tht ; ` No V re W. Cse I: ; ` All X re V,nd;`All Y re W. We hve the tree: All X re V No V re W All Y re W No X re W No X re Y 9) Cse II: ; ` All X re V,nd;`All X re W. In this cse, tke the proof tree in 8) nd chnge the root to No X re Y. 8
Algebra Review. How well do you remember your algebra?
Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then
More informationPROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY
MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationLINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES
LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of
More informationExample 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.
2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this
More informationIntegration by Substitution
Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is
More informationRegular Sets and Expressions
Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite
More informationLecture 5. Inner Product
Lecture 5 Inner Product Let us strt with the following problem. Given point P R nd line L R, how cn we find the point on the line closest to P? Answer: Drw line segment from P meeting the line in right
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More information4.11 Inner Product Spaces
314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces
More informationMODULE 3. 0, y = 0 for all y
Topics: Inner products MOULE 3 The inner product of two vectors: The inner product of two vectors x, y V, denoted by x, y is (in generl) complex vlued function which hs the following four properties: i)
More informationReasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More informationMath 135 Circles and Completing the Square Examples
Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for
More informationUse Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.
Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd
More information5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one.
5.2. LINE INTEGRALS 265 5.2 Line Integrls 5.2.1 Introduction Let us quickly review the kind of integrls we hve studied so fr before we introduce new one. 1. Definite integrl. Given continuous rel-vlued
More informationand thus, they are similar. If k = 3 then the Jordan form of both matrices is
Homework ssignment 11 Section 7. pp. 249-25 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If
More informationIntegration. 148 Chapter 7 Integration
48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but
More information2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration
Source: http://www.mth.cuhk.edu.hk/~mt26/mt26b/notes/notes3.pdf 25-6 Second Term MAT26B 1 Supplementry Notes 3 Interchnge of Differentition nd Integrtion The theme of this course is bout vrious limiting
More informationMATH 150 HOMEWORK 4 SOLUTIONS
MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive
More information9 CONTINUOUS DISTRIBUTIONS
9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete
More informationFactoring Polynomials
Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles
More informationBinary Representation of Numbers Autar Kaw
Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy
More informationOr more simply put, when adding or subtracting quantities, their uncertainties add.
Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re
More informationVectors 2. 1. Recap of vectors
Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms
More informationSPECIAL PRODUCTS AND FACTORIZATION
MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come
More informationFUNCTIONS AND EQUATIONS. xεs. The simplest way to represent a set is by listing its members. We use the notation
FUNCTIONS AND EQUATIONS. SETS AND SUBSETS.. Definition of set. A set is ny collection of objects which re clled its elements. If x is n element of the set S, we sy tht x belongs to S nd write If y does
More informationLecture 3 Gaussian Probability Distribution
Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike
More informationExample A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding
1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde
More informationGraphs on Logarithmic and Semilogarithmic Paper
0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl
More informationEQUATIONS OF LINES AND PLANES
EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint
More informationTreatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.
The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only
More information1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam
1./1.1 Introduction to Computers nd Engineering Problem Solving Fll 211 - Finl Exm Nme: MIT Emil: TA: Section: You hve 3 hours to complete this exm. In ll questions, you should ssume tht ll necessry pckges
More informationSection 7-4 Translation of Axes
62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes of revolution, prt ii Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem ) nd the ccumultion process is to determine so-clled volumes of
More information1.2 The Integers and Rational Numbers
.2. THE INTEGERS AND RATIONAL NUMBERS.2 The Integers n Rtionl Numers The elements of the set of integers: consist of three types of numers: Z {..., 5, 4, 3, 2,, 0,, 2, 3, 4, 5,...} I. The (positive) nturl
More information9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes
The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors
More informationObject Semantics. 6.170 Lecture 2
Object Semntics 6.170 Lecture 2 The objectives of this lecture re to: to help you become fmilir with the bsic runtime mechnism common to ll object-oriented lnguges (but with prticulr focus on Jv): vribles,
More informationBabylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity
Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University
More informationA.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324
A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................
More informationSection 5-4 Trigonometric Functions
5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form
More informationOn decidability of LTL model checking for process rewrite systems
Act Informtic (2009) 46:1 28 DOI 10.1007/s00236-008-0082-3 ORIGINAL ARTICLE On decidbility of LTL model checking for process rewrite systems Lur Bozzelli Mojmír Křetínský Vojtěch Řehák Jn Strejček Received:
More informationRegular Languages and Finite Automata
N Lecture Notes on Regulr Lnguges nd Finite Automt for Prt IA of the Computer Science Tripos Mrcelo Fiore Cmbridge University Computer Lbortory First Edition 1998. Revised 1999, 2000, 2001, 2002, 2003,
More information3 The Utility Maximization Problem
3 The Utility Mxiiztion Proble We hve now discussed how to describe preferences in ters of utility functions nd how to forulte siple budget sets. The rtionl choice ssuption, tht consuers pick the best
More informationEcon 4721 Money and Banking Problem Set 2 Answer Key
Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in
More informationHow fast can we sort? Sorting. Decision-tree model. Decision-tree for insertion sort Sort a 1, a 2, a 3. CS 3343 -- Spring 2009
CS 4 -- Spring 2009 Sorting Crol Wenk Slides courtesy of Chrles Leiserson with smll chnges by Crol Wenk CS 4 Anlysis of Algorithms 1 How fst cn we sort? All the sorting lgorithms we hve seen so fr re comprison
More informationSolving BAMO Problems
Solving BAMO Problems Tom Dvis tomrdvis@erthlink.net http://www.geometer.org/mthcircles Februry 20, 2000 Abstrct Strtegies for solving problems in the BAMO contest (the By Are Mthemticl Olympid). Only
More informationThe Velocity Factor of an Insulated Two-Wire Transmission Line
The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the
More informationSolution to Problem Set 1
CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let
More informationPhysics 43 Homework Set 9 Chapter 40 Key
Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x
More information0.1 Basic Set Theory and Interval Notation
0.1 Bsic Set Theory nd Intervl Nottion 3 0.1 Bsic Set Theory nd Intervl Nottion 0.1.1 Some Bsic Set Theory Notions Like ll good Mth ooks, we egin with definition. Definition 0.1. A set is well-defined
More informationOperations with Polynomials
38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply
More informationRIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS
RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS Known for over 500 yers is the fct tht the sum of the squres of the legs of right tringle equls the squre of the hypotenuse. Tht is +b c. A simple proof is
More informationBasic Analysis of Autarky and Free Trade Models
Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently
More informationAA1H Calculus Notes Math1115, Honours 1 1998. John Hutchinson
AA1H Clculus Notes Mth1115, Honours 1 1998 John Hutchinson Author ddress: Deprtment of Mthemtics, School of Mthemticl Sciences, Austrlin Ntionl University E-mil ddress: John.Hutchinson@nu.edu.u Contents
More informationChapter 6. Logic and Action. 6.1 Actions in General
Chpter 6 Logic nd Action Overview An ction is something tht tkes plce in the world, nd tht mkes difference to wht the world looks like. Thus, ctions re mps from sttes of the world to new sttes of the world.
More informationCOMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE. Skandza, Stockholm ABSTRACT
COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE Skndz, Stockholm ABSTRACT Three methods for fitting multiplictive models to observed, cross-clssified
More informationPhysics 6010, Fall 2010 Symmetries and Conservation Laws: Energy, Momentum and Angular Momentum Relevant Sections in Text: 2.6, 2.
Physics 6010, Fll 2010 Symmetries nd Conservtion Lws: Energy, Momentum nd Angulr Momentum Relevnt Sections in Text: 2.6, 2.7 Symmetries nd Conservtion Lws By conservtion lw we men quntity constructed from
More informationAll pay auctions with certain and uncertain prizes a comment
CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin
More informationAppendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:
Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you
More informationExperiment 6: Friction
Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht
More informationMathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100
hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by
More information4 Approximations. 4.1 Background. D. Levy
D. Levy 4 Approximtions 4.1 Bckground In this chpter we re interested in pproximtion problems. Generlly speking, strting from function f(x) we would like to find different function g(x) tht belongs to
More information19. The Fermat-Euler Prime Number Theorem
19. The Fermt-Euler Prime Number Theorem Every prime number of the form 4n 1 cn be written s sum of two squres in only one wy (side from the order of the summnds). This fmous theorem ws discovered bout
More informationbody.allow-sidebar OR.no-sidebar.home-page (if this is the home page).has-custom-banner OR.nocustom-banner .IR OR.no-IR
body.llow-sidebr OR.no-sidebr.home-pge (if this is the home pge).hs-custom-bnner OR.nocustom-bnner.IR OR.no-IR #IDENTIFIER_FOR_THIS_SITE div#pge-continer.depends_on_page_ty PE llow-sidebr mens tht there
More informationHelicopter Theme and Variations
Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the
More informationOne Minute To Learn Programming: Finite Automata
Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge
More informationBasically, logarithmic transformations ask, a number, to what power equals another number?
Wht i logrithm? To nwer thi, firt try to nwer the following: wht i x in thi eqution? 9 = 3 x wht i x in thi eqution? 8 = 2 x Biclly, logrithmic trnformtion k, number, to wht power equl nother number? In
More informationProtocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff
Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention
More informationCS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001
CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic
More informationWords Symbols Diagram. abcde. a + b + c + d + e
Logi Gtes nd Properties We will e using logil opertions to uild mhines tht n do rithmeti lultions. It s useful to think of these opertions s si omponents tht n e hooked together into omplex networks. To
More informationPHY 140A: Solid State Physics. Solution to Homework #2
PHY 140A: Solid Stte Physics Solution to Homework # TA: Xun Ji 1 October 14, 006 1 Emil: jixun@physics.ucl.edu Problem #1 Prove tht the reciprocl lttice for the reciprocl lttice is the originl lttice.
More informationP.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn
33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of
More informationGeometry 7-1 Geometric Mean and the Pythagorean Theorem
Geometry 7-1 Geometric Men nd the Pythgoren Theorem. Geometric Men 1. Def: The geometric men etween two positive numers nd is the positive numer x where: = x. x Ex 1: Find the geometric men etween the
More information10.6 Applications of Quadratic Equations
10.6 Applictions of Qudrtic Equtions In this section we wnt to look t the pplictions tht qudrtic equtions nd functions hve in the rel world. There re severl stndrd types: problems where the formul is given,
More informationJava CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:
Jv CUP Jv CUP is prser-genertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code
More informationDATABASDESIGN FÖR INGENJÖRER - 1056F
DATABASDESIGN FÖR INGENJÖRER - 06F Sommr 00 En introuktionskurs i tssystem http://user.it.uu.se/~ul/t-sommr0/ lt. http://www.it.uu.se/eu/course/homepge/esign/st0/ Kjell Orsorn (Rusln Fomkin) Uppsl Dtse
More informationCURVES ANDRÉ NEVES. that is, the curve α has finite length. v = p q p q. a i.e., the curve of smallest length connecting p to q is a straight line.
CURVES ANDRÉ NEVES 1. Problems (1) (Ex 1 of 1.3 of Do Crmo) Show tht the tngent line to the curve α(t) (3t, 3t 2, 2t 3 ) mkes constnt ngle with the line z x, y. (2) (Ex 6 of 1.3 of Do Crmo) Let α(t) (e
More informationRedistributing the Gains from Trade through Non-linear. Lump-sum Transfers
Redistributing the Gins from Trde through Non-liner Lump-sum Trnsfers Ysukzu Ichino Fculty of Economics, Konn University April 21, 214 Abstrct I exmine lump-sum trnsfer rules to redistribute the gins from
More informationModule Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials
MEI Mthemtics in Ection nd Instry Topic : Proof MEI Structured Mthemtics Mole Summry Sheets C, Methods for Anced Mthemtics (Version B reference to new book) Topic : Nturl Logrithms nd Eponentils Topic
More information. At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2
7 CHAPTER THREE. Cross Product Given two vectors = (,, nd = (,, in R, the cross product of nd written! is defined to e: " = (!,!,! Note! clled cross is VECTOR (unlike which is sclr. Exmple (,, " (4,5,6
More informationWeek 7 - Perfect Competition and Monopoly
Week 7 - Perfect Competition nd Monopoly Our im here is to compre the industry-wide response to chnges in demnd nd costs by monopolized industry nd by perfectly competitive one. We distinguish between
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationOnline Multicommodity Routing with Time Windows
Konrd-Zuse-Zentrum für Informtionstechnik Berlin Tkustrße 7 D-14195 Berlin-Dhlem Germny TOBIAS HARKS 1 STEFAN HEINZ MARC E. PFETSCH TJARK VREDEVELD 2 Online Multicommodity Routing with Time Windows 1 Institute
More informationDlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report
DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationDecision Rule Extraction from Trained Neural Networks Using Rough Sets
Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT
More informationBrillouin Zones. Physics 3P41 Chris Wiebe
Brillouin Zones Physics 3P41 Chris Wiebe Direct spce to reciprocl spce * = 2 i j πδ ij Rel (direct) spce Reciprocl spce Note: The rel spce nd reciprocl spce vectors re not necessrily in the sme direction
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationThe Definite Integral
Chpter 4 The Definite Integrl 4. Determining distnce trveled from velocity Motivting Questions In this section, we strive to understnd the ides generted by the following importnt questions: If we know
More informationExponential and Logarithmic Functions
Nme Chpter Eponentil nd Logrithmic Functions Section. Eponentil Functions nd Their Grphs Objective: In this lesson ou lerned how to recognize, evlute, nd grph eponentil functions. Importnt Vocbulr Define
More informationAP STATISTICS SUMMER MATH PACKET
AP STATISTICS SUMMER MATH PACKET This pcket is review of Algebr I, Algebr II, nd bsic probbility/counting. The problems re designed to help you review topics tht re importnt to your success in the clss.
More informationNetwork Configuration Independence Mechanism
3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting
More informationFAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University
SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility
More informationReview guide for the final exam in Math 233
Review guide for the finl exm in Mth 33 1 Bsic mteril. This review includes the reminder of the mteril for mth 33. The finl exm will be cumultive exm with mny of the problems coming from the mteril covered
More information6 Energy Methods And The Energy of Waves MATH 22C
6 Energy Methods And The Energy of Wves MATH 22C. Conservtion of Energy We discuss the principle of conservtion of energy for ODE s, derive the energy ssocited with the hrmonic oscilltor, nd then use this
More informationDrawing Diagrams From Labelled Graphs
Drwing Digrms From Lbelled Grphs Jérôme Thièvre 1 INA, 4, venue de l Europe, 94366 BRY SUR MARNE FRANCE Anne Verroust-Blondet 2 INRIA Rocquencourt, B.P. 105, 78153 LE CHESNAY Cedex FRANCE Mrie-Luce Viud
More informationINTERCHANGING TWO LIMITS. Zoran Kadelburg and Milosav M. Marjanović
THE TEACHING OF MATHEMATICS 2005, Vol. VIII, 1, pp. 15 29 INTERCHANGING TWO LIMITS Zorn Kdelburg nd Milosv M. Mrjnović This pper is dedicted to the memory of our illustrious professor of nlysis Slobodn
More informationWarm-up for Differential Calculus
Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:
More informationLectures 8 and 9 1 Rectangular waveguides
1 Lectures 8 nd 9 1 Rectngulr wveguides y b x z Consider rectngulr wveguide with 0 < x b. There re two types of wves in hollow wveguide with only one conductor; Trnsverse electric wves
More informationLinear Equations in Two Variables
Liner Equtions in Two Vribles In this chpter, we ll use the geometry of lines to help us solve equtions. Liner equtions in two vribles If, b, ndr re rel numbers (nd if nd b re not both equl to 0) then
More information