Review Given p: Today is Thursday q: Tomorrow is Friday

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.

Constructing a Truth Table

Logic & Critical Reasoning

Truth Tables Presented by: Tutorial Services The Math Center.

Introduction to Symbolic Logic

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

MAT 142 Lecture Video Series. Truth Tables Objectives Construct a truth table for a given symbolic expression. Determine if two given statements are.

2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.

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.

Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.

Geometry: Logic Truth Tables!. Do Now: What is the converse, inverse, and contrapositive of the following conditional statement. If I am sleepy, then.

Truth Tables for Negation, Conjunction, and Disjunction.

3.2 – Truth Tables and Equivalent Statements

Logic ChAPTER 3.

Logic A statement is a sentence that is either true or false (its truth value). Logically speaking, a statement is either true or false. What are the values.

Truth Tables (MAT 142) Truth Tables.

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

Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.

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.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.

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.

Logic Geometry Unit 11, Lesson 5 Mrs. Reed. Definition Statement – a sentence that is either true or false. Example: There are 30 desks in the room.

Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.

Discrete Mathematics Lecture1 Miss.Amal Alshardy.

Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.

Review Complete the chart: pq Conditional p  q Converse _  _ TT TF FT FF.

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)

Statements & Truth Tables True or False This statement is true or false.? A T/F statement is a declarative sentence. It has a value of true or false, but.

Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements

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.

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,

How do I show that two compound propositions are logically equivalent?

Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.

Thinking Mathematically

Welcome to Interactive Chalkboard

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.

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,

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,

Review Find a counter example for the conjecture Given: JK = KL = LM = MJ Conjecture: JKLM forms a square.

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

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.

Aim 1.4: To work with conditionals and biconditionals Do Now: Determine the truth value of the following sentences: 1.9 is a prime number and New York.

Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction

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

Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.

MAKE SURE YOUR ASSIGNMENTS AND ASSIGNMENTS PAGE IS ON YOUR DESK. Quietly begin working on the warm- up.

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,

Truth Tables for Negation, Conjunction, and Disjunction

Thinking Mathematically

Truth Tables for Negation, Conjunction, and Disjunction

2-2 Logic Vocab Statement: A sentence that is either true or false

Presentation transcript:

Review Given p: Today is Thursday q: Tomorrow is Friday Write: 1. ~p^q 2. pv~q 1. Today is not Thursday and tomorrow is Friday 2. Today is Thursday or tomorrow is not Friday.

Geometry Unit 9, Day 3 Mr. Zampetti Truth Tables Geometry Unit 9, Day 3 Mr. Zampetti

Objective To construct truth tables and determine the truth value of compound statements.

Definition Truth Table – a convenient way to organize the truth values of statements.

Negation Truth Table p ~p T F

Truth Values Conjunctions are true ONLY when BOTH statements are true. Look at the example in your notes packet.

Conjunction Truth Table p q p^q T F Remember a conjunction is only true when BOTH are true!

Truth Values Disjunctions are true if AT LEAST ONE statement is true. Look at the example in your notes packet.

Disjunction Truth Table p q pvq T F Remember a disjunction is true when AT LEAST ONE are true!

Constructing Truth Tables GIVEN: p^~q Step 1: Make columns with headings p, q, ~q, and p^~q

p^~q p q ~q p^~q

Constructing Truth Tables p^~q Step 1: Make columns with headings p, q, ~q, and p^~q Step 2: List possibilities of p and q.

p^~q p q ~q p^~q

Constructing Truth Tables p^~q Step 1: Make columns with headings p, q, ~q, and p^~q Step 2: List possibilities of p and q. Step 3: Determine ~q by using q.

p^~q p q ~q p^~q T F

Constructing Truth Tables p^~q Step 1: Make columns with headings p, q, ~q, and p^~q Step 2: List possibilities of p and q. Step 3: Determine ~q by using q. Step 4: Determine p^~q by using p and ~q.

p^~q p q ~q p^~q T F

Make a truth table for ~pvq

Make a truth table for ~pv~q

Homework Work Packet: Truth Tables

Truth table for (pvq) ^ ~q