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.

Slides:



Advertisements
Similar presentations
Geometry Logic.
Advertisements

TRUTH TABLES Section 1.3.
Constructing a Truth Table
Chapter 21: Truth Tables.
Logic & Critical Reasoning
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.
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.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 3 Syntax of Propositional Logic Parse trees revised Construction of parse trees Semantics of propositional.
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.
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. 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 1 60% of Exam 1 warm-up.
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:
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
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.
Intro to Discrete Structures
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.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
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.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
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 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Conditional Statements
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.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
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?
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
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.
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.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
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.
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
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
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 =
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
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,
2. The Logic of Compound Statements Summary
Truth Tables How to build them
6.1 Symbols and Translation
Chapter 8 Logic Topics
Statements of Symbolic Logic
Introductory Logic PHI 120
Presentation transcript:

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 ~ p F T

Conjunction (Asserts both statements are true.) p · q T F

Disjunction (Asserts at least one statement is true.) p v q T F

Material Equivalence (Asserts the statements always have the same truth value.) p  q T F

(Antecedent sufficient for consequent) Material Implication (Antecedent sufficient for consequent) One must assume that a material implication is true unless one can prove that it’s false. If you make a perfect score on all your work, then you make an A for the course. p  q T F

To determine how many lines a truth table will have use this formula: Lines = 2n n = the number of different letters (simple statements) in the statement. Starting with the left most letter, divide the table in half. Assign T as the value of the left most letter for the first half of the table, and F as its value for the second half of the table. Move to the next new letter to the right, and cut the alternation between T & F in half. Repeat this process until you are alternating between T& F line by line for the right most letter.

Tautology: A statement in which the form necessitates that it be true Tautology: A statement in which the form necessitates that it be true. It’s truth table has T on every line beneath its main symbol. Self-Contradiction: A statement in which the form necessitates that it be false. It’s truth table has F on every line beneath its main symbol. Contingent Statement: A statement in which the truth value is contingent upon the particular combination of values you have for its letters (simple statements). It’s truth table has T on some lines and F on some lines beneath its main symbol.

Logically Equivalent Statements: The two statements have the same truth value on every line beneath their main symbols. Logically Contradictory Statements: The two statements have the opposite truth values on every line beneath their main symbols.

Consistent Statements: The statements are neither equivalent nor contradictory. There is at least one line on which both statements are true. Inconsistent Statements: There is not at least one line on which both statements are true.

If there is no line on which all the premises are true and the conclusion false, then the argument is valid. If there is even one line on which all the premises are true and the conclusion false, then the argument is invalid.