Symbolic Logic: Conjunction • , Negation ~, Disjunction v

Slides:



Advertisements
Similar presentations
Truth Functional Logic
Advertisements

Symbolic Logic: The Language of Modern Logic
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
The Language of Propositional Logic The Syntax and Semantics of PL.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Bell Work: Given the sets L = {0, 1, 2, 3}, M = {5, 6, 7}, and N = {0, 1}, are the following statements true or false? (a) 6 L (b) 0 N.
Predicates and Quantifiers
What is logic? Logic is the science of how to evaluate arguments and reasoning. Critical thinking is a process of evaluation which uses logic to separate.
Chapter 3 – Introduction to Logic
ALGEBRA 1. Lesson 1-3 Warm-Up ALGEBRA 1 Lesson 1-3 Warm-Up.
A Modern Logician Said: By the aid of symbolism, we can make transitions in reasoning almost mechanically by eye, which otherwise would call into play.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
2.2 Statements, Connectives, and Quantifiers
Comparing and ordering rational numbers
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.
Solving Linear Inequalities `. Warm-up -4 < x ≤ 6 x ≤ -4 or x>
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
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.
Thinking Mathematically
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Logic Eric Hoffman Advanced Geometry PLHS Sept
9.2 Compound Sentences Standard 5.0, 24.0 Standard 5.0, 24.0 Two Key Terms Two Key Terms.
Logic Terminology Statement- declarative sentence that is either true or false Opinion- a belief about matters commonly considered to be subjective,
Alg2 Lesson 1-4 Solving Inequalities Objectives: 1.Solve inequalities. 2.Solve combined inequalities. 3.Identify conjunctions and disjunctions. 4.Graph.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Introductory Logic PHI 120 Presentation: "Truth Tables – Sentences"
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
 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.
PHIL 012 2/14/2001 Logical Equivalence & Translation.
 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.
Simple Logic.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
Conditional Statements
1-4 Solving Inequalities
AND.
DISCRETE MATHEMATICS CHAPTER I.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 3: Introduction to Logic
Geometry Pre-AP BOMLA LacyMath 10/6.
Truth Tables – Logic (Continued)
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
The Lost Art of Argument
2 Chapter Introduction to Logic and Sets
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
TRUTH TABLES.
(1.4) An Introduction to Logic
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture 2: Propositional Logic
The Logic of Declarative Statements
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Solving Combined Inequalities
Discrete Mathematics Lecture 2: Propositional Logic
Section 3.7 Switching Circuits
Algebra 1 Section 4.5.
And represent them using Venn Diagrams.
Introductory Logic PHI 120
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Statements and Logical Connectives
2-2 Logic Vocab Statement: A sentence that is either true or false
CHAPTER 3 Logic.
Presentation transcript:

Symbolic Logic: Conjunction • , Negation ~, Disjunction v Examples

Review Conjunction = “…and…” = • Negation = “not…” = ~ Conjunction is only true if both conjuncts are true Negation = “not…” = ~ Negation of a statement is true if statement is false Negation of a statement is false if statement is true Disjunction = “…or…” = v Disjunction is true if either disjunct is true

Example: Translate the Following It is not true that evil spirits exist. First step: Make a dictionary (define statements) Second step: Look at the sentence, symbolize statements correctly (using •, ~, or v) (Third step: Determine truth values)

Solution It is not true that evil spirits exist. ~E E=Evil spirits exist. If evil spirits do exist (E is True), then ~E is false. If evil spirits do not exist (E is False), then ~E is true.

Example 2. There were three people involved in the accident, and no one was injured. Note: When symbolizing statements, always make the statement a positive one. If you have a negative statement in the sentence, put its positive in the dictionary – then when you translate, simply negate that sentence.

Solution 2. There were three people involved in the accident, and no one was injured. T • ~O T=Three people were involved in the accident. O=Someone was injured.

3. You cannot be a sailor and a marine both. Example 3. You cannot be a sailor and a marine both.

3. You cannot be a sailor and a marine both. Solution 3. You cannot be a sailor and a marine both. ~(S • M) S=You can be a sailor. M=You can be a marine.

Example 4. More educators, more administrators, and more students are turning to philosophy to provide them with the skills of reasoning.

Solution 4. More educators, more administrators, and more students are turning to philosophy to provide them with the skills of reasoning. (E • A) • S or E • (A • S) E=More educators are turning to philosophy to provide them with the skills of reasoning. A=More administrators are turning… S=More students are turning…

5. Either you are male or female but not both. Example 5. Either you are male or female but not both.

5. Either you are male or female but not both. Solution 5. Either you are male or female but not both. (M v F) • ~(M • F) M=You are male. F=You are female.

Example: Determine Truth Values Given: A, B, and C are TRUE statements Given: X, Y, and Z are FALSE statements Is the following true or false? ~Y v C

Solution ~Y v C 1. We know that Y is False 2. Since Y is false, this makes ~Y True. 3. We also know that C is True 4. Therefore, we have two true disjuncts (C and ~Y) 5. The main connective here is the wedge (v) and we know that a disjunction is false only if both disjuncts are false. 6. Therefore, ~Y v C is true.

Given: A, B, and C are True X, Y, and Z are False Example Determine whether the following is true: (B v C) • (Y v Z) Given: A, B, and C are True X, Y, and Z are False

Solution (B v C) • (Y v Z) Look at one conjunct at a time. We have two here: (B v C) and (Y v Z) (B v C): since we know B and C are both true, this makes this disjunction true (Y v Z): since we know that Y and Z are both false, this makes this disjunction false Since we now know the whole left conjunct (B v C) is true, and that the right conjunct (Y v Z) is false, the conjunction of the two must be false (for a conjunction to be true, both conjuncts must be true)

Given: A, B, and C are True X, Y, and Z are False Example Determine whether the following is true: ~(A v C) v ~(X • ~Y) Given: A, B, and C are True X, Y, and Z are False

Solution ~(A v C) v ~(X • ~Y) The main connective = the middle wedge (v) (disjunction) Therefore we have two disjuncts Left disjunct= ~(A v C) Right disjunct = ~(X • ~Y) Strategy: determine truth values of each disjunct, then we know if at least one disjunct is true, this will make the whole statement true

Solution (continued) ~(A v C) v ~(X • ~Y) Left disjunct: ~(A v C) Both A and C are true. This makes (A v C) true. But (A v C) is negated, so ~(A v C) is false. Right disjunct: ~(X • ~Y) X is false. Y is false, so this means ~Y is true. This makes the inner conjunction false (to be true, both conjuncts (X and ~Y) must both be true) Because the whole statement (X • ~Y) is false, this makes its negated form ~(X • ~Y) true Since the left disjunct is false, and the right disjunct is true, this means ~(A v C) v ~(X • ~Y) is true (since at least one disjunct is true)

Questions? Any problems you want to see worked out (if time permits)?