P Q (P Q) (P Q) (P Q) (P % Q) T T T T T T T F F T F F F T F T T T F F F F T T
|
|
- Hortense Griffin
- 5 years ago
- Views:
Transcription
1 Logic and Reasoning Final Exam Practice Fall 2017 Name Section Number The final examination is worth 100 points. 1. (10 points) What is an argument? Explain what is meant when one says that logic is the normative study of arguments. Compare and contrast the deductive and inductive standards for assessing the goodness of an argument. An argument is a collection of sentences. Some of the sentences, called the premisses, are supposed to evidentially support one of the other sentences, called the conclusion. When one says that logic is the normative study of arguments (as opposed to a descriptive study), one means that logic is the study of what makes arguments good or bad. Logic is not the study of what arguments people find persuasive or of how people actually argue. On a deductive standard, an argument is good (valid) just in case whenever all of the premisses are true, the conclusion is guaranteed to be true. On an inductive standard, an argument might be good even though it is possible for the premisses to be true while the conclusion is false. For example, an argument might be inductively good if the conclusion is very likely (but not certain) to be true when the premisses are all true. 2. (5 points) Fill in the truth tables below, where (P % Q ) = ((P ~Q ) (~P Q )): P Q (P Q) (P Q) (P Q) (P % Q) T T T T T T T F F T F F F T F T T T F F F F T T
2 3. (5 points) Use truth tables to decide whether the argument below is valid or invalid. ~(~P ~Q ) (R ~P ) (Q ~R ) ~R P Q R ~(~P ~Q ) (R ~P ) (Q ~R ) ~R T T T T F F F T T F T T T T T F T T F T F T F F T T T T F T T T T F F F T F T T T T F F T F T T F F F F F T T T Since there is no row in which all of the premisses are true and the conclusion is false, the argument is valid. That is, every row in which all of the premisses are true is a row in which the conclusion is true.
3 4. In the following problems, you are asked to prove some alternative rules of inference. a. (3 points) Double Negation Introduction { P } ~~P [5 lines] 1 (1) P A 2 (2) ~P A* 1 (3) ~P P 1 I (4) ~P ~P 2 CP 1 (5) ~~P 3,4 ~I b. (3 points) Absorption { (P Q ) } (P (P Q )) [5 lines] 1 (1) P Q A 2 (2) P ACP 1,2 (3) Q 1,2 E 1,2 (4) P Q 2,3 I 1 (5) P (P Q ) 2,4 CP c. (4 points) Modus Tollens { (P Q ), ~Q } ~P [4 lines] 1 (1) P Q A 2 (2) ~Q A 2 (3) P ~Q 2 I 1,2 (4) ~P 1,3 ~I
4 5. (5 points) Suppose we think of the turnstile,, as a relation defined with respect to a universe of sentences, such that we may translate X Y as Y is provable from X. Give informal arguments showing that the turnstile is reflexive and transitive. Then give an example showing that it is not symmetric. A relation R is reflexive if and only if everything is R-related to itself. If the turnstile is reflexive, then everything is provable from itself. This is obviously true. Pick an arbitrary sentence, P. Since P is given as a premiss, we are allowed to write down P by the rule of assumption. Having written down P, we are finished: we have proved that P. A relation R is transitive if and only if for any three things X, Y, and Z you pick, if X is R-related to Y and Y is R-related to Z, then X is R-related to Z. Pick arbitrary sentences P, Q, and S. Suppose that P Q and Q S. Then there is a proof of Q from P and a proof of S from Q. If there is a proof of S from P, then the turnstile is transitive. To get such a proof, just paste together the two proofs that we already have. That is, carry out the proof from P to Q. Then start the proof from Q to S. The result is a proof of S from P. From (P Q ) we can prove P by conjunction elimination. But we cannot prove (P Q ) from P. Hence, the turnstile is not symmetric.
5 6. Address the problems below about small worlds, models, and validity. a. (2 points) Define validity for first-order logic. Then explain the definition. An argument in first-order logic is valid if and only if every small world that is a model for the premisses of the argument is also a model for the conclusion. In other words, every world that makes the premisses true also makes the conclusion true. It is impossible for the conclusion to be false if the premisses are all true. b. (2 points) Produce one small world that is a model for ( x)(fx Gx) AND one small world that is NOT a model for ( x)(fx Gx). Consider a world with one constant, a. Suppose that Fa and Ga. Such a world is a model for the sentence ( x)(fx Gx). A world in which Fa and ~Ga is not a model for the sentence ( x)(fx Gx). c. (1 point) Compare and contrast small worlds with truth tables. A small world and a row in a truth table both represent a possible world: a way things might be. Truth tables and small worlds are tools for evaluating arguments in zeroth-order logic and in first-order logic, respectively. But whereas truth tables may be used to show that arguments are valid, small worlds cannot always be used to show that arguments are valid.
6 7. (5 points) Translate the following argument into one of our formal languages and then either show that the argument is invalid or give a natural deduction proof of the conclusion from the premisses. Given that the argument is valid, are you rationally compelled to believe that the universe has a cause? Explain your answer. Everything that began to exist has a cause. If so, then either the universe has a cause or the universe did not begin to exist. The universe began to exist. The universe has a cause. Let P = Everything that began to exist has a cause. Let Q = The universe has a cause. Let R = The universe began to exist. Then the argument may be translated as P P (Q ~R) R Q 1 (1) P A 2 (2) P (Q ~R) A 3 (3) R A 1,2 (4) Q ~R 1,2 E 5 (5) Q ACP (6) Q Q 5 CP 7 (7) ~R ACP 7 (8) ~Q ~R 7 I 3 (9) ~Q R 3 I 3,7 (10) ~~Q 8,9 ~I 3,7 (11) Q 10 ~E 3 (12) ~R Q 7,11 CP 1,2,3 (13) Q 4,6,12 E You are not rationally compelled to believe that the universe has a cause, since you may reject one or more of the premisses in the argument.
7 8. Suppose we construct the natural numbers using sets as follows, where x =df y means that x is defined to be identical to y: 0 =df { } That is, zero is defined to be identical to the empty set. 1 =df {0} 2 =df {0, 1} 3 =df {0, 1, 2} : And in general, the natural number n is defined to be the set of all natural numbers smaller than n. a. (3 points) How many elements are in (i) the natural number 3, (ii) the natural number 36, and (iii) the natural number n? 3 36 n (i) (ii) (iii) b. (3 points) If B is the set {1, 3, {5}, 7}, what is the intersection of 6 and B? The intersection of B and 6 is {1, 3}. c. (2 points) List all of the subsets of the natural number 3. {} {0} {1} {2} {0, 1} {0, 2} {1, 2} {0, 1, 2} d. (2 points) Would it work to define x + y to be the same as x y? Explain your answer. No. Given that definition, the sum of 1 and 2 would be 2.
8 9. Answer the questions about probability below by referring to the following diagram: a. (3 points) What is the probability that a randomly-chosen object is unshaded? Randomly-chosen implies that all objects are equally likely to be drawn. Hence, the probability is the number of unshaded out of the number of objects: 13 / 25. b. (3 points) What is the probability that a randomly-chosen object is a shaded triangle? Probability of shaded and triangle is 5 / 25. c. (2 points) What is the probability that a randomly-chosen object is a triangle given that it is shaded? Conditional probability of triangle given shaded is the probability of shaded and triangle divided by the probability of shaded: (5 / 25) / (12 / 25) = 5 / 12 d. (2 points) Is being a square independent of being a circle? No. If an object is a square, then it cannot be a circle. Since there are some squares and circles, Pr(square circle) Pr(square).
9 10. Answer the following conceptual questions about probability. a. (4 points) Suppose your friend Rudy says he thinks that there is a 25 percent chance that it will rain tomorrow and that it is twice as likely that it will not rain tomorrow. Is Rudy s statement coherent? Explain your answer. No. Since It will rain tomorrow, and It will not rain tomorrow are mutually exclusive and exhaustive, the sum of their probabilities must be 1. But Rudy thinks the sum of their probabilities is only b. (3 points) Rudy assigns probability 0.8 to the sentence ( x)fx. What probability should Rudy assign to the sentence ( x)~fx? Explain your answer. Since ( x)~fx is logically equivalent to the negation of ( x)fx, and Rudy assigns probability 0.8 to the sentence ( x)fx, Rudy should assign probability 0.2 to the sentence ( x)~fx. c. (3 points) One day, Rudy is talking to an epidemiologist. Rudy asserts that the probability of a world-wide pandemic this year is ½, since either there will be a pandemic or not. What should the epidemiologist say in reply? Explain your answer. The epidemiologist should first remind Rudy that it is an idealization (like frictionless surfaces in physics) to treat all possibilities as equally likely. In many cases, all possibilities are not equally likely, and we should adjust the probabilities we assign in light of our evidence. The epidemiologist should then cite relevant evidence that makes the probability of a world-wide pandemic different from ½, assuming that it is, in fact different from that value. Based on what I have read, I would expect the probability of a world-wide pandemic to be much lower than ½.
10 11. (10 points) [Modified Student Question] Suppose that 68% of Urban Outfitters customers are politically liberal. Suppose that among Urban Outfitters liberal customers, 71% are women and 29% are men, and among their conservative customers, 37.5% are women and 62.5% are men. Urban Outfitters is developing a new Politics line of women s clothing, which consists of clothing emblazoned with liberal or conservative political slogans. They want to stock their new clothing line in such a way that the percentage of clothing items that have a liberal (or conservative) slogan matches the percentages of liberal (or conservative) women who shop at their stores. What percentage of their Politics line of women s clothing should have a liberal slogan, and what percentage should have a conservative slogan? Let h = Customer is politically liberal. Let e = Customer is a woman. The base rate for political liberalism among Urban Outfitters customers is Hence, Pr(h) = 0.68 and by the negation rule, Pr(~h) = The probability that a customer is a woman given that she is liberal is 0.71, and the probability that a customer is a woman given that she is not a liberal is Hence, Pr(e h) = 0.71 and Pr(e ~h) = By Bayes Theorem, Pr(h e) = Pr(e h) Pr(h) / Pr(e), and by the law of total probability, Pr(e) = Pr(e h) Pr(h) + Pr(e ~h) Pr(~h). Hence, Pr(e) = , and Pr(h e) = / Therefore, about 80% of their Politics line of women s clothing should have a liberal slogan and about 20% should have a conservative slogan.
11 12. (10 points) State the definition of conditional probability and then use it together with derived rules as needed to prove Bayes Theorem. According to our definition, Pr(A B) = Pr(A B) / Pr(B). Bayes Theorem states that Pr(A B) = Pr(B A) Pr(A) / Pr(B). Proof. By definition, Pr(B A) = Pr(B A) / Pr(A). Multiplying both sides by Pr(A), we have Pr(B A) Pr(A) = Pr(B A). According to one of our derived rules, if two sentences are logically equivalent, then they have the same probability. The sentence (A B) is logically equivalent to the sentence (B A). So, Pr(B A) Pr(A) = Pr(A B). By definition, Pr(A B) = Pr(A B) / Pr(B). Substituting Pr(B A) Pr(A) for Pr(A B) in the definition yields Bayes Theorem. []
12 13. Answer the following questions about independence. a. (3 points) Give a formal statement of what it means for two variables to be independent. Then explain what it means for two variables to be independent, using ordinary language. Two variables X and Y are independent if and only if for all values x and y, Pr(X = x Y = y ) = Pr(X = x ). In ordinary language, if two variables are independent, then they are informationally disconnected. Knowing the value that one of them takes tells you nothing about what value the other might take. b. (2 points) Suppose the table below represents a population for which every unit is equally likely to be drawn. Are Studies and Grade independent? Explain your answer. Unit Studies Grade 1 never B 2 sometimes D 3 never D 4 often B 5 sometimes F 6 often C 7 often A 8 sometimes B 9 never F Pr(Grade = A Studies = often) = 1/3 Pr(Grade = A ) = 1/9 Since 1/3 1/9, the variables Grade and Studies are not independent.
13 14. (5 points) Suppose you have two trick coins. One has a bias of 1/3 for heads, and the other has a bias of 2/3 for heads. You cannot tell them apart just by looking, and you have forgotten which one is which. So, you decide to flip one of them several times and make a guess at which it is. You flip the coin ten times and observe heads come up six times. Set up the formula that you need in order to calculate the probability that you have been flipping the coin that has a 1/3 probability of heads on any given flip. Do not calculate a numerical answer. How would your answer change if you had picked your coin out of a bag of 20 coins in which 19 had a bias of 1/3 for heads and one had a bias of 2/3 for heads? We have two hypotheses about the coin: h = Coin has 1/3 bias for Heads, and ~h = Coin has 2/3 bias for Heads. We flip one coin and see six Heads and four Tails. That is our evidence, e. We have Pr(h) = Pr(~h) = ½. We need to find Pr(e h) and Pr(e ~h) in order to apply Bayes Theorem to get an answer. Sequences of coin flips are well-modeled by the binomial distribution. So, we compute Pr(e h) and Pr(e ~h) using the binomial distribution Pr( e h) Pr( e ~ h) Plugging into Bayes Theorem is a complete answer. Although we didn t need to compute a numerical answer, we can get one without too much difficulty: Pr( h e)
14 If we had picked our coin out of a bag of 20 coins in which 19 had a bias of 1/3 for heads and one had a bias of 2/3 for heads, the priors for h and ~h would have been 19/20 and 1/20, respectively. Consequently, we wouldn t be able to cancel the ½ in the numerator and denominator of Bayes Theorem. Plugging into Bayes Theorem, we get: Pr( h e)
MS-A0504 First course in probability and statistics
MS-A0504 First course in probability and statistics Heikki Seppälä Department of Mathematics and System Analysis School of Science Aalto University Spring 2016 Probability is a field of mathematics, which
More informationFormalizing Probability. Choosing the Sample Space. Probability Measures
Formalizing Probability Choosing the Sample Space What do we assign probability to? Intuitively, we assign them to possible events (things that might happen, outcomes of an experiment) Formally, we take
More informationDiscrete Mathematics and Probability Theory Fall 2010 Tse/Wagner MT 2 Soln
CS 70 Discrete Mathematics and Probability heory Fall 00 se/wagner M Soln Problem. [Rolling Dice] (5 points) You roll a fair die three times. Consider the following events: A first roll is a 3 B second
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationPSU MATH RELAYS LOGIC & SET THEORY 2017
PSU MATH RELAYS LOGIC & SET THEORY 2017 MULTIPLE CHOICE. There are 40 questions. Select the letter of the most appropriate answer and SHADE in the corresponding region of the answer sheet. If the correct
More informationCS280, Spring 2004: Final
CS280, Spring 2004: Final 1. [4 points] Which of the following relations on {0, 1, 2, 3} is an equivalence relation. (If it is, explain why. If it isn t, explain why not.) Just saying Yes or No with no
More informationA Quick Lesson on Negation
A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 Introduction One of the key properties of coin flips is independence: if you flip a fair coin ten times and get ten
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10 Introduction to Basic Discrete Probability In the last note we considered the probabilistic experiment where we flipped
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
More information6. Conditional derivations
6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes (1588-1679) gives an important argument for government. Hobbes begins by claiming that
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More informationSection 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
More information6. Conditional derivations
6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes gives an important argument for government. Hobbes begins by claiming that without a common
More informationFundamentals of Probability CE 311S
Fundamentals of Probability CE 311S OUTLINE Review Elementary set theory Probability fundamentals: outcomes, sample spaces, events Outline ELEMENTARY SET THEORY Basic probability concepts can be cast in
More information3 PROBABILITY TOPICS
Chapter 3 Probability Topics 135 3 PROBABILITY TOPICS Figure 3.1 Meteor showers are rare, but the probability of them occurring can be calculated. (credit: Navicore/flickr) Introduction It is often necessary
More informationProbability (Devore Chapter Two)
Probability (Devore Chapter Two) 1016-345-01: Probability and Statistics for Engineers Fall 2012 Contents 0 Administrata 2 0.1 Outline....................................... 3 1 Axiomatic Probability 3
More informationMATH2206 Prob Stat/20.Jan Weekly Review 1-2
MATH2206 Prob Stat/20.Jan.2017 Weekly Review 1-2 This week I explained the idea behind the formula of the well-known statistic standard deviation so that it is clear now why it is a measure of dispersion
More informationSection 1.3: Valid and Invalid Arguments
Section 1.3: Valid and Invalid Arguments Now we have developed the basic language of logic, we shall start to consider how logic can be used to determine whether or not a given argument is valid. In order
More informationMATH 114 Fall 2004 Solutions to practice problems for Final Exam
MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationHow to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.
Major results: (wrt propositional logic) How to reason correctly. How to reason efficiently. How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague,
More informationDiscrete Structures Prelim 1 Selected problems from past exams
Discrete Structures Prelim 1 CS2800 Selected problems from past exams 1. True or false (a) { } = (b) Every set is a subset of its power set (c) A set of n events are mutually independent if all pairs of
More informationJune If you want, you may scan your assignment and convert it to a.pdf file and it to me.
Summer Assignment Pre-Calculus Honors June 2016 Dear Student: This assignment is a mandatory part of the Pre-Calculus Honors course. Students who do not complete the assignment will be placed in the regular
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationCollins' notes on Lemmon's Logic
Collins' notes on Lemmon's Logic (i) Rule of ssumption () Insert any formula at any stage into a proof. The assumed formula rests upon the assumption of itself. (ii) Double Negation (DN) a. b. ( Two negations
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More information*Karle Laska s Sections: There is no class tomorrow and Friday! Have a good weekend! Scores will be posted in Compass early Friday morning
STATISTICS 100 EXAM 3 Spring 2016 PRINT NAME (Last name) (First name) *NETID CIRCLE SECTION: Laska MWF L1 Laska Tues/Thurs L2 Robin Tu Write answers in appropriate blanks. When no blanks are provided CIRCLE
More informationPHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More information09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor
Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence
More information2010 Part IA Formal Logic, Model Answers
2010 Part IA Formal Logic, Model Answers 1 Attempt all parts of this question (a) Carefully define the notions of (i) a truth-function A function is a map which assigns exactly one value to each given
More informationMachine Learning, Midterm Exam: Spring 2008 SOLUTIONS. Q Topic Max. Score Score. 1 Short answer questions 20.
10-601 Machine Learning, Midterm Exam: Spring 2008 Please put your name on this cover sheet If you need more room to work out your answer to a question, use the back of the page and clearly mark on the
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationSignificance Testing with Incompletely Randomised Cases Cannot Possibly Work
Human Journals Short Communication December 2018 Vol.:11, Issue:2 All rights are reserved by Stephen Gorard FRSA FAcSS Significance Testing with Incompletely Randomised Cases Cannot Possibly Work Keywords:
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationCSC 125 :: Final Exam December 15, 2010
1-5. Complete the truth tables below: CSC 125 :: Final Exam December 15, 2010 p q p q p q p q p q p q T T F F T F T F 6-13. Fill in the missing portion of each of the rules of inference named below: 6.
More information9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.
Fermat s last theorem CS 220: Discrete Structures and their Applications Theorem: For every integer n > 2 there is no solution to the equation a n + b n = c n where a,b, and c are positive integers Proofs
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationCorrelation: California State Curriculum Standards of Mathematics for Grade 6 SUCCESS IN MATH: BASIC ALGEBRA
Correlation: California State Curriculum Standards of Mathematics for Grade 6 To SUCCESS IN MATH: BASIC ALGEBRA 1 ALGEBRA AND FUNCTIONS 1.0 Students write verbal expressions and sentences as algebraic
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationProbability. Lecture Notes. Adolfo J. Rumbos
Probability Lecture Notes Adolfo J. Rumbos October 20, 204 2 Contents Introduction 5. An example from statistical inference................ 5 2 Probability Spaces 9 2. Sample Spaces and σ fields.....................
More informationThe statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
More informationCh. 11 Solving Quadratic & Higher Degree Inequalities
Ch. 11 Solving Quadratic & Higher Degree Inequalities We solve quadratic and higher degree inequalities very much like we solve quadratic and higher degree equations. One method we often use to solve quadratic
More informationP (E) = P (A 1 )P (A 2 )... P (A n ).
Lecture 9: Conditional probability II: breaking complex events into smaller events, methods to solve probability problems, Bayes rule, law of total probability, Bayes theorem Discrete Structures II (Summer
More informationCHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)
CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring
More informationIntermediate Math Circles November 8, 2017 Probability II
Intersection of Events and Independence Consider two groups of pairs of events Intermediate Math Circles November 8, 017 Probability II Group 1 (Dependent Events) A = {a sales associate has training} B
More informationLogical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14
0/0/4 Knowledge based agents Logical Agents Agents need to be able to: Store information about their environment Update and reason about that information Russell and Norvig, chapter 7 Knowledge based agents
More informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
More information(b) Follow-up visits: December, May, October, March. (c ) 10, 4, -2, -8,..
Geometry Honors - Chapter 2 Reasoning and Proof Section 2-1 Inductive Reasoning and Conjecture I can explore inductive and deductive reasoning. I can find counterexamples to disprove conjectures. I can
More informationMAE 493G, CpE 493M, Mobile Robotics. 6. Basic Probability
MAE 493G, CpE 493M, Mobile Robotics 6. Basic Probability Instructor: Yu Gu, Fall 2013 Uncertainties in Robotics Robot environments are inherently unpredictable; Sensors and data acquisition systems are
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationProbability and Statistics
Probability and Statistics Kristel Van Steen, PhD 2 Montefiore Institute - Systems and Modeling GIGA - Bioinformatics ULg kristel.vansteen@ulg.ac.be CHAPTER 4: IT IS ALL ABOUT DATA 4a - 1 CHAPTER 4: IT
More informationComputational Logic Lecture 3. Logical Entailment. Michael Genesereth Autumn Logical Reasoning
Computational Logic Lecture 3 Logical Entailment Michael Genesereth Autumn 2010 Logical Reasoning Logical Reasoning relates premises and conclusion does not say whether conclusion is true in general says
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Final Exam
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Final Exam Friday August 15, 2014, 5:10pm-8:10pm. Instructions: Do not turn over this page until the proctor tells you to. Don t
More information7.1 What is it and why should we care?
Chapter 7 Probability In this section, we go over some simple concepts from probability theory. We integrate these with ideas from formal language theory in the next chapter. 7.1 What is it and why should
More informationBusiness Statistics. Lecture 3: Random Variables and the Normal Distribution
Business Statistics Lecture 3: Random Variables and the Normal Distribution 1 Goals for this Lecture A little bit of probability Random variables The normal distribution 2 Probability vs. Statistics Probability:
More information1. When applied to an affected person, the test comes up positive in 90% of cases, and negative in 10% (these are called false negatives ).
CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 8 Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According to clinical trials,
More informationProbability in Programming. Prakash Panangaden School of Computer Science McGill University
Probability in Programming Prakash Panangaden School of Computer Science McGill University Two crucial issues Two crucial issues Correctness of software: Two crucial issues Correctness of software: with
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More informationMachine Learning
Machine Learning 10-701 Tom M. Mitchell Machine Learning Department Carnegie Mellon University January 13, 2011 Today: The Big Picture Overfitting Review: probability Readings: Decision trees, overfiting
More informationPhilosophy 148 Announcements & Such. Independence, Correlation, and Anti-Correlation 1
Branden Fitelson Philosophy 148 Lecture 1 Branden Fitelson Philosophy 148 Lecture 2 Philosophy 148 Announcements & Such Independence, Correlation, and Anti-Correlation 1 Administrative Stuff Raul s office
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationDiscrete Probability
Discrete Probability Mark Muldoon School of Mathematics, University of Manchester M05: Mathematical Methods, January 30, 2007 Discrete Probability - p. 1/38 Overview Mutually exclusive Independent More
More informationIntermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
More informationThe Addition Property of Equality states that You can add the same number to both sides of an equation and still have an equivalent equation.
Section 11 1C: Solving a System of Equations by Elimination The Addition Property of Equality states that You can add the same number to both sides of an equation and still have an equivalent equation.
More informationQuantitative Understanding in Biology 1.7 Bayesian Methods
Quantitative Understanding in Biology 1.7 Bayesian Methods Jason Banfelder October 25th, 2018 1 Introduction So far, most of the methods we ve looked at fall under the heading of classical, or frequentist
More informationProbability Notes (A) , Fall 2010
Probability Notes (A) 18.310, Fall 2010 We are going to be spending around four lectures on probability theory this year. These notes cover approximately the first three lectures on it. Probability theory
More informationMITOCW watch?v=vjzv6wjttnc
MITOCW watch?v=vjzv6wjttnc PROFESSOR: We just saw some random variables come up in the bigger number game. And we're going to be talking now about random variables, just formally what they are and their
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationToss 1. Fig.1. 2 Heads 2 Tails Heads/Tails (H, H) (T, T) (H, T) Fig.2
1 Basic Probabilities The probabilities that we ll be learning about build from the set theory that we learned last class, only this time, the sets are specifically sets of events. What are events? Roughly,
More informationProblems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman.
Math 224 Fall 2017 Homework 1 Drew Armstrong Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman. Section 1.1, Exercises 4,5,6,7,9,12. Solutions to Book Problems.
More information5.3 Conditional Probability and Independence
28 CHAPTER 5. PROBABILITY 5. Conditional Probability and Independence 5.. Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More informationPHIL12A Section answers, 28 Feb 2011
PHIL12A Section answers, 28 Feb 2011 Julian Jonker 1 How much do you know? Give formal proofs for the following arguments. 1. (Ex 6.18) 1 A B 2 A B 1 A B 2 A 3 A B Elim: 2 4 B 5 B 6 Intro: 4,5 7 B Intro:
More informationChapter 3. The Logic of Quantified Statements
Chapter 3. The Logic of Quantified Statements 3.1. Predicates and Quantified Statements I Predicate in grammar Predicate refers to the part of a sentence that gives information about the subject. Example:
More informationLogic Review Solutions
Logic Review Solutions 1. What is true concerning the validity of the argument below? (hint: Use a Venn diagram.) 1. All pesticides are harmful to the environment. 2. No fertilizer is a pesticide. Therefore,
More informationProbability theory basics
Probability theory basics Michael Franke Basics of probability theory: axiomatic definition, interpretation, joint distributions, marginalization, conditional probability & Bayes rule. Random variables:
More information2. AXIOMATIC PROBABILITY
IA Probability Lent Term 2. AXIOMATIC PROBABILITY 2. The axioms The formulation for classical probability in which all outcomes or points in the sample space are equally likely is too restrictive to develop
More informationDERIVATIONS IN SENTENTIAL LOGIC
5 DERIVATIONS IN SENTENTIAL LOGIC 1. Introduction... 142 2. The Basic Idea... 143 3. Argument Forms and Substitution Instances... 145 4. Simple Inference Rules... 147 5. Simple Derivations... 151 6. The
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More informationDiscrete Structures Homework 1
Discrete Structures Homework 1 Due: June 15. Section 1.1 16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 c) 1 +
More informationExamples of frequentist probability include games of chance, sample surveys, and randomized experiments. We will focus on frequentist probability sinc
FPPA-Chapters 13,14 and parts of 16,17, and 18 STATISTICS 50 Richard A. Berk Spring, 1997 May 30, 1997 1 Thinking about Chance People talk about \chance" and \probability" all the time. There are many
More informationProof strategies, or, a manual of logical style
Proof strategies, or, a manual of logical style Dr Holmes September 27, 2017 This is yet another version of the manual of logical style I have been working on for many years This semester, instead of posting
More informationLesson #9 Simplifying Rational Expressions
Lesson #9 Simplifying Rational Epressions A.A.6 Perform arithmetic operations with rational epressions and rename to lowest terms Factor the following epressions: A. 7 4 B. y C. y 49y Simplify: 5 5 = 4
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More information