Section 3.1. Statements and Logical Connectives. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
|
|
- Ilene Haynes
- 5 years ago
- Views:
Transcription
1 Section 3.1 Statements and Logical Connectives
2 What You Will Learn Statements, quantifiers, and compound statements Statements involving the words not, and, or, if then, and if and only if 3.1-2
3 HISORY he Greeks: Aristotelian logic: he ancient Greeks were the first people to look at the way humans think and draw conclusions. Aristotle ( B.C.) is called the father of logic. his logic has been taught and studied for more than 2000 years
4 Mathematicians Gottfried Wilhelm Leibniz ( ) believed that all mathematical and scientific concepts could be derived from logic. He was the first to seriously study symbolic logic. In this type of logic, written statements use symbols and letters
5 Mathematicians George Boole ( ) is said to be the founder of symbolic logic because he had such impressive work in this area. Charles Dodgson, better known as Lewis Carroll, incorporated many interesting ideas from logic into his books
6 Logic and the English Language Connectives - words such as and, or, if, then Exclusive or - one or the other of the given events can happen, but not both Inclusive or - one or the other or both of the given events can happen 3.1-6
7 Statements and Logical Connectives Statement - A sentence that can be judged either true or false. Labeling a statement true or false is called assigning a truth value to the statement
8 Statements and Logical Connectives Simple Statements - A sentence that conveys only one idea and can be assigned a truth value. Compound Statements - Sentences that combine two or more simple statements and can be assigned a truth value
9 Negation of a Statement Negation of a statement change a statement to its opposite meaning. he negation of a false statement is always a true statement. he negation of a true statement is always a false statement
10 Quantifiers Quantifiers - words such as all, none, no, some, etc Be careful when negating statements that contain quantifiers
11 Negation of Quantified Statements orm of statement All are. None are. Some are. Some are not. orm of negation Some are not. Some are. None are. All are
12 Negation of Quantified Statements All are. Some are. None are. Some are not
13 Example 1: Write Negations Write the negation of the statement. Some telephones can take photographs. Solution Since some means at least one this statement is true. he negation is No telephones can take photographs, which is a false statement
14 Example 1: Write Negations Write the negation of the statement. All houses have two stories. Solution his is a false statement, since some houses have one story, some three or more. he negation Some houses do not have two stories or Not all houses have two stories or At least one house does not have two stories are all true statements.
15 Compound Statements Statements consisting of two or more simple statements are called compound statements. he connectives often used to join two simple statements are and, or, if then, and if and only if
16 Not Statements (Negation) he symbol used in logic to show the negation of a statement is ~. It is read not. he negation of p is: ~ p
17 And Statements (Conjunction) is the symbol for a conjunction and is read and. he conjunction of p and q is: p q. he other words that may be used to express a conjunction are: but, however, and nevertheless
18 Example 2: Write a Conjunction Write the following conjunction in symbolic form: Green Day is not on tour, but Green Day is recording a new CD
19 Example 2: Write a Conjunction Solution Let t and r represent the simple statements. t: Green Day is on tour. r: Green Day is recording a new CD. In symbolic form, the compound statement is ~t r
20 Or Statements (Disjunction) he disjunction is symbolized by and read or. In this book the or will be the inclusive or (except where indicated in the exercise set). he disjunction of p and q is: p q
21 Example 3: Write a Disjunction Let p: Maria will go to the circus. q: Maria will go to the zoo. Write the statement in symbolic form. Maria will go to the circus or Maria will go the zoo. Solution p q
22 Example 3: Write a Disjunction Let p: Maria will go to the circus. q: Maria will go to the zoo. Write the statement in symbolic form. Maria will go to the zoo or Maria will not go the circus. Solution q ~p
23 Compound Statements When a compound statement contains more than one connective, a comma can be used to indicate which simple statements are to be grouped together. When we write the compound statement symbolically, the simple statements on the same side of the comma are to be grouped together within parentheses
24 Example 4: Understand How Commas Are Used to Group Statements Let p: Dinner includes soup. q: Dinner includes salad. r: Dinner includes the vegetable of the day Write the statement in symbolic form. Dinner includes soup, and salad or vegetable of the day. Solution p (q r)
25 Example 4: Understand How Commas Are Used to Group Statements Let p: Dinner includes soup. q: Dinner includes salad. r: Dinner includes the vegetable of the day Write the statement in symbolic form. Dinner includes soup and salad, or vegetable of the day. Solution (p q) r
26 Example 5: Change Symbolic Statements into Words Let p: he house is for sale. q: We can afford to buy the house. Write the symbolic statement in words. Solution p ~q he house is for sale and we cannot afford to buy the house
27 Example 5: Change Symbolic Statements into Words Let p: he house is for sale. q: We can afford to buy the house. Write the symbolic statement in words. Solution ~p ~q he house is not for sale or we cannot afford to buy the house
28 Example 5: Change Symbolic Statements into Words Let p: he house is for sale. q: We can afford to buy the house. Write the symbolic statement in words. Solution ~(p q) It is false that the house is for sale and we can afford to buy the house
29 If-hen Statements he conditional is symbolized by and is read if-then. he antecedent is the part of the statement that comes before the arrow. he consequent is the part that follows the arrow. If p, then q is symbolized as: p q
30 Example 6: Write Conditional Statements Let p: he portrait is a pastel. q: he portrait is by Beth Anderson. Write the statement symbolically. If the portrait is a pastel, then the portrait is by Beth Anderson. Solution p q
31 Example 6: Write Conditional Statements Let p: he portrait is pastel. q: he portrait is by Beth Anderson. Write the statement symbolically. If the portrait is by Beth Anderson, then the portrait is not a pastel. Solution q ~p
32 Example 6: Write Conditional Statements Let p: he portrait is pastel. q: he portrait is by Beth Anderson. Write the statement symbolically. It is false that if the portrait is by Beth Anderson, then the portrait is a pastel. Solution ~(q p)
33 If and Only If Statements he biconditional is symbolized by and is read if and only if. If and only if is sometimes abbreviated as iff. he statement p q is read p if and only if q
34 Example 8: Write Statements Using the Biconditional Let p: Alex plays goalie on the lacrosse team. q: he itans win the Champion s Cup. Write the symbolical statement in words. p q Solution Alex plays goalie on the lacrosse team if and only if the itans win the Champion s Cup
35 Example 8: Write Statements Using the Biconditional Let p: Alex plays goalie on the lacrosse team. q: he itans win the Champion s Cup. Write the symbolical statement in words. q ~p Solution he itans win the Champion s cup if and only if Alex does not play goalie on the lacrosse team
36 Example 8: Write Statements Using the Biconditional Let p: Alex plays goalie on the lacrosse team. q: he itans win the Champion s Cup. Write the symbolical statement in words. ~(p ~q) Solution It is false that Alex plays goalie on the lacrosse team if and only if the itans do not win the Champion s Cup
37 Logical Connectives
38 Section 3.2 ruth ables for Negation, Conjunction, and Disjunction
39 What You Will Learn ruth tables for negations, conjunctions, and disjunctions
40 ruth able A truth table is used to determine when a compound statement is true or false
41 Negation ruth able p ~p Case 1 Case
42 Compound Statement ruth able p q Case 1 Case 2 Case 3 Case
43 Conjunction ruth able p q p q Case 1 Case 2 Case 3 Case 4 he conjunction is true only when both p and q are true
44 Disjunction ruth able p q p q Case 1 Case 2 Case 3 Case 4 he disjunction is true when either p is true, q is true, or both p and q are true
45 Negation Negation ~p is read not p. If p is true, then ~p is false; if p is false, then ~p is true. In other words, ~p will always have the opposite truth value of p
46 Conjunction Conjunction p q is read p and q. p q is true only when both p and q are true
47 Disjunction Disjunction p q is read p or q. p q is true when either p is true or q is true, or both p and q are true. In other words, p q is false only when both p and q are false
48 Constructing ruth ables 1. Determine if the statement is a negation, conjunction, disjunction, conditional, or biconditional. he answer to the truth table appears under: ~ if it is a negation if it is a conjunction if it is a disjunction if it is conditional if it is biconditional
49 Constructing ruth ables 2. Complete the columns under the simple statements, p, q, r, and their negations ~p, ~q, ~r, within parentheses, if present. If there are nested parentheses work with the innermost pair first
50 Constructing ruth ables 3. Complete the column under the connective within the parentheses, if present. You will use the truth values of the connective in determining the final answer in step
51 Constructing ruth ables 4. Complete the column under any remaining statements and their negation
52 Constructing ruth ables 5. Complete the column under any remaining connectives. he answer will appear under the column determined in step 1. or a conjunction, disjunction, conditional or biconditional, obtain the value using the last column completed on the left side and on the right side of the connective
53 Constructing ruth ables 5. (continued) or a negation, negate the values of the last column completed within the grouping symbols on the right of the negation. Circle or highlight the answer column and number the columns in the order they were completed
54 Example 3: ruth able with a Negation Construct a truth table for ~(~q p)
55 Example 3: ruth able with a Negation Construct a truth table for ~(~q p). Solution p q ~ (~q p) 4 alse only when p is false and q is true
56 Example 7: Use the Alternative Method to Construct a ruth able Construct a truth table for ~p ~q
57 Example 7: Use the Alternative Method to Construct a ruth able Solution Construct a truth table with four cases. p q
58 Example 7: Use the Alternative Method to Construct a ruth able Solution Add a column for ~p ~q. Use columns ~p and ~q to find ~p ~q. p q ~p ~q ~p ~q It is true only when ~p and~q are true
59 Example 9: Determine the ruth Value of a Compound Statement Determine the truth value for each simple statement. hen, using these truth values, determine the truth value of the compound statement. 15 is less than or equal to
60 Example 9: Determine the ruth Value of a Compound Statement Solution Let p: 15 is less than 9. q: 15 is equal to 9. Express 15 is less than or equal to 9 as p q. Both p and q are false. p q
61 Example 9: Determine the ruth Value of a Compound Statement Determine the truth value for each simple statement. hen, using these truth values, determine the truth value of the compound statement. George Washington was the first U.S. president or Abraham Lincoln was the second U.S. president, but there has not been a U.S. president born in Antarctica
62 Example 9: Determine the ruth Value of a Compound Statement Solution Let p: George Washington was the first U.S. president. q: Abraham Lincoln was the second U.S. president. r: here has been a U.S. president who was born in Antarctica. he statement can be written in symbolic form as (p q) ~r
63 Example 9: Determine the ruth Value of a Compound Statement Solution p: George Washington was the first U.S. president. q: Abraham Lincoln was the second U.S. president. r: here has been a U.S. president who was born in Antarctica. he statement is (p q) ~r. p is true, q is false, r is false. Since r is false, ~r is true
64 Example 9: Determine the ruth Value of a Compound Statement Solution he statement is (p q) ~r. p is true, q is false, ~r is true. (p q) ~r ( ) he original compound statement is true
65 Section 3.3 ruth ables for the Conditional and Biconditional
66 What You Will Learn ruth tables for conditional and biconditional Self-contradictions, autologies, and Implications
67 his image cannot currently be displayed. Conditional p q p q Case 1 Case 2 Case 3 Case 4 he conditional statement p q is true in every case except when p is a true statement and q is a false statement
68 Example: ruth able with a Conditional Construct a truth table for the statement ~p ~q
69 Example: ruth able with a Conditional Solution Construct a standard four case truth table. p q ~p ~q 1 It s a conditional, the answer lies under
70 Biconditional he biconditional statement, p q means that p q and q p or, symbolically (p q) (q p). case 1 case 2 case 3 case 4 order of steps p q (p 1 3 q) 2 7 (q 4 6 p)
71 Biconditional he biconditional statement, p q is true only when p and q have the same truth value, that is, when both are true or both are false
72 Example 4: A ruth able Using a Biconditional Construct a truth table for the statement ~p (~q r)
73 Example 4: A ruth able Using a Biconditional p q r ~p (~q r)
74 Example 7: Using Real Data in Compound Statements he graph on the next slide represents the student population by age group in 2009 for the State College of lorida (SC). Use this graph to determine the truth value of the following compound statements
75 Example 7: Using Real Data in Compound Statements
76 Example 7: Using Real Data in Compound Statements If 37% of the SC population is younger than 21 or 26% of the SC population is age 21 30, then 13% of the SC population is age
77 Example 7: Using Real Data in Compound Statements Solution Let p: 37% of the SC population is younger than 21. q: 26% of the SC population is age r: 13% of the SC population is age Original statement can be written: (p q) r
78 Example 7: Using Real Data in Compound Statements Solution Original statement: (p q) r p and r are true, q is false ( ) he original statement is true
79 Example 7: Using Real Data in Compound Statements 3% of the SC population is older than 50 and 8% of the SC population is age 41 50, if and only if 19% of the SC population is age
80 Example 7: Using Real Data in Compound Statements Solution Let p: 3% of the SC population is older than 50. q: 8% of the SC population is age r: 19% of the SC population is age Original statement can be written: (p q) r
81 Example 7: Using Real Data in Compound Statements Solution Original statement: (p q) r p and q are true, r is false ( ) he original statement is false
82 Self-Contradiction A self-contradiction is a compound statement that is always false. When every truth value in the answer column of the truth table is false, then the statement is a self-contradiction
83 Example 8: All alses, a Self- Contradiction Construct a truth table for the statement (p q) (p ~q)
84 Example 8: All alses, a Self- Contradiction Solution he statement is a self-contradiction or a logically false statement
85 autology A tautology is a compound statement that is always true. When every truth value in the answer column of the truth table is true, the statement is a tautology
86 Example 9: All rues, a autology Construct a truth table for the statement (p q) (p r)
87 Example 9: All rues, a autology Solution he statement is a tautology or a logically true statement
88 Implication An implication is a conditional statement that is a tautology. he consequent will be true whenever the antecedent is true
89 Example 10: An Implication? Determine whether the conditional statement [(p q) q] q is an implication
90 Example 10: An Implication? Solution he statement is a tautology, so it is an implication
Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives
Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.
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 informationProposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators
Proposition/Statement Boolean Logic CS 231 Dianna Xu A proposition is either true or false but not both he sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 1 2 Boolean variables
More informationSection 3.1 Statements, Negations, and Quantified Statements
Section 3.1 Statements, Negations, and Quantified Statements Objectives 1. Identify English sentences that are statements. 2. Express statements using symbols. 3. Form the negation of a statement 4. Express
More information3.2: Compound Statements and Connective Notes
3.2: Compound Statements and Connective Notes 1. Express compound statements in symbolic form. _Simple_ statements convey one idea with no connecting words. _Compound_ statements combine two or more simple
More informationFunctions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y
Lecture 4: ruth functions, evaluating compound statements 1. unctions, arithmetic functions, and truth functions 2. Definitions of truth functions unctions A function is something that takes inputs and
More informationLogic. Def. A Proposition is a statement that is either true or false.
Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or
More informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
More information13.3 Truth Tables for the Conditional and the Biconditional
ruthablesconditionalbiconditional.nb 1 13.3 ruth ables for the Conditional and the Biconditional Conditional Earlier, we mentioned that the statement preceding the conditional symbol is called the antecedent
More informationNote: The area of logic that deals with propositions is called the propositional calculus or propositional logic.
Ch. 1.1 Logic Logic 1 Def. A Proposition is a statement that is either true or false. Example 1: Which of the following are propositions? Statement Proposition (yes or no) UHD is a University 1 + 3 = 0
More informationFUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN
021 McLoughlin Handout 1.3, page 1 of 6 FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN Truth Table for Not K K T F F T Truth Table for And B M B M T F F F T F F F F Truth Table for Or R S R S T
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 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 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 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 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 informationWhat is Logic? Introduction to Logic. Simple Statements. Which one is statement?
What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo
More informationDiscrete Mathematics and Applications COT3100
Discrete Mathematics and Applications CO3100 Dr. Ungor Sources: Slides are based on Dr. G. Bebis material. uesday, January 7, 2014 oundations of Logic: Overview Propositional logic: (Sections 1.1-1.3)
More informationDiscrete Mathematics
Discrete Mathematics Discrete mathematics is devoted to the study of discrete or distinct unconnected objects. Classical mathematics deals with functions on real numbers. Real numbers form a continuous
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationChapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.
Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)
More informationCSCI Homework Set 1 Due: September 11, 2018 at the beginning of class
CSCI 3310 - Homework Set 1 Due: September 11, 2018 at the beginning of class ANSWERS Please write your name and student ID number clearly at the top of your homework. If you have multiple pages, please
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 informationBoolean Logic. CS 231 Dianna Xu
Boolean Logic CS 231 Dianna Xu 1 Proposition/Statement A proposition is either true or false but not both The sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 2 Boolean variables
More informationCSE 240 Logic and Discrete Mathematics
CSE 240 Logic and Discrete Mathematics Instructor: odd Sproull Department of Computer Science and Engineering Washington University in St. Louis 1Extensible - CSE 240 Logic Networking and Discrete Platform
More informationPHI Propositional Logic Lecture 2. Truth Tables
PHI 103 - Propositional Logic Lecture 2 ruth ables ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value
More informationDefinition 2. Conjunction of p and q
Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football
More information2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?
Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true
More informationCISC-102 Winter 2016 Lecture 17
CISC-102 Winter 2016 Lecture 17 Logic and Propositional Calculus Propositional logic was eventually refined using symbolic logic. The 17th/18th century philosopher Gottfried Leibniz (an inventor of calculus)
More information1.1 Language and Logic
c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
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 informationDERIVATIONS AND TRUTH TABLES
DERIVATIONS AND TRUTH TABLES Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 3: DERIVATIONS AND TRUTH TABLES 1 / 65 WHAT
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 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 informationAMTH140 Lecture 8. Symbolic Logic
AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
More informationGEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd:
GEOMERY Chapter 2: LOGIC Name: eacher: Pd: able of Contents DAY 1: SWBA: Identify, write and analyze the different types of logical statements. Pgs: 2-8 Homework: Pgs 6 8 (EVEN ONLY) DAY 2: SWBA: Write
More informationA Statement; Logical Operations
A Statement; Logical Operations Mathematical logic is a branch of mathematics that deals with the formal principles, methods and criteria of validity of reasoning and knowledge. Logic is concerned with
More informationLOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.
LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,
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 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 informationHW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall
CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate
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 informationPropositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.
Propositional Logic Yimei Xiang yxiang@fas.harvard.edu 11 February 2014 1 Review Recursive definition Set up the basis Generate new members with rules Exclude the rest Subsets vs. proper subsets Sets of
More informationFoundation of proofs. Jim Hefferon.
Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are
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 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 information2.2: Logical Equivalence: The Laws of Logic
Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q
More informationLogic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies
Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Stockholm University September 2016 Propositions Proposition:
More informationSection A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.
Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The
More informationChapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.
Chapter 3: Logic Diana Pell Section 3.1: Statements and Quantifiers A statement is a declarative sentence that is either true or false, but not both. Exercise 1. Decide which of the following are statements
More informationCISC-102 Fall 2018 Week 11
page! 1 of! 26 CISC-102 Fall 2018 Pascal s Triangle ( ) ( ) An easy ( ) ( way ) to calculate ( ) a table of binomial coefficients was recognized centuries ago by mathematicians in India, ) ( ) China, Iran
More informationIntroduction Propositional Logic. Discrete Mathematics Andrei Bulatov
Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics Propositional Logic 2-2 What is Logic? Computer science is a mere continuation of logic by other means Georg Gottlob
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationOverview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions
Note 01 Propositional Logic 1 / 10-1 Overview 1. Introduction to Propositional Logic 2. Operations on Propositions 3. Truth Tables 4. Translating Sentences into Logical Expressions 5. Preview: Propositional
More informationCSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4
CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may
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 The Foundations. 1.1 Logic. A proposition is a declarative sentence that is either true or false, but not both.
he oundations. Logic Propositions are building blocks of logic. A proposition is a declarative sentence that is either true or false, but not both. Example. Declarative sentences.. Ottawa is the capital
More informationDiscrete Structures of Computer Science Propositional Logic I
Discrete Structures of Computer Science Propositional Logic I Gazihan Alankuş (Based on original slides by Brahim Hnich) July 26, 2012 1 Use of Logic 2 Statements 3 Logic Connectives 4 Truth Tables Use
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 informationToday s Topic: Propositional Logic
Today s Topic: Propositional Logic What is a proposition? Logical connectives and truth tables Translating between English and propositional logic Logic is the basis of all mathematical and analytical
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 informationNumbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:
3.4 THE CONDITIONAL & BICONDITIONAL Definition. Any statement that can be put in the form If p, then q, where p and q are basic statements, is called a conditional statement and is written symbolically
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 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 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 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 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
More informationIt is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party =
Introduction to Propositional Logic Propositional Logic (PL) is a logical system that is built around the two values TRUE and FALSE, called the TRUTH VALUES. true = 1; false = 0 1. Syntax of Propositional
More informationTruth Tables for Arguments
ruth ables for Arguments 1. Comparing Statements: We ve looked at SINGLE propositions and assessed the truth values listed under their main operators to determine whether they were tautologous, self-contradictory,
More informationMathematical Logic Part One
Mathematical Logic Part One Announcements Problem Session tonight from 7:00 7:50 in 380-380X. Optional, but highly recommended! Problem Set 3 Checkpoint due right now. 2 Handouts Problem Set 3 Checkpoint
More information1 Propositional Logic
1 Propositional Logic Required reading: Foundations of Computation. Sections 1.1 and 1.2. 1. Introduction to Logic a. Logical consequences. If you know all humans are mortal, and you know that you are
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationSec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional
Section 1.1 Sec$on Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional ruth ables 2 Proposi$ons A proposition is a declarative
More informationChapter 5: Section 5-1 Mathematical Logic
Chapter 5: Section 5-1 Mathematical Logic D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 5: Section 5-1 Mathematical Logic 1 / 29 Mathematical Logic
More information~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~
MAT 101 Solutions Exam 2 (Logic, Part I) Multiple-Choice Questions 1. D Because this sentence contains exactly ten words, it is stating that it is false. But if it is taken to be false, then it has to
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 informationINTRODUCTION TO LOGIC 3 Formalisation in Propositional Logic
Introduction INRODUCION O LOGIC 3 Formalisation in Propositional Logic Volker Halbach If I could choose between principle and logic, I d take principle every time. Maggie Smith as Violet Crawley in Downton
More informationAn Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04
An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04 1 A Taste of Logic Logic puzzles (1) Knights and Knaves Knights: always tell the truth Knaves: always lie You encounter two people A and B. A says:
More informationTRUTH TABLES LOGIC (CONTINUED) Philosophical Methods
TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods Here s some Vocabulary we will be talking about in this PowerPoint. Atomic Sentences: Statements which express one proposition Connectives: These are
More informationARTIFICIAL INTELLIGENCE
ARTIFICIAL INTELLIGENCE LECTURE # 03 Artificial Intelligence 2012 Lecture 03 Delivered By Zahid Iqbal 1 Review of Last Lecture Artificial Intelligence 2012 Lecture 03 Delivered By Zahid Iqbal 2 Today s
More informationMAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.
Name: MA 101 Exam 2 Logic (Part I) all 2017 Multiple-Choice Questions [5 pts each] Circle the correct answer on the following multiple-choice questions. 1. Which of the following is not a statement? a)
More informationIntroduction to Logic
Introduction to Logic L. Marizza A. Bailey June 21, 2014 The beginning of Modern Mathematics Before Euclid, there were many mathematicians that made great progress in the knowledge of numbers, algebra
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 informationMathematical Reasoning (Part I) 1
c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither
More informationSolutions to Homework I (1.1)
Solutions to Homework I (1.1) Problem 1 Determine whether each of these compound propositions is satisable. a) (p q) ( p q) ( p q) b) (p q) (p q) ( p q) ( p q) c) (p q) ( p q) (a) p q p q p q p q p q (p
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
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 informationExamples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.
Examples Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Example (1) Solve x 2 + (y 1) 2 = 0. The solution is x = 0 AND y = 1. [p q.] Example (2) Solve x(y 1) = 0. Examples Let
More informationUnit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9
Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion
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 informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
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 informationSection 1.1: Logical Form and Logical Equivalence
Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,
More informationPropositional Logic 1
Propositional Logic 1 Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth Tables 2 Propositions A proposition is
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 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 informationChapter 4 INTRO LOGIC. Sentential Logic DAY 03. Schedule for Unit 1. Review. An argument is valid or invalid purely in virtue of its form.
INO LOGIC DAY 03 Chapter 2 entential Logic 1 3 chedule for Unit 1 eview Day 1 Day 2 Day 3 Day 4 Day 5 Intro Chapter 1 Chapter 2 Chapter 3 Chapter 4 warm-up 40% of Exam 1 An argument is valid or invalid
More information