Truth Tables Presented by: Tutorial Services The Math Center.

Slides:

Advertisements

Similar presentations

Geometry Logic.

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

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.

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.

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.

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,

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.

Logic ChAPTER 3.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.

Normal or Canonical Forms Rosen 1.2 (exercises). Logical Operators  - Disjunction  - Conjunction  - Negation  - Implication p  q   p  q  - Exclusive.

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.

Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.

Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.

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.

MATH 102 Contemporary Math S. Rook

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.

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)

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.

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,

MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.

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.

Thinking Mathematically

6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.

Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.

3.1 Statements and Quantifiers 3.2 Truth Tables.  A statement is a declarative sentence that is either true or false.  Examples: Mr. Healey is my math.

Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.

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.

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.

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

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,

UNIT 01 – LESSON 10 - LOGIC ESSENTIAL QUESTION HOW DO YOU USE LOGICAL REASONING TO PROVE STATEMENTS ARE TRUE? SCHOLARS WILL DETERMINE TRUTH VALUES OF NEGATIONS,

Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.

رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.

CSS342: Propositions1 Professor: Munehiro Fukuda.

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.

 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.

Ms. Andrejko 2-2 Logic. Real World Legally Blonde.

Assign Yourself and Do Now Thursday, January 10, 2013.

Reasoning and Proof Chapter Use Inductive Reasoning Conjecture- an unproven statement based on an observation Inductive reasoning- finding a pattern.

 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.

Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.

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,

Presented by: Tutorial Services The Math Center

Thinking Mathematically

Presentation transcript:

Truth Tables Presented by: Tutorial Services The Math Center

Truth Tables A truth table is a device used to determine when a compound statement is true or false. A truth table is a device used to determine when a compound statement is true or false. Formal Name SymbolRead Symbolic Form Negation~“Not”~p Conjunction “ And” p q Disjunction “ Or” p q Conditional“If-then” Bi-conditional “If and only If” p q Connectives used in truth tables:

Types of Arguments pq TTT TFF FTF FFF Conjunction When finding the truth value of a conjunction, all values must be true in order for the entire conjunction to be true. For example, if p and q are true, then (p  q) is true. For example, if p is true and q is false, (p  q) is false. For example, if p and q are false, then (p  q) is false.

Types of Arguments pq TTT TFT FTT FFF Disjunction When finding the truth value of a disjunction, only one value needs to be true in order for the entire disjunction to be true. For example, if p is true and q is false, then (p  q) is true. For example, if both p and q are true, then (p  q) is true. For example, if both p and q are false, then (p  q) is false.

Types of Arguments p~p TF FT Negation The truth values of ~p are exactly the opposite truth values of p. For example, true for p would be false for ~p. For example, false for (p  q) would be true for ~(p  q).

Types of Arguments pq p q TTT TFF FTT FFT Conditional When finding the truth value of a conditional statement, same values will be true. Otherwise, follow the truth value of the conclusion (which is the second proposition). For example, if p and q are false, then (p  q) is true. For example, if p is true and q is false, then (p  q) is false. For example, if p is false and q is true, then (p  q) is true.

Types of Arguments pq TTT TFF FTF FFT Bi-conditional When finding the truth value of a bi-conditional statement, same values will be true. Otherwise, the truth value will be false. For example, if both p and q are false, then (p  q) is true. For example, if p is true and q is false, then (p  q) is false. For example, if p is false and q is true, then (p  q) is false.

Examples pq p  q ~q TTTFT TFFTT FTFFF FFFTF Example1:

Examples pqr~r q ~r TTTFFF TTFTTT FFTFFT FTTFFT TFFTFF TFTFFF FTFTTT FFFTFT Example 2:

Examples pqr~r q ~r TTTFFF TTFTTT FFTFFT FTTFFT TFFTFF TFTFFF FTFTTF FFFTFT Example 3:

Truth Tables Links  Truth Tables Handout Truth Tables Handout Truth Tables Handout