Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

TRUTH TABLES Section 1.3.
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.
Logic & Critical Reasoning
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
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.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
Philosophy 148 Chapter 6. Truth-Functional Logic Chapter 6 introduces a formal means to determine whether arguments are valid, so that there is never.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
CS128 – Discrete Mathematics for Computer Science
Review: Logic of Categories = Categorical Logic.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
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.
Propositional Logic USEM 40a Spring 2006 James Pustejovsky.
Through the Looking Glass, 1865
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Validity: Long and short truth tables Sign In! Week 10! Homework Due Review: MP,MT,CA Validity: Long truth tables Short truth table method Evaluations!
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
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.
Valid and Invalid Arguments
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
Logical Arguments. Strength 1.A useless argument is one in which the truth of the premisses has no effect at all on the truth of the conclusion. 2.A weak.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Deductive Arguments.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
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 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?
Review Given p: Today is Thursday q: Tomorrow is Friday
Thinking Mathematically
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
LOGIC.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
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.
6.6 Argument Forms and Fallacies
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.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Outline Logic Propositional Logic Well formed formula Truth table
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.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Logic: The Language of Philosophy. What is Logic? Logic is the study of argumentation o In Philosophy, there are no right or wrong opinions, but there.
Chapter 1 Logic and proofs
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
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,
Logical Forms.
6.4 Truth Tables for Arguments
Presentation transcript:

Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks. = F Linda loves logic lectures. = L Use upper case letters and logical operators (~, ,&, v) to represent compound propositions ( e.g. If it’s Tuesday, Raja is in class) T  R)

Logical Operators (Connectives) ~ Negation, ~P “not P” “P is false”  Implication, P  Q “ if P, then Q” “P implies Q” & Conjunction, P & Q “P and Q” v Disjunction, P v Q “P or Q”

Translating Compound Statements Gonzaga will not win the tournament. ~G If UCLA wins, Minnesota will not advance. U  ~M Either Louisville or Kansas will win. L v K The Lobos will win and the Bruins won’t. L & ~B

Negation Heather is not happy. ~H The show is not over. ~S P________~P__ T F F T Negate falsehoods. Affirm truths. Suspend judgment on propositions with unknown truth values Get a life. Negating a true statement produces a false one, negating a false statement creates a truth.

Conjunction Your wife is gone and so is your car. W & C P QP&Q T T T T F F F T F F F F A conjunction is true only when both conjuncts are true

Implication (Hypotheticals) If Pat is busy, Mari will help you. P  M If the death penalty is unfairly administered, then the ABA will oppose it. D  A P___Q___P  _Q T T T T F F F T T F F T If the candle is lit, the wax will melt. C  W If P, then Q is true whenever either P is false or Q is true.

Disjunction Either your crankcase or your transmission is leaking oil. C v T It’s either Lupus or Arthritis. L v A P__Q____P_v_Q T T T T F T F T T F F F P or Q is true when either P or Q or both are true.

Modus Ponens If Tiny drinks Tequila, he gets sick. Tiny drank Tequila. Therefore, Tiny is sick. T  S T____  S P  Q P___  Q A valid deductive argument form.

The fallacy of affirming the consequent. If Tiny drinks Tequila, he gets sick. He is sick. Therefore, he drank tequila. T  S (Really, it was a bad S burrito.)  T P  Q Q An invalid form.  P

Modus Tollens If the engine is running, there is gas in the tank. There is no gas in the tank. Therefore, the engine is not running. E  G ~G ~E P  Q ~Q___ ~P A valid deductive argument form.

Fallacy of Denying the Antecedent If it rains, the street gets wet. It didn’t rain. So the street isn’t wet. R  S ~R___ ~S An invalid form. Who left the sprinklers on?. Mt. Ararat or bust!

Hypothetical Syllogism If the first native is a politician, then he lies. If he lies, then he denies being a politician. Therefore, if the first native is a politician, then he denies being a politician. P  Q Q  R  P  R A valid deductive form.

Disjunctive Syllogism Either Obamacare will kill kids, or Bachman spoke falsely. Obamacare will not kill kids. Therefore, Bachman spoke falsely. O v B ~O B P v Q ~P__  Q A valid deductive argument form.

Truth Table Validity Test A truth table represents all possible truth value combinations of the premises and conclusion of an argument. Valid forms never have a false conclusion with true premises. I’ll prove I love her with this truth table. TTFF

Setting up Truth Tables If the argument contains two simple propositions (as in, If A then C, A,  C) then four rows are needed (place two Ts and two Fs under A, and T, F, T, F under C. AC TT TF FT FF

Truth Table Set Up If the argument contains three simple propositions (as in: If A then B; If B then C;  If A then C) then eight rows are needed. Place four Ts then four Fs under A; two Ts, two Fs, two Ts, two Fs under B; and T,F,T,F,T,F,T,F under C. ABC TTT TTF TFT TFF FTT FTF F FT FFF

Entering Truth values for Compound Propositions PQ PvQP&Q P  Q~Q TT T T T F T F T F F T F T T F T F F F FF T T [Refer to this chart when entering truth values for disjunctions, conditionals, and negations. The truth values of the compounds are a function of the truth values of the simple components (P and Q).]

TT for MP(If p, q; p;  q) Components Compound PQP  Q p2 c p1 TT T TF F FT T FF T No line has true premises and false conclusion, so the argument is valid.

Denying the Antecedent If God exists, morality is objective. God does not exist. So, morality is merely subjective. G  O ~G___ ~O P Q P  Q ~P ~Q prem 1 p2 c T T T F F T F F F T F T T T F F F T T T Line three has true prem.s & false conclusion; so invalid.

Dilemma Either you get married or you break it off. If you get married, you will be miserable. If you break it off you will be miserable. (Unexpressed Conclusion?) Damn, two can live cheaper than one.

Truth Table PQRPvQ P  R Q  R c p1 p2 p3 TT T T T T T T F T F F T F T T T T x T F F T F T F T T T T T x F T F T T F F F T F T T F F F F T T Valid!