Lecture 10 varieties of necessity tautological equivalence

Slides:



Advertisements
Similar presentations
Exercises for CS1512 Weeks 7 and 8 Propositional Logic 1 (questions + solutions)
Advertisements

Computing Truth Value.
Chapter 21: Truth Tables.
Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
CS1502 Formal Methods in Computer Science Lecture Notes 3 Consequence Rules Boolean Connectives.
Part 2 Module 2 The Conditional Statement. The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq.
fitch rules for negation
Semantics of SL and Review Part 1: What you need to know for test 2 Part 2: The structure of definitions of truth functional notions Part 3: Rules when.
1 CS1502 Formal Methods in Computer Science Lecture Notes 4 Tautologies and Logical Truth.
Part 2 Module 2 The Conditional Statement. The Conditional Statement A conditional statement is a statement of the form "If p, then q," denoted pqpq.
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.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Propositional Equivalence Goal: Show how propositional equivalences are established & introduce the most important such equivalences.
Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.
CSCI2110 – Discrete Mathematics Tutorial 8 Propositional Logic Wong Chung Hoi (Hollis)
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.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
CS1502 Formal Methods in Computer Science Lecture Notes 16 Review for Exam2 continued Theory of Computation Introduction.
PHIL012 Class Notes 1/12/2001. Outline Announcements, web page Names and Predicates Sentences, claims, and truth value Atomic sentences Homework Problems.
Truth Functions Relationships A function is a relation that links members of sets. The set of all x which are in relation R with some y is called the.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
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.
How do I show that two compound propositions are logically equivalent?
Thinking Mathematically
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
The Logic of Boolean Connectives Chapter 4 Language, Proof and Logic.
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
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.
Introduction to Logic © 2008 Pearson Addison-Wesley.
The Foundations: Logic and Proofs
Propositional Equivalence
DISCRETE MATHEMATICS CHAPTER I.
Truth Tables and Equivalent Statements
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
Chapter 1 Logic and Proofs.
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
How do I show that two compound propositions are logically equivalent?
Biconditional - 2 CS-708.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Discrete Mathematics Lecture # 2.
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Truth Functions.
1.2 Propositional Equivalences
Propositional Equivalences
Truth Tables Hurley
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
PROPOSITIONAL LOGIC - SYNTAX-
Logical Truth To show a statement A is a logic truth (tautology) ...
1.2 Propositional Equivalences
Statements of Symbolic Logic
TRUTH TABLES.
1.2 Propositional Equivalences
Logical truths, contradictions and disjunctive normal form
Logical equivalence.
Presentation transcript:

Lecture 10 varieties of necessity tautological equivalence tautological consequence

Logical truth and tarski’s world necessities Let’s call a sentence Tarski’s World-necessary (TW-necessary) just in case it is true in all the worlds that can possibly be constructed in Tarski’s World. What’s the relationship between logical truth and TW-necessity? All logical truths are TW-necessary. Some TW-necessities are not logical truths, e.g., ‘Tet(a) ∨ Cube(a) ∨ Dodec(a).’ So the logical necessities are a strict subset of the TW-necessities.

Exercise 4.8 For each of the following sentences, say where it goes in the following Euler circle diagram 5. Larger(a,b) ∨ ¬Larger(a,b) 6. Larger(a,b) ∨ Smaller (a,b)

i>clicker question ‘¬[¬Tet(a) ∧ ¬Cube(a) ∧ ¬Dodec(a)]’ is A tautology A TW-necessity A and B None of the above

Logical and tautological equivalence

equivalence Our informal definition of equivalence, like our informal definition of logical truth, also referred to possible worlds: P and Q are equivalent if and only if they are true in all and only the same possible worlds. With our different conceptions of possibility and necessity, we can distinguish different kinds of equivalence: tautological equivalence logical equivalence, and TW-equivalence.

Tautological equivalence To give a more precise definition of tautological equivalence, we will use the notion of sentences’ joint truth tables. The joint truth table for A and B is the truth table with both sentences to the right of the reference columns. Sentences A and B are tautologically equivalent if and only if at each row, the truth value under A’s main connective is the same as the truth value under B’s main connective. A A ∨ ¬A A ∧ ¬A T T F F F F T T F T Do some examples: (A and not-A) or B  B (A or not-A) and B  B

Some important logical equivalences DeMorgan’s Laws Double Negation

Tautological equivalence and logical equivalence All tautological equivalences are logical equivalences. But remember how not all logical truths were tautologies? Similarly, not all tautological equivalences are logical equivalences. Example: ‘a = b’ is logically but not tautologically equivalent to ‘¬FrontOf(a,b).’