PHI Propositional Logic Lecture 2. Truth Tables

Similar documents
2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

13.3 Truth Tables for the Conditional and the Biconditional

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

PROPOSITIONAL CALCULUS

CSC Discrete Math I, Spring Propositional Logic

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

DISCRETE MATH: LECTURE 3

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

The Logic of Compound Statements cont.

Analyzing Arguments with Truth Tables

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

Truth Tables for Arguments

A Quick Lesson on Negation

THE LOGIC OF COMPOUND STATEMENTS

Compound Propositions

ANALYSIS EXERCISE 1 SOLUTIONS

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

Section 1.2: Propositional Logic

ICS141: Discrete Mathematics for Computer Science I

Logic and Truth Tables

Rules Build Arguments Rules Building Arguments

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

Formal Logic 2. This lecture: Standard Procedure of Inferencing Normal forms Standard Deductive Proofs in Logic using Inference Rules

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

A. Propositional Logic

CSE 20: Discrete Mathematics

Propositional Logic. Spring Propositional Logic Spring / 32

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

2.2: Logical Equivalence: The Laws of Logic

Review The Conditional Logical symbols Argument forms. Logic 5: Material Implication and Argument Forms Jan. 28, 2014

Formal Logic. Critical Thinking

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

8.8 Statement Forms and Material Equivalence

DEDUCTIVE REASONING Propositional Logic

HANDOUT AND SET THEORY. Ariyadi Wijaya

Methods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

Artificial Intelligence Knowledge Representation I

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Readings: Conjecture. Theorem. Rosen Section 1.5

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

Chapter 2: The Logic of Compound Statements

Reexam in Discrete Mathematics

CS 2336 Discrete Mathematics

Practice Exam 2. You MUST show all your work, and indicate which value is the main operator value.

3 The Semantics of the Propositional Calculus

Logic Overview, I. and T T T T F F F T F F F F

(ÀB Ä (A Â C)) (A Ä ÀC) Á B. This is our sample argument. Formal Proofs

Logic and Proof. Aiichiro Nakano

CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/33

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

1.3 Propositional Equivalences

Outline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline

AMTH140 Lecture 8. Symbolic Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

15414/614 Optional Lecture 1: Propositional Logic

software design & management Gachon University Chulyun Kim

Logic and Truth Tables

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

Chapter 1: The Logic of Compound Statements. January 7, 2008

Advanced Topics in LP and FP

1.1 Statements and Compound Statements

Definition 2. Conjunction of p and q

Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science

PL: Truth Trees. Handout Truth Trees: The Setup

Language of Propositional Logic

Math Assignment 2 Solutions - Spring Jaimos F Skriletz Provide definitions for the following:

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

Proof Tactics, Strategies and Derived Rules. CS 270 Math Foundations of CS Jeremy Johnson

Propositional Logic. Fall () Propositional Logic Fall / 30

PS10.3 Logical implications

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Rules of Inference. Arguments and Validity

Deductive Systems. Lecture - 3

Math 3336: Discrete Mathematics Practice Problems for Exam I

COMP Intro to Logic for Computer Scientists. Lecture 6

Computational Intelligence Lecture 13:Fuzzy Logic

Proofs. Joe Patten August 10, 2018

Section 1.1: Logical Form and Logical Equivalence

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

Propositional Equivalence

1.1 Language and Logic

Section 3.1. Statements and Logical Connectives. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

Logic, Sets, and Proofs

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Transcription:

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 of its components. Statement Variable - a variable that represents any proposition (by convention we use lower-case letters p, q, r, s, etc.). ruth able - a calculation matrix used to demonstrate all logically possible truth-values of a given proposition. Let any statement be represented by p: p p

ruth ables Part 1 - ruth unctions for Logical Operators ruth unction - the truth-value of any compound proposition determined solely by the truth-value of its components. Statement Variable - any variable that represents a proposition (by convention we use lower-case letters p, q, r, s, etc.). ruth able - a calculation matrix used to demonstrate all logically possible truth-values of a given proposition. his is the negation of any proposition p. Negation ~ opposite truth values p ~ p

ruth ables Part 1 - ruth unctions for Logical Operators Conjunction p q p q

ruth ables Part 1 - ruth unctions for Logical Operators Conjunction p q p q number of lines equals 2 to the? power of the number of propositions L=2 n 2 2 = 4

ruth ables Part 1 - ruth unctions for Logical Operators Conjunction p q p q both are true

ruth ables Part 1 - ruth unctions for Logical Operators Disjunction p q p q at least one is true

ruth ables Part 1 - ruth unctions for Logical Operators Material Equivalence p q p q equivalent truth values

