Review: Logic of Categories = Categorical Logic.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES Section 1.3.
Truth Tables The aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments. Go To Next Slide.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Truth Functional Logic
Constructing a Truth Table
Logic & Critical Reasoning
Truth Tables Presented by: Tutorial Services The Math Center.
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
Through the Looking Glass, 1865
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Logic ChAPTER 3.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
The Foundations: Logic and Proofs
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Discrete Maths 2. Propositional Logic Objective
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Normal Forms, Tautology and Satisfiability 2/3/121.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Predicate Logic. TRUTH-TABLE REMINDERS The problem people had the most trouble with was 1e: construct a truth-table for: (P & (~Q & R)) Many of you only.
Truth Tables and Validity Kareem Khalifa Department of Philosophy Middlebury College pqrSp v qr & s~(p v q)~p~q~p & ~q~(p v q) -> (r & s) (~p & ~q) ->
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
Chapter 7 Logic, Sets, and Counting
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
How do I show that two compound propositions are logically equivalent?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
LOGIC.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.
1 Propositional Logic Introduction. 2 What is propositional logic? Propositional Logic is concerned with propositions and their interrelationships. 
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Introduction to Logic Lecture 13 An Introduction to Truth Tables By David Kelsey.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Chapter 1 Logic and proofs
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
Presentation transcript:

Introduction to Truth-Functional/Propositional Logic: Deduction Part II

Review: Logic of Categories = Categorical Logic. All are…. None are…. Some are…. Some are not…. All human beings are mortal. (All things identical with) LaRissa is a human being. Therefore, (all things identical with) Larissa is mortal

Representing the terms of claims symbolically All human beings are mortal. (All things identical with) LaRissa is a human being. Therefore, (all things identical with) LaRissa is mortal. All H are M. L is H. Therefore, L is M.

Square of Opposition Contraposition (switch sub and pred terms & replace both with complementary terms): All things that are immortal are things unidentical with Larry. Obversion (move horiz across square & replace pred term with complementary term): No things identical with Larry are things that are immortal. And then….. Conversion (switch position of sub and pred terms): No things that are immortal are things identical with Larry. Therefore, (all things identical with) Larry is mortal

Truth-Function or Propositional Logic Proposition is a statement with a truth value of true or false. Logic of sentences or propositions or claims (not categories). We are in HUM 106 at this moment. We are in HUM 106 at this moment, and we are smoking salmon. If we are in LRC 105, at this moment, then we are studying material related to PHIL 1.

Claim variables, not term variables. Either we are in HUM 105 at this moment (Q), or we are in HUM 106 (P). Equivalent to P ˇ Q. We are in HUM 106 at this moment (P). Equivalent to P. We are in HUM 106 at this moment (P), and we are smoking salmon (S). Equivalent to P & S. If we are in HUM 106 at this moment (P), then we are smoking salmon (S). Equivalent to P → S.

Claim Variables, Truth Tables, and “Possible Worlds” Thus, ~P = “It is not the case that we are in HUM 106 at this moment.” P ~P T F F T We are in HUM 106 at this moment (P). P T F Negation (“it is not the case that”) symbolized by ~

P ~P T F F T To “interpret” the truth table is to add content. It is raining outside. Andy says he is feeling chipper today. Alyssa works at Ace Hardware.

Conjunction = & (ampersand) Creates a compound claim from two or more simpler claims. And, while, but, even though, etc. We are in HUM 106 at this moment (P), and we are smoking salmon (S). P & S P S T T T F F T F F Both conjuncts must be true for the claims to be true. P S P & S T T T T F F F T F F F F

Disjunction = ˇ (wedge) Also creates a compound claim from two or more simpler claims. Or. Either we are in HUM 105 at this moment (Q), or we are in HUM 106 (P). P ˇ Q P Q T T T F F T F F A disjunction is false if and only if both disjuncts are false. P Q P ˇ Q T T T T F T F T T F F F

Conditional Claim = → “If….then…..” P S T T T F F T F F A conditional is false if and only if its antecedent is true and its consequent is false. P S P → S T T T T F F F T T F F T “If….then…..” If we are in LRC 106 at this moment (P), then we are smoking salmon (S). P → S P = the “antecedent.” S = the “consequent.”

Exercise 10-1 If Quincy learns to symbolize, Paula will be amazed. Paula will teach him if Quincy pays her a big fee. Paula will teach him only if Quincy pays her a big fee. Only in Paula helps him will Quincy pass the course. Quincy will pass the course if and only if Paula helps him.

Exercise 10-2 If Parsons signs the papers then Quincy will go to jail, and Rachel will file an appeal. If Parsons signs the papers, then Quincy will go to jail and Rachel will file an appeal. If Parsons signs the papers and Quincy goes to jail, then Rachel will file an appeal. Parsons signs the papers and if Quincy goes to jail Rachel will file an appeal. If Parsons signs the papers then if Quincy goes to jail Rachel will file an appeal.

