Geometry Logic.

Slides:



Advertisements
Similar presentations
Logic Day Two.
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.
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.
Aim: Logic – Conjunction/Disjunction Course: Math Lit. Do Now: Aim: What is the conjunction and disjunction of the truth? True or False Math is a 4-letter.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Symbolic Logic. Objectives Determine if a sentence or question is a statement or not. Write a sentence that represents the negation of a given statement.
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.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Tweedledum: “I know what you’re thinking, but it isn’t so. No how.” Tweedledee: “Contrariwise, if it was so, it might be; and if it were so, it would be;
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.
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.
Course Outline Book: Discrete Mathematics by K. P. Bogart Topics:
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.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Chapter 1 Section 1.2 Symbolic Logic. Sentences vs Statements A truth value is one of two words either true (T) or false (F). A statement is a particular.
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 !
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.
Conjunction A conjunction is a compound statement formed by combining two simple sentences using the word “AND”. A conjunction is only true when both.
Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and q,
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 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.
MADAM SITI AISYAH ZAKARIA. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC LOGICAL CONNECTIVES CONDITIONAL STATEMENT.
MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,
How do I show that two compound propositions are logically equivalent?
Thinking Mathematically
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.
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.
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.
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,
Logic Terminology Statement- declarative sentence that is either true or false Opinion- a belief about matters commonly considered to be subjective,
Outline Logic Propositional Logic Well formed formula Truth table
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.
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.
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
INTRODUCTION TO LOGIC. PURPOSE: – To distinguish good arguments from poor ones Arguments consist of STATEMENTS – A statement is a sentence that can be.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Simple Logic.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Thinking Mathematically
Truth Tables and Equivalent Statements
Presentation transcript:

Geometry Logic

Logic What is Logic? It is our ability to reason. It is the foundation of sound thinking.

Where do we start? I start with the question: What is a sentence? Every good sentence needs a noun or subject, an action word or a verb and an object or the completion of the idea of the sentence.

How is a mathematical sentence different from an grammatical sentence? A mathematical sentence has a certain truth value. It is called a closed sentence. A sentence whose truth value is uncertain is called an open sentence.

Negation The negation of a sentence changes the truth value of the original sentence. It is represented by the symbol ~. If p represents my sentence then ~p represents it’s negation.

Try This In the space provided write a sentence in words. Then write the negation of that sentence in words.

Logical Connectors A conjunction connects two simple sentences using the word “and “ to make a compound sentence. Given the two simple sentences Sara goes swimming. Tom is a life guard. The conjunction would be Sara goes swimming and Tom is a life guard

Logical Connectors with symbols The word And is represented by the symbol  Example Let p represent: Sara goes swimming. Let q represent: Tom is a life guard. Sara goes swimming and Tom is a life guard. Would be represented by: pq

The compound sentence p  q is only true when both individual sentences are true. F

Disjunction Connective A disjunction connects two simple sentences using the word “or “ to make a compound sentence. Given the two simple sentences Sara will study Sara goes to the movies The compound sentence would be Sara will study or Sara goes to the movies

Using Symbols The connector “or” is represented by the symbol “.” Example: Let p represent: Sara will study Let q represent: Sara goes to the movies Sara will study or Sara will go to the movies. represents: p  q

The disjunction p  q is only false when both p and q are false. p q p  q T F

A conditional is a compound sentence usually formed by the words if… A conditional is a compound sentence usually formed by the words if….then to combine 2 simple sentences. The  is used to represent if…then. Given the simple sentences John studies John gets good grades The compound sentence would be: If John studies then John gets good grades.

Using Symbols A conditional statement is also called an implication p implies q. Let p represent: John studies Let q represent: John gets good grades If John studies then John gets good grades. Represent by: p  q

In a conditional statement the p sentence is called the hypothesis or the premise and the q sentence is called the conclusion.

The conditional statement is only false when a true hypothesis implies a false conclusion. q p q T F

Homework In the text book Pg. 41 Numbers 48-61 Pg. 47 Numbers 13-20