ruth ables Part 1 - ruth unctions for Logical Operators Material Implication p q p q in all cases except when the antecedent is true and the consequent is false

ruth ables Part 1 - ruth unctions for Logical Operators Material Implication in all cases except when the antecedent is true and the consequent is false If you get an A on the final exam, then you will pass Logic. (Getting an A on the final is sufficient to pass Logic.) I got an A on the final! Why did you fail me? If you get an A on the final exam, then you will pass Logic.

ruth ables Part 2 - ruth ables for Compound Propositions Method 1.a - if you already know the truth-values of the components (the long method) suppose A, B, and C are true, and D, E, and are false (A D) ( )

ruth ables Part 2 - ruth ables for Compound Propositions Method 1.b - if you already know the truth-values of the components (the short method) suppose A, B, and C are true, and D, E, and are false (A D)

ruth ables Part 3 - ruth ables for Compound Propositions Method 2 - if you do not know the actual truth value of the components, solve for all possible worlds A D (A D) line 1 line 2 line 3 line 4 L=2 3 line 5 line 6 line 7 line 8

Logical Status of Propositions I. hree types of Logical statements: A. Logically rue (tautologies) - always true B. Logically alse (self-contradiction) - always false C. Logically Contingent (truth-value dependent) - sometimes true/false

Logical Status of Propositions autology (logically true) p p ~ p every case is true

Logical Status of Propositions Self- Contradiction (logically false) p p ~ p every case is false

Logical Status of Propositions Contingent (logically dependent) p q p q variable truth-value

II. Logical Relations between two statements: A. Contradictory - opposite truth-values p q (p q) (p ~ q) Propositional Logic Logical Relationships Between Propositions

II. Logical Relations between statements: A. Contradictory - opposite truth-values B. Equivalent - identical truth-values p q (p q) :: (~q ~ p) Propositional Logic Logical Relationships Between Propositions

Logical Relationships Between Propositions II. Logical Relations between statements: A. Contradictory - opposite truth-values B. Equivalent - identical truth-values C. Consistent - at least one common (true) truth-value p q (p q) (p q)

Logical Relationships Between Propositions II. Logical Relations between statements: A. Contradictory - opposite truth-values B. Equivalent - identical truth-values C. Consistent - at least one common (true) truth-value D. Inconsistent - no common (true) truth-value p q (p q) (p ~ q)

Logical Relationships Between Propositions I. hree types of Logical statements: A. Logically rue (tautologies) - always true B. Logically alse (self-contradiction) - always false C. Logically Contingent (truth-value dependent) - sometimes true/false II. Logical Relations between statements: A. Contradictory - opposite truth-values B. Equivalent - identical truth-values C. Consistent - at least one common (true) truth-value D. Inconsistent - no common (true) truth-value

III. esting Arguments for Validity: A. Symbolize the argument Propositional Logic ruth ables or Arguments B. Separate each proposition (premises and conclusion) with slashes on a single one C. ill in truth values (just as you would for a compound proposition) D. Look for a line with true premises and false conclusion

ruth ables or Arguments III. esting Arguments for Validity: A. Symbolize B. Separate C. ill in D. Look If minors who commit murder are equally responsible for their crimes as adults, they should receive the death penalty. But they re not. So, minors should not receive the death penalty. M D M D / ~M // ~D Invalid (denying the antecedent)

III. esting Arguments for Validity: A.Symbolize B. Separate C. ill in D.Look Propositional Logic ruth ables or Arguments If minors who commit murder are equally responsible for their crimes as adults, they should receive the death penalty. And, they are. So, minors should receive the death penalty. M D M D / M // D Valid (modus ponens)

III. esting Arguments for Validity: A.Symbolize B. Separate C. ill in D.Look Propositional Logic ruth ables or Arguments If minors who commit murder are equally responsible for their crimes as adults, they should receive the death penalty. But it s not the case that they deserve the death penalty. So, minors are not equally responsible for their crimes. M D M D / ~ D // ~ M Valid (modus tollens)

III. esting Arguments for Validity: A.Symbolize B. Separate C. ill in D.Look Propositional Logic ruth ables or Arguments Either minors who commit murder are equally responsible for their crimes as adults, or they should receive the death penalty. But it s not the case that they are equally responsible. So, they should receive the death penalty. M D M D / ~ M // D Valid (disjunctive syllogism)

M D W M D / D W // M W If minors who commit murder are equally responsible for their crimes as adults, then they should receive the death penalty. If they should receive the death penalty, then we should feel sorry for them. So, if minors who commit murder are equally responsible, then we should feel sorry for them. Valid (hypothetical syllogism) Propositional Logic ruth ables or Arguments