Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.

Slides:



Advertisements
Similar presentations
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Advertisements

Computing Truth Value.
Truth Tables The aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments. Go To Next Slide.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
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.
Logic & Critical Reasoning
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
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.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
1 CA 208 Logic Ex1 In your own words, define the following 1. Logic: 2. Valid reasoning/inference (2 equivalent definitions): 3. Propositions/statements:
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.
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
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.
For Friday, read chapter 2, sections 1-2 (pp ). As nongraded homework, do the problems on p. 19. Graded homework #1 is due at the beginning of class.
For Friday, 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. Graded.
Discussion #9 1/9 Discussion #9 Tautologies and Contradictions.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Propositional Logic Review
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Intro to Discrete Structures
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
1 Propositional Logic Proposition 2 Propositions can be divided into simple propositions and compound propositions. A simple (or basic) proposition is.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
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.
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.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
SSK3003 DISCRETE STRUCTURES
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Thinking Mathematically Arguments and Truth Tables.
CS6133 Software Specification and Verification
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Methods of Proof – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Methods of Proof Reading: Kolman, Section 2.3.
Outline Logic Propositional Logic Well formed formula Truth table
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.
CT214 – Logical Foundations of Computing Darren Doherty Rm. 311 Dept. of Information Technology NUI Galway
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
Logic.
2. The Logic of Compound Statements Summary
Discrete Mathematics Logic.
Truth Tables How to build them
Chapter 8 Logic Topics
Truth Tables Hurley
3.5 Symbolic Arguments.
The Logic of Declarative Statements
Discrete Mathematics Logic.
Logical Truth To show a statement A is a logic truth (tautology) ...
6.3 Truth Tables for Propositions
TRUTH TABLES.
Introductory Logic PHI 120
6.4 Truth Tables for Arguments
Philosophical Methods
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Symbolic Logic and Rules of Inference

whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher. Therefore, Tom is poor. This is a valid form of argument, or Rule of Inference, called Modus Ponens.

Logic is topic neutral: rules can be used for multiple topics when the form is correct

Review of Well Formed Formulas: WFFs

Finding the main connective:

Describing the parts of a well formed formula statement:

Testing arguments for validity using truth tables: P (P->Q) Therefore, Q Valid, no line has all premises true with a false conclusion.

Invalid argument Has at least one line where all premises are True and the conclusion is False: P->Q ~P Therefore ~Q This is the invalid line, where the premises are both T and the conclusion is False.

3.2/iLogic_3_2.html Truth Tables with automatic completion from Butte College in California On this website, you can click each of the little buttons (they look like Play and Rewind on a remote control) to see how the truth table fills in!

That page also has special sections for single statements and pairs of statements Single: Tautology, Contradiction, Contingent Pairs: Logically Equivalent, Logically Contradictory, Consistent and Inconsistent

Review: Types of sentences part 1:

Review: Types of sentences part 2:

~ v ⊃ ≡ Truth Functions (how the operators are true or false)

Truth Functions written out in English: ~ changes the truth value of whatever it has “scope” over from T to F and from F to T; note that some ~ are on letters and some are on brackets or parentheses. is only True if both sides are True, TT. v is only False if both sides are False, FvF. If there is even one T on one side, or T on both sides, the v is true. ⊃ is only false in a line where T ⊃ F, because that’s like a cause happening without the effect. Any other combination of T ⊃ T, F ⊃ T, or F ⊃ F is T for the ⊃. ≡ is T as long as the sides match, T≡T or F≡F is True for the ≡.

Order of Operations ~ v ⊃ ≡ 1) Tilde ~ on single letters should be done right away, after the letters themselves are already done. 2) Connectors inside parentheses should be done next, after each side in the parentheses is done. 3) Tilde ~ outside of parentheses should be done next. Make sure you are changing the truth value of the connector column, not a side column. 4) Connectors that are in between two sets of parentheses should be done next. 5) Tilde ~ on big brackets, larger brackets [] and {}