Mathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC
|
|
- Alicia Nichols
- 6 years ago
- Views:
Transcription
1 I. BASICS OF PROPOSITIONAL LOGIC George Boole ( ) developed logic as an abstract mathematical system consisting of propositions, operations (conjunction, disjunction, and negation), and rules for using the operations. The basic idea is that if simple propositions could be represented by precise symbols, the relation among the propositions could be associated as an algebraic equation. Therefore, certain types of reasoning are reduced to the manipulation of symbols Propositions A proposition is a declarative sentence that can be either true or false. It must be one or the other, and it cannot be both. An atomic proposition is the smallest statement or assertion that must be true or false. Letters P, Q, R, p, q, r,..., called the propositional variables, are usually used to denote the propositions, with the values of them either true (T) or false (F). Example Identify if the following statements are propositions: P: 5 is a prime p: the book is about math A1: Obama was the President [4]: are you going out somewhere? r: 2+3 C : I am a liar. 1 Propositions: P: 5 is a prime p: the book is about math A1: Obama was the President Non- propositions: [4]: are you going out somewhere? r: 2+3 C : I am a liar. 1 1
2 C 1 can not have either T or F, though it looks like a proposition. It is called a paradox. Example Identify if the following statements are propositions: p : Drilling for oil caused dinosaurs to become extinct. q : Look out! r : How far is it to the next town? P 1: x + 2 = 2x P 2 : x + 2 = 2x when x = 2 P 3: The Earth is further from the sun than Venus. P 4 : There is life on Mars. P 5 : 2 2 = 5. p is a proposition. q is not a proposition. r is not a proposition. P 1 is not a proposition. P 2 is a proposition. P 3 is a proposition. P4 is a proposition. P5is a proposition Logic Operators or Connectives The connectives for propositions are ~ : negation : and (conjunction) : or (disjunction) : implication : equivalence Propositional formulas are constructed from atomic propositions by using the connectives. 2
3 Example Let p : q : t : Tomorrow is Saturday Tomorrow is sunny Tomorrow is a beach day Find ~ p : p q : ~ p ~ t : q t : ~ p : Tomorrow is not Saturday p q : Tomorrow is Saturday and sunny ~ p ~ t : Tomorrow is not Saturday or not a beach day q t : If tomorrow is sunny, then tomorrow is a beach day Example If A it is hot and B it is sunny, state the meaning of each of following expresison in terms of A and B: 1.) AB 2.) ~ AB 3.) ~ A~ B 4.) ~ ~ A~ B 5.) AB 6.) ~ A B A ~ B 3
4 1.) AB it is hot and sunny 2.) ~ AB it is not hot but sunny 3.) ~ A~ B it is neither hot nor sunny ~ ~ A~ B it is not true that it is neither hot nor sunny 4.) 5.) AB it is hot or sunny ~ A B A ~ B it is either not hot and sunny or hot and not sunny 6.) Example Let p It is raining q Mary is sick t Bob stayed up late last night r Paris is the capital of France s John is a loud-mouth Express each of the following statements in terms of the declarative sentences above: Negation: 1.) It isn t raining 2.) It is not the case that Mary isn t sick 3.) Paris is not a capital of France 4.) John is in no way a loud-mouth Conjunction: 5.) It is raining and Mary is sick 6.) Bob stayed up late last night and John is a loud-mouth 7.) Paris isn t the capital of France and It isn t raining 8.) John is a loud-mouth but Mary isn t sick 4
5 9.) It is not the case that it is raining and Mary is sick Disjunction: 10.) It is raining or Mary is sick 11.) Paris is the capital of France and it is raining or John is a loud-mouth 12.) Mary is sick or Mary isn t sick 13.) John is a loud-mouth or Mary is sick or it is raining 14.) It is not the case that Mary is sick or Bob stayed up late last night Mixed statements: 15.) It is raining but Mary is not sick 16.) Either it is not raining and Mary is sick or Paris is not the capital of France 17.) Neither it is raining nor Mary is sick 18.) It is not true that both it is raining and Mary is sick 1.) ~ p 2.) ~ (~ q ) 3.) ~ r 4.) ~ s 5.) p q 6.) t s 7.) ~ r ~ p 8.) s ~ q 9.) ~ p q 10.) p q 11.) r p s 12.) q ~ q 13.) ( s q) p 5
6 14.) ~ ( q t) 15.) p ~ q ~ p q ~ r 16.) 17.) ~ p ~ q 18.) ~ p q The well-formed formulas (wff) are obtained by using the construction rules: An atomic proposition is a wff. If is a wff, then so is ~. If and are wff, then so are,,, and. If is a wff, then so is Truth Tables A truth table shows whether a propositional formula is true or false for each possible truth assignment. Truth tables for the five basic connectives are: p F T ~ p T F p q p q p q p q p q F F F F T T F T F T T F T F F T F F T T T T T T Notice that the only case the implication p qis false is when p is true and q is false. If p is false, then the implication p qis true. 6
7 This is like to say the following statement is true: p: If horses have wings, then elephants can dance There are two possible truths tables for the implication p p q T 1( p q) T 2 ( p q) T 3 ( q ) T 4 qwhen p is false: Comments F F F T F T not sure for this case F T F F T T not sure for this case T F F F F F false for this case T T T T T T true for this case If T 1 is used, then p qwould have the same table as p q; If T2 is used, then p qwould have the same table as p q; If T3 is used, then p qwould have the same table as q. So, T4 is a reasonable choice. In the form of Boolean variables: p ~ p p q p q p q p q p q Identity Or Equivalence Two compound propositions p and q are logically equivalent if the columns in a truth table giving their truth values agree. The equivalence is written as p q. 7
8 A proposition is a tautology, if it is always true. Example: p ~ p. a contradiction, if it is always false. Example: p ~ p a satisfiable, if its truth table contains true at least once. Example: p q. a contingency, if it is neither a tautology nor a contradiction. Example: p Example Prove Implication Identity p q ~ p q. p q p q ~ p ~ p q Since the truth tables for p qand ~ p q are the same, then p q ~ p q. Example Translate the following sentences into logic. a.) Only THS students can have IDT. b.) You cannot ride the roller coaster if you are under 4 feet tall unless you are older than 16 years old. c.) You can access the info website from school only if you take AP Calculus or you are not a freshman. 8
9 a.). Let p : q : You are a THS student Students have IDT Then q p. That is, the statement is equivalent to The students who can have IDT are THS students. b.) Let p : q : r : Then You ride roller coaster You are under 4 feet You are older than 16 years old ( q ~ r) ~ p or p (~ q r). c.) Let a : c : f : You access info website You take AP Calculus You are a freshman Then a ( c ~ f ) or (~ c f ) ~ a. In mathematical term for proofs, this is often stated as if and only if, iff or necessary and sufficient conditions : Q P: P is necessary for Q, or P if Q P Q: P is sufficient for Q, or P only if Q P Q: P is necessary and sufficient for Q, or P is true iff Q is true For example, let p : q : I will take the exam I am not sick Then the sentence I will take the exam if and only if I am not sick. is p q. 9
10 Example Equivalence Identity p q p q q p p q p q q p p q ( p q) ( q p) The values for the p q and ( p q) ( q p) are the same. Example Equivalence of Implication and its Contrapositive p q ~ q ~ p p q p q ~ q ~ p ~ q ~ p Example DeMorgan s Laws ~ ( p q) ~ p ~ q and ~ ( p q) ~ p ~ q p q ~ p ~ q p q p q ~ ( p q) ~ p ~ q ~ ( p q) ~ p ~ q
11 Example Law of Syllogism or Transitivity It can also be written as p q q r pr p q ( q r) p r p q r p q q r ( p q) ( q r) p r (( p q) ( q r)) ( p r) Example Exclusive OR (xor) of p and q, denoted as p q, is defined as p q p q It means that p and q are different. Prove p q ( p q) ~ ( p q). 11
12 p q p q ~ ( p q) ( p q) ~ ( p q) p q An argument, constructed from premises that are sets of two or more atomic propositions, yields another proposition known as the conclusion. Example The following statements were from Lewis Carroll s puzzle. Draw the conclusion if the following statements are given: [ 1] All the dated letters in this room are written on blue paper. [ 2] None of them are in black ink, except those that are written in the 3 rd person. [ 3] I have not filed any of those that I can read. [ 4] None of those that are written on one sheet are undated. [ 5] All of those that are not crossed out are in black ink. [ 6] All of those that are written by Brown begin with Dear Sir. [ 7] All of those that are written on blue paper are filed. [ 8] None of those that are written on more than one sheet are crossed out. [ 9] None of those that begin with Dear sir are written in the 3 rd person. Conclusion: Rewrite the premises from the given information: P 1 P 2 P 3 P 4 P 5 P 6 the letter is a dated letter. the letter is written on blue paper. the letter is written in black ink. the letter is written in the 3 rd person. the letter is a readable letter. the letter is written on one sheet. 12
13 P 7 the sentences are crossed out. P 8 the letter is written by Mr. Brown. P 9 the letter is beginning with Dear Sir. P 10 the letter is filed. Then 1. P1 P2 premise [1] 2. P3 P4 premise [2] 3. P5 ~ P10 premise [3] 4. P6 P1 premise [4] 5. ~ P7 P3 premise [5] 6. P8 P9 premise [6] 7. P2 P10 premise [7] 8. ~ P6 ~ P7 premise [8] 9. P9 ~ P4 premise [9] 10. ~ P4 ~ P3 from 2., contrapositive 11. ~ P3 P7 from 5., contrapositive 12. P7 P6 from 7., contrapositive 13. ~ P10 P5 from 3., contrapositive Now cascading all the givens: 14. P8 P9 ~ P4 ~ P3 P7 P6 P1 P2 P10 ~ P5 Or simply P8 ~ P5 Conclusion: Mr. Brown s letters are unreadable. 13
14 II. PROOFS 2.1. Testing an Argument The following is the procedure to check if an argument is valid or not based on the premises -- the assumptions that presumably true: Identify the premises p 1, p 2,, pn, and the conclusion q c. Construct a true table for p1, p2,, pn q and p1 p2 pn qc., c If there is one line such that p p p q invalid. is false, then the argument is 1 2 n c Another way to think this is to look at some specific rows, called critical rows, where the premises p1, p2,, pn are all true: if the conclusion q c is false in one or more critical rows, then the argument is invalid. Otherwise, the argument is valid. In logic, the words true and valid have very different meanings: truth is about the premises making up an argument, and validity is about whether the conclusion follows from the premises. Example Determine whether the arguments are valid: If I get into the THS Academic Research internship, then I don t go to regular classes. If I don t go to regular classes, then I will be well prepared for college. Therefore, if I get into the THS academic Research internship or I don t go to regular classes, I will be well prepared for college. p : I get into the THS Academic Research internship q: I don t go to regular classes r: I will be well prepared for college In the wff form: p q q r p q r 14
15 Or argument can also be expressed as Construct the truth table: ( p q) ( q r) ( p q r) p q r p q ( p1 ) q r ( p2) p q p q r ( q c ) Notes Critical Critical Critical Critical Notice that all critical rows have a true conclusion and thus the argument is valid. Example Determine whether the arguments are valid: Robbery was the motive for the crime only if the victim had money in his pockets. But robbery or vengeance was the motive for the crime. Therefore, vengeance must have been the motive for the crime. p : robbery was the motive for the crime q: the victim had money in his pockets r: vengeance was the motive for the crime In the wff form: p q p r r Or the argument can be expressed as ( p q) ( p r) r. 15
16 The truth table is p q r p q ( p1 ) p r ( p2) r ( q c) Notes Critical Critical Critical Critical It is not a valid argument Valid Forms a.) Modus Ponens (affirm by affirming or the law of detachment) Modus Ponens can symbolically be expressed as p p q q which is equivalent to the argument statement: The truth table for the above statement is p q p q p q p q p q p p q p q F F T F T F T T F T T F F F T T T T T T 16
17 The conclusion is always true regardless the premises. That is, it is a tautology. Therefore, the argument is valid. Example Determine whether the following argument is valid or invalid. If it s after midnight, then I must go to sleep. It is after midnight I must go to sleep. Let p : It is after midnight q: I must go to sleep. Then [1] p q 1 st premise [2] p 2 nd premise q MP The argument is valid. b.) Modus Tollens (deny by denying) ~ q p q ~ p c.) Disjunctive Syllogism ~ p p q q 17
18 d.) Generalization p pq e.) Specialization p q p If argument contains three or more premises, it will be necessary to take the conjunction of all of them. To avoid the inconvenience of writing long truth tables, some of the valid forms can be used to show an argument valid. To show that an argument is invalid, an assignment of truth values for components that makes all the premises true and the conclusion false. Example Determine whether the following argument is valid or invalid. If tomorrow is Saturday and sunny, then it is a beach day. Tomorrow is Saturday. Tomorrow is not a beach day Tomorrow must not be sunny. Let t Tomorrow is Saturday s Tomorrow is sunny b Tomorrow is a beach day then 1. t s b 1 st premise 2. t 2 nd premise 3. ~ b 3 rd premise ~ t s 1,3 Modus Tollens ~ s ~ t DeMorgan s Laws 6. ~s 2, 5, Disjunctive Syllogism 18
19 Example Determine whether the following argument is valid or invalid. It is not sunny this afternoon and it is colder than yesterday. We will go swimming only if it is sunny. If we do not go swimming, then we will take a canoe trip. If we take a canoe trip, then we will be home by sunset We will be home by sunset. p it is sunny this afternoon q it is colder than yesterday r we will go swimming s we will take a canoe trip t we will be home by sunset then 1. ~ p q 1 st premise 2. ~ p Simplification 3. r p 2 nd premise 4. ~ r 2,3, Modus tollens 5. ~ r s 3 rd premise 6. s 4, 5, Modus ponens 7. s t 4 th premise 8. t 6, 7, Modus ponens 19
20 III. FIRST-ORDER LOGIC 3.1. Predicate A constant or value is an object in a set called the domain or universe of discourse. A variable can denote any object in the universe of discourse. A predicate or propositional function is a function that a variable or a finite collection of variables can have. A predicate becomes a proposition when specific values are assigned to the variables. p( x1, x2,, x n ) is called a predicate of n variables or n arguments. A predicate can also become a proposition by quantification. In predicate logic, each predicate is given a name, which followed by the list of arguments. It involves quantities like some and all. Example For an equation yx 1, the predicate for the equation is p( xy:, ) yx 1 p(1,2) is true and p(2,1) is false. Example A student is a senior at THS. The predicate can be formed as s( x ) : x is a senior at THS If Matt is a senior at THS and Grace is a senior at CHS, then s(matt) is true and s(grace)is false. The predicate can also be formed as n( xy:, ) x is a senior at y In this case, n(matt,ths) is true, n(grace,chs) is true also Quantification The universal quantification of Pxis ( ) the proposition written in logical notation as: xp( x) : p( x) is true for all values x in the universe 20
21 or sometimes it can be written as x U, p( x) Where U is called the universe of discourse, the set from which the variables can take values. If 1 2 x { x, x,, x n } is the domain, then ( ) ( ) ( ) ( ) xp x p x1 p x2 p x n A counterexample for xp( x) is that there is a tu such that p( t) is false. The existential quantification of p( x) is the proposition written in logical notation as: xp( x) : There exists an element in the universe discourse such that p( x) is true. If 1 2 x { x, x,, x n } is the domain, then ( ) ( ) ( ) ( ) xp x p x1 p x2 p x n An assertion involving predicates is valid if it is true for every element in the universe of discourse. An assertion involving predicates is satisfiable if there is a universe and interpretation for which the assertion is true. Example If the universe of discourse is U {1,2,3}, then xp( x) p(1) p(2) p(3) xp( x) p(1) p(2) p(3) Example Assume U {1,2,3} and the predicate is p( x ) : x2 2x Then, what are the meanings of xp( x) and xp( x)? Decide if they are true or false. 21
22 xp( x) : For every x {1,2,3}, x2 2x. The proposition is false. xp( x) : There exists x{1,2,3} such that x2 2x. The proposition is true. Example Assume the following predicates with U {All animals} F( x ) : S( x ) : T( x ) : x is a fox x is a sly x is trustworthy Quantify the following statements: a.) Everything is a fox. b.) All foxes are sly. c.) If any fox is sly, then it is not trustworthy. a.). xf( x). b.) x[f( x) S(x)] c.) x[f( x) S(x) ~ T(x)] ~ x[f(x) S(x) T(x)] 3.3. Multiple Quantifiers Example Suppose P( x, y) is xy 1, the universe of discourse for x is the set of positive integers, and universe of discourse for y is all real numbers. Quantify a.) For every positive integer x and for every real number y, xy 1. b.) For every positive integer x, there exists a real number y such that for every positive integer x, xy 1. 22
23 c.) There exists a real number y such that, for every positive integer x, xy 1. a.) x yp( x, y), false. b.) x yp( x, y), true. c.) y xp( x, y), false. The order of quantifiers is important; they may not commute. For example, but xyp ( x, y) y xp( x, y) xyp( x, y) y xp( x, y) xyp ( x, y) y xp( x, y) The only cases in which commutativity holds are the cases in which both quantifies are the same. Example P( x, y) is x is a citizen of y. Q( xyis, ) x lives y. The universe of discourse for x is the set of all people and the universe of discourse for y is the set of US states. Quantify the following statements: a.) All people who live in Florida are citizens of Florida. b.) Every state has a citizen who does not live in that state. a.) x[ Q( x,florida) P(x,Florida)] b.) yx[p(x, y) ~ Q(x, y)] 23
24 3.4. Arguments Universal Instantiation (UI ) xp( x) Pc () Example Universe of discourse consists of all dogs, and Fido is a dog. All dogs are cuddly. Therefore, Fido is cuddly. Universal Generalization (UG) Pc () for an arbitrary c xp( x) This is often implicitly used in mathematical proofs. Existential Instantiation (EI) xp( x) Pc () for some element c Example Universe of discourse consists of all students in the course. There is someone who got an A in the course. Let s call her a and say that a got an A. Existential Generalization (EG) Pc () for some element c xp( x) 24
25 Example Universe of discourse consists of all students in the class. Michelle got an A in the class. Therefore, someone got an A in the class. Modus Ponens (MP) x[ P( x) Q( x)] Pa ( ) Qa ( ) Modus Tollens (MT) x[ P( x) Q( x)] ~ Q( a) ~ Pa ( ) Hypothetical Syllogism (HS) x[ P( x) Q( x)] x[q( x) R( x)] x[ P( x) R( x)] Example a.) x[bird( x) fly( x)] bird( koko) fly( koko) b.) x[bird( x) fly( x)] ~ fly( koko) ~ bird( koko) 25
26 c.) x[bird( x) fly( x)] x[fly( x) has _ wings( x)] x[bird( x) has _ wings( x)] Example Every man has two legs John Smith is a man Therefore, John Smith has two legs. Let U, the universe of discourse, be the people, and John Smith j U. And let M( x ): x is a man L( x ): x has two legs then 1. xm ( x) L( x) 2 nd premise 2. M(j) L(j) UI from (1) 3. M (j) 1 st premise 4. L (j) MP from (2) and (3) Example (Lewis Carroll s puzzle) All babies are illogical Nobody is despised who can manage a crocodile Illogical persons are despised What is the consequence? Let U, the universe of discourse, be the people. And also let B( x ) : x is a baby M( x ) : x can manage a crocodile L( x ): x is logical D( x ) : x is despised then 26
27 1.. xb( x) ~ L(x) 2. xm( x) ~ D(x) 3. x ~ L( x) D(x) 4. xb( x) D(x) 5. xd( x) ~ M(x) 6. xb( x) ~ M(x) 1 st premise 2 nd premise 3 rd premise HS from (1) and (3) Contrapositive from (2) HS from (2) and (5) Conclusion: If a person can manage a crocodile, then the person is not a baby. Example A student in this class has not read the book Everyone in this class passed the first exam Therefore, someone who passed the first exam has not read the book Let U, the universe of discourse, be the people in the class. And also let C( x ) : x is in this class B( x ) : x has read the book P( x ) : x has passed the first exam In the wff form: x C(x) ~ B( x) x C(x) Px ( ) x P(x) ~ B(x) Proof 1. xc(x) ~ B( x) 1 st premise 2. C(s) ~ B(s) EI from (1) 3. C(s) Simplification from (2) 4. xc(x) Px ( ) 2 nd premise 5. C(s) P(s) UI from (3) 27
28 6. P(s) MP from (3) and (5) 7. ~ Bs ( ) Simplification from (2) 8. P(s) ~ B(s) Conjunction of (6) and (7) 9.) xp(x) ~ B(x) EG from (8) 28
Rules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
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 informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1 Outline Mathematical Argument Rules of Inference 2 Argument In mathematics, an argument is a sequence of propositions (called premises)
More informationSec$on Summary. Valid Arguments Inference Rules for Propositional Logic. Inference Rules for Quantified Statements. Building Arguments
Section 1.6 Sec$on Summary Valid Arguments Inference Rules for Propositional Logic Building Arguments Inference Rules for Quantified Statements Building Arguments 2 Revisi$ng the Socrates Example We have
More informationRules of Inference. Arguments and Validity
Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if
More informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More informationSec$on Summary. Valid Arguments Inference Rules for Propositional Logic. Inference Rules for Quantified Statements. Building Arguments
Section 1.6 Sec$on Summary Valid Arguments Inference Rules for Propositional Logic Building Arguments Inference Rules for Quantified Statements Building Arguments 2 Revisi$ng the Socrates Example We have
More informationCSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 February 5, 2015 2 Announcements Homework 1 is due now. Homework 2 will be posted on the web site today. It is due Thursday, Feb. 12 at 10am in class.
More informationECOM Discrete Mathematics
ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More informationKS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE Discrete Math Team 2 -- KS091201 MD W-04 Outline Valid Arguments Modus Ponens Modus Tollens Addition and Simplification More Rules
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Rules of Inference Section 1.6 Section Summary Valid Arguments
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
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 informationsoftware design & management Gachon University Chulyun Kim
Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationDiscrete Structures of Computer Science Propositional Logic III Rules of Inference
Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic
More informationOutline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline
Outline s Discrete Mathematics I MATH/COSC 1056E Julien Dompierre Department of Mathematics and Computer Science Laurentian University Sudbury, August 6, 2008 Using to Build Arguments and Quantifiers Outline
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationFull file at
Transparencies to accompany Rosen, Discrete Mathematics and Its Applications Introduction Chapter 1 - Introduction Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design
More informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
More informationWith Question/Answer Animations. Chapter 1, Part III: Proofs
With Question/Answer Animations Chapter 1, Part III: Proofs Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Section 1.6 Section Summary Valid Arguments Inference Rules for
More informationLogic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:
Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to
More informationMethods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures
Methods of Proof CSE0 Discrete Computational Structures Lecture 4 When is a mathematical argument correct? What methods can be used to construct mathematical arguments? Important in many computer science
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More information(Refer Slide Time: 02:20)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 5 Logical Inference In the last class we saw about
More informationIntroduction Logic Inference. Discrete Mathematics Andrei Bulatov
Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid
More informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationChapter 4, Logic using Propositional Calculus Handout
ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal
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 informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
More informationUnit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics
Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction
More informationLogical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional
Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
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 informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and
More informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More information2. Use quantifiers to express the associative law for multiplication of real numbers.
1. Define statement function of one variable. When it will become a statement? Statement function is an expression containing symbols and an individual variable. It becomes a statement when the variable
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationFormal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures
Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,
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 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 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 informationMath 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
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 informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationChapter 1, Section 1.1 Propositional Logic
Discrete Structures Chapter 1, Section 1.1 Propositional Logic These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6 th ed., by Kenneth H. Rosen, published
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #6: Rules of Inference Based on materials developed by Dr. Adam Lee Today s topics n Rules of inference
More informationMath.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference
Math.3336: Discrete Mathematics Nested Quantifiers/Rules of Inference Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
More information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
More informationMath 55 Homework 2 solutions
Math 55 Homework solutions Section 1.3. 6. p q p q p q p q (p q) T T F F F T F T F F T T F T F T T F T F T F F T T T F T 8. a) Kwame will not take a job in industry and not go to graduate school. b) Yoshiko
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
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 Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More informationMat2345 Week 2. Chap 1.5, 1.6. Fall Mat2345 Week 2. Chap 1.5, 1.6. Week2. Negation. 1.5 Inference. Modus Ponens. Modus Tollens. Rules.
Fall 2013 Student Responsibilities Reading: Textbook, Sections 1.5 1.6 Assignments: as given in the Homework Assignment list (handout) Secs. 1.5 & 1.6 Attendance: Dryly Encouraged Overview Finish up 1.1
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.11-1.12) Section 1.11 Exercise 1.11.1 (a) p q q r r p 1. q r Hypothesis 2. p q Hypothesis 3. p r Hypothetical syllogism, 1, 2 4. r Hypothesis 5. p Modus tollens, 3, 4. (b) p
More informationTest 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:
Test 1 Solutions(COT3100) Sitharam (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology: ( q (p q) (r p)) r Solution. This is Modus Tollens applied twice, with transitivity
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationSRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY MA DISCRETE MATHEMATICS
1 MA6566 - DISCRETE MATHEMATICS UNIT I - LOGIC AND PROOFS Propositional Logic Propositional equivalences-predicates and quantifiers-nested Quantifiers- Rules of inference-introduction to Proofs-Proof Methods
More informationAgenda. Introduction to Proofs Dr Patrick Chan School of Computer Science and Engineering South China University of Technology
Discrete Mathematic Chapter 1: Logic and Proof 1.5 Rules of Inference 1.6 Introduction to Proofs Dr Patrick Chan School of Computer Science and Engineering South China University of echnology Agenda Rules
More informationLecture Predicates and Quantifiers 1.5 Nested Quantifiers
Lecture 4 1.4 Predicates and Quantifiers 1.5 Nested Quantifiers Predicates The statement "x is greater than 3" has two parts. The first part, "x", is the subject of the statement. The second part, "is
More informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of
More informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More information10 LOGIC Introduction. Objectives
10 LOGIC Chapter 10 Logic Objectives After studying this chapter you should understand the nature of propositional logic; understand the connectives NOT, OR, AND; understand implication and equivalence;
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 informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets
More informationCOMP 2600: Formal Methods for Software Engineeing
COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing
More informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 26 Why Study Logic?
More informationProving logical equivalencies (1.3)
EECS 203 Spring 2016 Lecture 2 Page 1 of 6 Proving logical equivalencies (1.3) One thing we d like to do is prove that two logical statements are the same, or prove that they aren t. Vocabulary time In
More informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not
More information