Chapter 9 Logic. Problem Three dogs called Lassie, Timmy and Fido have either black, brown or tri-colour hair. The dogs have lived with their owners.

Slides:



Advertisements
Similar presentations
12.2: And and Or in Logic 1/17/ : And, Or and Not in Logic Expectations: L3.2.1:Know and use the terms of basic logic (e.g., proposition, negation,
Advertisements

Truth Functional Logic
PROOF BY CONTRADICTION
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.
IB Math Studies – Topic 3. IB Course Guide Description.
Copyright © 2015, 2011, 2008 Pearson Education, Inc. Chapter 1, Unit 1B, Slide 1 Thinking Critically 1.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Chapter 9: Boolean Algebra
Adapted from Discrete Math
IB Math Studies – Topic 3. IB Course Guide Description.
3.2 – Truth Tables and Equivalent Statements
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.
Propositions and Truth Tables
Propositions and Truth Tables. Proposition: Makes a claim that may be either true or false; it must have the structure of a complete sentence.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Conditional Statements
Chapter 1: The Foundations: Logic and Proofs
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
LOGIC Chapter 2 – Lesson 2. LOGIC  Objectives Determine truth values of negations, conjunctions, and disjunctions, and represent them using Venn diagrams.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
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.
Unit 01 – Lesson 07 – Conditional Statements
Thinking Mathematically
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
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.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
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.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Simple Logic.
Chapter 1 – Part 3 ELEMENTARY LOGIC
Introduction to Logic © 2008 Pearson Addison-Wesley.
Logic The study of correct reasoning.
Presented by: Tutorial Services The Math Center
Logic Day #2 Math Studies IB NPHS Miss Rose
Lesson 2-2.A Logic: Venn Diagrams.
Lesson 2-2 Logic A statement is a sentence that can either be true or false. The truth or falsity of a statement can be called its truth value. Compound.
AND.
DISCRETE MATHEMATICS CHAPTER I.
Thinking Mathematically
Truth Tables and Equivalent Statements
Logic.
CPCS222 Discrete Structures I
The Foundations: Logic and Proofs
Principles of Computing – UFCFA3-30-1
Logic – Bell Ringer.
Chapter 8 Logic Topics
The Lost Art of Argument
2-2 Conditional Statements
TRUTH TABLES.
(1.4) An Introduction to Logic
Logic Math Studies IB Propositions, truth tables, logic symbols, negation, conjunction, disjunction.
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
PROPOSITIONAL LOGIC - SYNTAX-
MAT 3100 Introduction to Proof
Inductive Reasoning and Conjecture, and Logic
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
Propositions and Truth Tables
8A, 8B Propositions Unit 7: Logic and Sets 8A, 8B 6/1/ :59 AM.
2-2 Logic Vocab Statement: A sentence that is either true or false
Welcome to Interactive Chalkboard
Presentation transcript:

Chapter 9 Logic

Problem

Three dogs called Lassie, Timmy and Fido have either black, brown or tri-colour hair. The dogs have lived with their owners for either 9 months, 2 years or 7 years. The dog who has lived with their owner the longest has brown hair. Fido has lived with his owner for longer than Lassie. Fido does not have tri-colour hair and Lassie does not have black hair. How long has each dog lived with its owner and what colour hair does it have?

Inductive and deductive logic

All students in this class are studying maths studies. Alix is in this class. Therefore Alix is studying maths studies. All students observed entering the maths studies class are girls. Therefore, all maths studies students are girls. Deductive LogicInductive Logic Which is better? TOK

Truth table

These are the two original propositions and the different combinations of ‘true’ and ‘false’ possible. This is the negation of p, so it’s the opposite of whatever is in p. This is the conjunction (intersection) of p and q. It is true only when both p and q are true. This is the conjunction (intersection) of p and q. It is true only when both p and q are true. This is the disjunction (union). It is true unless both both p and q are false. This is the exclusive disjunction, which means it is one or the other but not both. This is an implication, ‘p implies q’. It is true whenever p is false or when both p and q are true. This is equivalence. It is true when either both propositions are false or both are true.