Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.

Slides:



Advertisements
Similar presentations
Logic ChAPTER 3.
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.
Constructing a Truth Table
Logic & Critical Reasoning
Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.
Truth Tables Presented by: Tutorial Services The Math Center.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
Propositional Equivalences. L32 Agenda Tautologies Logical Equivalences.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
TF truth, falsity, and indeterminacy P is truth-functionally true iff it has the value T for any truth-value assignment. P is truth-functionally false.
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.
2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.
Boolean Algebra Computer Science AND (today is Monday) AND (it is raining) (today is Monday) AND (it is not raining) (today is Friday) AND (it is.
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.
Phil 120 week 1 About this course. Introducing the language SL. Basic syntax. Semantic definitions of the connectives in terms of their truth conditions.
Homework 3.
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.
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-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
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.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
The Foundations Logic and Proofs by raedRASHEED 2014.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
Boolean Algebra. Logical Statements A proposition that may or may not be true:  Today is Monday  Today is Sunday  It is raining.
Chapter 7 Logic, Sets, and Counting
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.
CS1022 Computer Programming & Principles Lecture 1 Logic and Proof.
Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.
How do I show that two compound propositions are logically equivalent?
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Welcome to Interactive Chalkboard
Logic Statement-any sentence that is either true or false Statement-any sentence that is either true or false Truth value-the truth or falsity of a statement.
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.
Introductory Logic PHI 120 Presentation: "Truth Tables – Validity vs. Soundness" This PowerPoint Presentation contains a large number of slides, a good.
Lesson 20 INTERPRETING TRUTH TABLES. Review Conditional Statements (Less. 17) Original If p, then q. Converse If q, then p. Inverse If ~p, then ~q. Contrapositive.
Formal Test for Validity. EVALUATIONS Evaluations An evaluation is an assignment of truth-values to sentence letters. For example: A = T B = T C = F.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Boolean Logic.
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.
Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College.
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,
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.
Lesson 2-2.B Logic: Truth Tables. 5-Minute Check on Lesson 2-2.A Transparency 2-2 Make a conjecture about the next item in the sequence. 1. 1, 4, 9, 16,
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
Assign Yourself and Do Now Thursday, January 10, 2013.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
Test #2 Practice MGF 1106 Summer 2011.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Presentation transcript:

Notes - Truth Tables fun, fun, and more fun!!!!

A compound statement is created by combining two or more statements, p and q.

Conjunction uses the word “ and” Symbol ^ True only when all parts are true

Disjunction uses the word “or” Symbol v True if any one of its parts are true

truth table a table that lists all possible combinations of truth values ****Be sure to include all possible combinations of truth values for each piece of the compound statement***

Conjunction pqp ^ q TTT TFF FTF FFF

Disjunction pqp v q TTT TFT FTT FFF

Negation p~p TF FT

A statement whose truth table contains only True in the final column is a tautology A statement whose truth table contains only False in the final column is a contradiction

Conditional – think only time false is a broken promise pqp q TTT TFF FTT FFT

Example 1. ~(p v q) pq TT TF FT FF

pqp v q~(p v q) TTTF TFTF FTTF FFFT

Example 2. p ^ ~q pq TT TF FT FF

pq~ qp ^ ~q TTFF TFTT FTFF FFTF

Ex 3. (p ^ q) q pq TT TF FT FF

pqp ^ q (p ^ q) q TTTT TFFT FTFT FFFT

Ex 4. (p v q) ~p pq TT TF FT FF

pqp v q~ p (pvq) ~p TTTFF TFTFF FTTTT FFFTT

(p ^ q) v (p ^ r) p T T T T F F F F

pqrp ^ qp ^ r (p ^ q) v (p ^ r) TTTTTT TTFTFT TFTFTT TFFFFF FTTFFF FTFFFF FFTFFF FFFFFf