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

Slides:

Advertisements

Similar presentations

TRUTH TABLES Section 1.3.

Advertisements

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

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

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

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.

EE1J2 – Discrete Maths Lecture 5

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

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

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.

Valid and Invalid Arguments

MATH 102 Contemporary Math S. Rook

Normal Forms, Tautology and Satisfiability 2/3/121.

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.

Fall 2002CMSC Discrete Structures1 Let’s get started with... Logic !

1 Boolean Logic CS 202, Spring 2007 Epp, sections 1.1 and 1.2 Aaron Bloomfield.

Discrete Mathematics Lecture1 Miss.Amal Alshardy.

The Foundations Logic and Proofs by raedRASHEED 2014.

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.

Boolean Logic. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xNOT x FT TF.

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

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.

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

Chapter 7 Logic, Sets, and Counting Section 1 Logic.

Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.

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.

Boolean Algebra Monday/Wednesday 7th Week. Logical Statements Today is Friday AND it is sunny. Today is Friday AND it is rainy. Today is Monday OR it.

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.

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.

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,

Fundamental Logic Gates And, Or, Not. Logic Gates: The Basics Regulate the flow of electricity within circuits to perform desired functionalities Each.

Outline Logic Propositional Logic Well formed formula Truth table

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.

Spring 2003CMSC Discrete Structures1 Let’s get started with... Logic !

3/6/20161 Let’s get started with... Logic !. 3/6/20162 Logic Crucial for mathematical reasoningCrucial for mathematical reasoning Used for designing electronic.

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.

Chapter 1 Logic and proofs

Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.

DISCRETE MATHEMATICS CHAPTER I.

Discrete Mathematics Lecture # 2.

Presentation transcript:

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

Statements A statement is a sentence that is either true or false, but not both. These are statements: It is Wednesday. Discrete Math meets today. These are not statements: Hello. Are you there? Go away!

Logical Operators Binary operators Conjunction – “and”. Disjunction – “or”. Unary operator Negation – “not”. Other operators XOR – “exclusive or” NAND – “not both” NOR – “neither”

Logical Symbols Statements are represented by letters: p, q, r, etc.  means “and”.  means “or”.  means “not”.

Examples Basic statements p = “It is Wednesday.” q = “Discrete Math meets today.” Compound statements p  q = “It is Wednesday and Discrete Math meets today.” p  q = “ It is Wednesday or Discrete Math meets today.”  p = “It is not Wednesday.”

False Negations Statement Everyone likes me. False negation Everyone does not like me. True negation Someone does not like me.

False Negations Statement Someone likes me. False negation Someone does not like me. True negation No one likes me.

Truth Table of an Expression Make a column for every variable. List every possible combination of truth values of the variables. Make one more column for the expression. Write the truth value of the expression for each combination of truth values of the variables.

Truth Table for “and” pq p  q TTT TFF FTF FFF p  q is true if p is true and q is true. p  q is false if p is false or q is false.

Truth Table for “or” p  q is true if p is true or q is true. p  q is false if p is false and q is false. pq p  q TTT TFT FTT FFF

Truth Table for “not”  p is true if p is false.  p is false if p is true. p pp TF FT

Example: Truth Table Truth table for the statement (  p)  (q  r). pqr (  p)  (q  r ) TTTT TTFF TFTF TFFF FTTT FTFT FFTT FFFT

Logical Equivalence Two statements are logically equivalent if they have the same truth values for all combinations of truth values of their variables.

Example: Logical Equivalence (p  q)  (  p   q)  (p   q)  (  p  q) pq (p  q)  (  p   q)(p   q)  (  p  q) TTTT TFFF FTFF FFTT

DeMorgan’s Laws DeMorgan’s Laws:  (p  q)  (  p)  (  q)  (p  q)  (  p)  (  q) If it is not true that i < size && value != array[i] then it is true that…

DeMorgan’s Laws DeMorgan’s Laws:  (p  q)  (  p)  (  q)  (p  q)  (  p)  (  q) If it is not true that i < size && value != array[i] then it is true that i >= size || value == array[i]

DeMorgan’s Laws If it is not true that x  5 or x  10, then it is true that …

DeMorgan’s Laws If it is not true that x  5 or x  10, then it is true that x > 5 and x < 10.

Tautologies and Contradictions A tautology is a statement that is logically equivalent to T. It is a logical form that is true for all logical values of its variables. A contradiction is a statement that is logically equivalent to F. It is a logical form that is false for all logical values of its variables.

Tautologies and Contradictions Some tautologies: p   p p   q  (  p  q) Some contradictions: p   p p  q  (  p   q)