6. If Parsons signs the papers Quincy goes to jail, and if Rachel files an appeal Quincy goes to jail. 7. Quincy goes to jail if either Parsons signs the papers or Rachel files an appeal. 8. Either Parsons signs the papers or, if Quincy goes to jail, then Rachel will file an appeal. 9. If either Parsons signs the papers or Quincy goes to jail then Rachel will file an appeal. 10. If Parsons signs the papers then either Quincy will go to jail or Rachel will file an appeal.

Practicing with a Conditional What’s the truth table for P and S? P S T T T F F T F F A conditional is false if and only if its antecedent is true and its consequent is false. So what’s the truth table for P → S? If you have satisfactorily fulfilled the requirements described in the course syllabus, then you will earn a passing grade. What’s the symbolic expression? P → S P → S T F

Practicing with a Conditional P S T T T F F T F F Now add ~P P S ~P T T T F F T F F If scientist do not find a cure for baldness, John will always have a shiny head. ~P → S. To generate truth table, begin with simple claims. P=Scientists find a cure for baldness. S=John will always have a shiny head.

Now apply the rule of conditionals to generate ~P → S: A conditional is false if and only its antecedent is true and its consequent is false. P S ~P ~P → S T T F T F F F T T F F T P S ~P ~P → S T T F T T F F T F T T T F F T F

More Complicated Combinations If the McKay tract is approved, then the number of homeless camping in the forest will increase and the natural environment will be damaged. P → (Q & R) vs. (P → Q) & R Simple claims: P = The McKay tract is approved. Q = The number of homeless camping in the forest will increase. R = The natural environment will be damaged. The truth table must list all possible truth values for P, Q, and R. Building a truth table is getting tough!

What if there were a way to build truth tables easily? So….r = 2n Then, alternate T’s and F’s in the right-most row until you have the correct number of rows. Then, alternate pairs of T’s and F’s in the next row to the left. Then, alternate sets of four T’s and four F’s in the next row to the left, and so on and so on. The left-most row will always be half T’s and half F’s. Claims with 1 letter have two possible combinations of truth values. Claims with 2 letters have four possible combinations of truth values. So….every time we add a letter, the number of T and F combinations doubles and so, therefore, the number of rows in the truth table doubles.

If the McKay tract is approved, then the number of homeless camping in the forest will increase and the natural environment will be damaged. P → (Q & R) If r = 2n, then how many rows will the truth table have? 1st: Alternate T’s and F’s in the right-most row until you have the correct number of rows. P Q R T F

Then…. Then, alternate pairs of T’s and F’s in the next row to the left. Then, alternate sets of four T’s and four F’s in the next row to the left, and so on and so on. P Q R T F

Now Apply the Rule of Conjunctives Both conjuncts must be true for the claims to be true. P Q R Q & R T T T T T F T F T T F F F T T F T F F F T F F F

P Q R Q & R T T T T T T F F T F T F T F F F F T T T F T F F F F T F F F F F

P Q R Q & R P → (Q&R) T T T T T T F F T F T F T F F F F T T T F T F F F F T F F F F F Now apply the rule of conditionals: A conditional is false if and only if its antecedent is true and its consequent is false.

If the McKay tract is approved, then the number of homeless camping in the forest will increase and the natural environment will be damaged. Now apply the rule of conditionals: A conditional is false if and only its antecedent is true and its consequent is false. P Q R Q & R P → (Q&R) T T T T T T T F F F T F T F F T F F F F F T T T T F T F F T F F T F T F F F F T

The Value of Truth Tables Generates all possible combinations of truth values for statements and combinations of statements. Allows you to test for validity with certainty. Validity: It is impossible for the conclusion to be false and premises to be true. An invalid argument is an illogical argument. An illogical argument is not a good argument.

S → ~B S _ ~B First, translate this argument into standard form Use a truth table to determine the validity or invalidity of this argument: “If building the bookshelf requires a screwdriver then I will not be able to build it. After reading the directions I see that a screwdriver is needed. So, I can’t build it.” First, translate this argument into standard form If S then not B S _ Not B S → ~B S _ ~B Now into symbols

S → ~B S _ ~B Now, build a truth table. We have two claim variables, “S” and “~B” that each need a column. We need a column for each premise and the conclusion. S ~B T T T F F T F F S → ~B ~B

S → ~B S _ ~B Now, fill in the truth values for the first premise based on the rule of the conditional: A conditional is false if and only if its antecedent is true and its consequent is false. S ~B T T T F F T F F S → ~B We’re done. Our truth table now tells us whether or not the argument is valid. What do you think? T F