1 CS1502 Formal Methods in Computer Science Lecture Notes 4 Tautologies and Logical Truth.

Slides:



Advertisements
Similar presentations
Computing Truth Value.
Advertisements

Chapter 21: Truth Tables.
Logic & Critical Reasoning
Lecture 10 varieties of necessity tautological equivalence
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.
Formal Semantics of S. Semantics and Interpretations There are two kinds of interpretation we can give to wffs: –Assigning natural language sentences.
For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
Truth Trees Intermediate Logic.
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.
Today’s Topics n Review of Grouping and Statement Forms n Truth Functions and Truth Tables n Uses for Truth Tables n Truth Tables and Validity.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
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.
Let remember from the previous lesson what is Knowledge representation
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
No new reading for Monday or Wednesday Exam #2 is next Friday, and we’ll review and work on proofs on Monday and Wed.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.
1 CS 1502 Formal Methods in Computer Science Lecture Notes 12 Variables and Quantifiers.
CS 1502 Formal Methods in Computer Science
INTRODUCTION TO LOGIC FALL 2009 Quiz Game. ConceptsTrue/FalseTranslations Informal Proofs Formal Proofs
Intro to Discrete Structures
CS1502 Formal Methods in Computer Science Lecture Notes 1 Course Information Introduction to Logic Part 1.
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.
COMMONWEALTH OF AUSTRALIA Copyright Regulations 1969 WARNING This material has been reproduced and communicated to you by or on behalf of Monash University.
CS1502 Formal Methods in Computer Science
Verifying Arguments MATH 102 Contemporary Math S. Rook.
Can’t be c can’t be b Could be cthis is bcould be c.
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
The Logic of Quantifiers Chapter 10 Language, Proof and Logic.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
4. Computer Maths and Logic 4.2 Boolean Logic Simplifying Boolean Expressions.
2.8 Methods of Proof PHIL 012 1/26/2001.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
1 CA 208 Logic PQ PQPQPQPQPQPQPQPQ
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
Thinking Mathematically Arguments and Truth Tables.
CS6133 Software Specification and Verification
IB Computer Science – Logic
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
The Logic of Atomic Sentences Chapter 2 Language, Proof and Logic.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
1 CS1502 Formal Methods in Computer Science Notes 15 Problem Sessions.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
The Logic of Boolean Connectives Chapter 4 Language, Proof and Logic.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
2. The Logic of Compound Statements Summary
Lecture Notes 8 CS1502.
How do I show that two compound propositions are logically equivalent?
Introduction to Logic Lecture 14 The truth functional argument
Truth Tables How to build them
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
CS 1502 Formal Methods in Computer Science
Truth Tables Hurley
Truth Trees.
3.5 Symbolic Arguments.
The Logic of Declarative Statements
TRUTH TABLES.
Introductory Logic PHI 120
Truth Tables for the Conditional and Biconditional
Logical and Rule-Based Reasoning Part I
SUMMARY Logic and Reasoning.
3.5 Symbolic Arguments.
Presentation transcript:

1 CS1502 Formal Methods in Computer Science Lecture Notes 4 Tautologies and Logical Truth

2 Constructing a Truth Table Write down sentence Create the reference columns Until you are done: –Pick the next connective to work on –Identify the columns to consider –Fill in truth values in the column EG: ~(A ^ (~A v (B ^ C))) v B (in Boole and on board)

3 Tautology A sentence S is a tautology if and only if every row of its truth table assigns true to S.

4 Example Is  (A  (  A  (B  C)))  B a tautology?

5 Example

6 Logical Possibility A sentence S is logically possible if it could be true (i.e., it is true in some world) It is TW-possible if it is true in some world that can be built using the program

7 Examples Cube(b)  Large(b)  (Tet(c)  Cube(c)  Dodec(c)) e  e Logically possibleTW-possible Not TW-possibleLogically possible Not Logically possible

8 Spurious Rows A spurious row in a truth table is a row whose reference columns describe a situation or circumstance that is impossible to realize on logical grounds.

9 Example Spurious!

10 Logical Necessity A sentence S is a logical necessity (logical truth) if and only if S is true in every logical circumstance. A sentence S is a logical necessity (logical truth) if and only if S is true in every non- spurious row of its truth table. Logical-Necessity TW-Necessity

11 Example Logical NecessityTW-NecessityNot a tautology

12 Example Not a TW-NecessityNot a Logical NecessityNot a tautology According to the book, the first row is spurious, because a cannot be both larger and smaller than b. Technically, though, “Larger” and “Smaller” might mean any relation between objects. So, the first row is really only TW-spurious. This issue won’t come up with any exam questions based on this part of the book. (The book refines this later.)

13 Tet(b)   Tet(b) a=a Tet(b)  Cube(b)  Dodec(b) Cube(a)  Small(a) Cube(a) v Cube(b)

14 Tautological Equivalence Two sentences S and S’ are tautologically equivalent if and only if every row of their joint truth table assigns the same values to S and S’.

15 Example S and S’ are Tautologically Equivalent SS’

16 Logical Equivalence Two sentences S and S’ are logically equivalent if and only if every non-spurious row of their joint truth table assigns the same values to S and S’.

17 Example Not Tautologically equivalentLogically Equivalent SS’

18 Tautological Consequence Sentence Q is a tautological consequence of P 1, P 2, …, P n if and only if every row that assigns true to all of the premises also assigns true to Q. Remind you of anything? P1,P2,…,Pn | Q is also a valid argument! A Con Rule: Tautological Consequence

19 Example Tautological consequence premisesconclusion

20 Logical Consequence Sentence Q is a logical consequence of P 1, P 2, …, P n if and only if every non- spurious row that assigns true to all of the premises also assigns true to Q.

21 Not a tautological consequence Is a logical consequence premiseconclusion

22 Summary Necessary S is always true Possible S could be true Equivalence S and S’ always have the same truth values Consequence Whenever P1…Pn are true, Q is also true Tautological All rows in truth table S is a tautology S is Tautologically possible S and S’ are Tautologically equivalent Q is a tautological consequence of P1…Pn Logical All non-spurious rows S is logically necessary (logical truth) S is logically possible S and S’ are logically equivalent Q is a logical consequence of P1…Pn TW Logic + Tarski’s World S is TW necessary S is TW possible S and S’ are TW equivalent Q is a TW- consequence of P1…Pn

23 Summary Every tautological consequence of a set of premises is a logical consequence of these premises. Not every logical consequence of a set of premises is a tautological consequence of these premises. Tautological- Consequences of P1…Pn Logical-Consequences of P1…Pn

24 Summary Every tautological equivalence is a logical equivalence. Not every logical equivalence is a tautological equivalence. Tautological Equivalences Logical Equivalences

25 Summary Every tautology is a logical necessity. Not every logical necessity is a tautology. Tautologies Logical Necessities