Symbolic Logic 2/25/2019 rd.

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Logic ChAPTER 3.
Propositional Equivalences
CS128 – Discrete Mathematics for Computer Science
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
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 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
Discrete Mathematics Math 6A Instructor: M. Welling.
Adapted from Discrete Math
IB Math Studies – Topic 3. IB Course Guide Description.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
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.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
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.
Thinking Mathematically
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
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 The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
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,
Inverse, Contrapositive & indirect proofs Sections 6.2/6.3.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Logic Terminology Statement- declarative sentence that is either true or false Opinion- a belief about matters commonly considered to be subjective,
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
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.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
 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.
Chapter 1 Propositional Logic
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
Logic Day #2 Math Studies IB NPHS Miss Rose
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
Thinking Mathematically
Truth Tables and Equivalent Statements
Logic.
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
(CSC 102) Discrete Structures Lecture 2.
CPCS222 Discrete Structures I
Mathematics for Computing
CMSC Discrete Structures
Chapter 8 Logic Topics
2 Chapter Introduction to Logic and Sets
Propositional Equivalences
Information Technology Department
CS 220: Discrete Structures and their Applications
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
TRUTH TABLES.
(1.4) An Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Equivalent Statements
Statements of Symbolic Logic
Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
Presentation transcript:

Symbolic Logic 2/25/2019 rd

Pitfalls This statement is false. vs. This statement is true. Please answer yes/no. Will the next word out of your mouth be "No?" ~ LIAR! Have you lived here all your life? ~ No, not yet. Hippie, you lost a shoe. ~ Oh, no I found one. Russell's paradox- Can you shave everyone in this room who doesn't shave him or herself? If you can, I'll give you $1M. 2/25/2019 rd

Aristotelian Logic Principle of Identity ~ X = X. Principle of excluded middle ~ To be or not to be; true or false Principle of contradiction ~ Propositions cannot be true and false; only true or false. 2/25/2019 rd

Propositions p: 2 + 4 = 10; q: 3 + 12 = 15; r: x – 3 = 13 p is false; q is true; and r is not a proposition. Negation symbol ~; Universal Quantifier Existential Quantifier Conjunction ^ AND p ^ q Truth Values p q p^q p ~p 0 0 0 0 0 1 0 0 1 1 0 0 1 1 1 2/25/2019 rd

Symbols Disjunction v OR p v q p q p v q p => q 0 0 0 1 0 1 1 1 1 0 1 0 1 1 1 1 Implication => implies p => q means p implies q Converse of p => q is q => p Inverse of p => q is ~p => ~q Contrapositive of p => q is ~q => ~p equivalent to p => q 2/25/2019 rd

Tautologies A compound proposition that is true regardless of the truth values of its components. p v ~p p ~p p v ~p 0 1 1 1 0 1 2/25/2019 rd