Today’s Topics Review of Sample Test # 2 A Little Meta Logic.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Truth Functional Logic
Logic & Critical Reasoning
Logic Use mathematical deduction to derive new knowledge.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Use a truth table to determine the validity or invalidity of this argument. First, translate into standard form “Martin is not buying a new car, since.
CS128 – Discrete Mathematics for Computer Science
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Logic 2 The conditional and biconditional
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
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.
Knoweldge Representation & Reasoning
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Today’s Topics Using CP and RAA Things to watch for, things to avoid Strategic hints for using CP and RAA A Little Metalogic and some History of Logic.
Adapted from Discrete Math
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Discrete Mathematics and Its Applications
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Methods of Proof involving  Symbolic Logic February 19, 2001.
Chapter Six Sentential Logic Truth Trees. 1. The Sentential Logic Truth Tree Method People who developed the truth tree method: J. Hintikka— “model sets”
DeMorgan’s Rule DM ~(p v q) :: (~p. ~q)“neither…nor…” is the same as “not the one and not the other” ~( p. q) :: (~p v ~q) “not both…” is the same as “either.
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.
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.
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
Natural Deduction Proving Validity. The Basics of Deduction  Argument forms are instances of deduction (true premises guarantee the truth of the conclusion).
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
Chapter Five Conditional and Indirect Proofs. 1. Conditional Proofs A conditional proof is a proof in which we assume the truth of one of the premises.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
assumption procedures
Introductory Logic PHI 120 Presentation: “Solving Proofs" Bring the Rules Handout to lecture.
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.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
ARTIFICIAL INTELLIGENCE Lecture 2 Propositional Calculus.
Outline Logic Propositional Logic Well formed formula Truth table
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Today’s Topics Argument forms and rules (review)
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
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 =
Simple Logic.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
a valid argument with true premises.
Today’s Topics Symbolizing conditionals and bi-conditionals
Truth Tables and Equivalent Statements
{P} ⊦ Q if and only if {P} ╞ Q
6.1 Symbols and Translation
Chapter 8 Logic Topics
Information Technology Department
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Logic Use mathematical deduction to derive new knowledge.
CS 270 Math Foundations of CS
TRUTH TABLES.
Applied Discrete Mathematics Week 1: Logic
TRUTH TABLES continued.
Discrete Mathematics and Its Applications Kenneth H
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 7. Propositional and Predicate Logic
Statements of Symbolic Logic
Presentation transcript:

Today’s Topics Review of Sample Test # 2 A Little Meta Logic

1)If an argument is valid, then its premises must be true. False 2) If, from an assumption, you can derive a WFF, then you may derive a conditional whose antecedent is the assumption and whose consequent is the WFF derived. TRUE 3) The English expression "only if" introduces the consequent of a conditional. TRUE 4) An argument with contradictory premises is guaranteed to be valid. TRUE 5) Two valid arguments whose conclusions contradict one another cannot both be sound. TRUE

An argument with contradictory premises is guaranteed to be valid because anything follows from a contradiction. If the premises contain a contradiction, any conclusion would follow from them. (Consider IP)

Statement forms a){[(~P v Q)  R]  (Q  ~T)} conditional b)~{[(P v Q)  R]  (Q  ~T)} negation c)([(~P v Q)  R]  Q)  ~T biconditional d)(~P v Q)  [R  (Q  ~T)] conjunction e)~P v {Q  [R (Q  ~T)]} disjunction

Equivalence Rules ~[(A  B)  (C v D)] DeMorgan (eliminate all conjunctions) (~A v ~B) v ~ (C v D) (R  S)  (P  T)Exportation R  (S  (P  T)) or ((R  S)  P)  T A  (B  (C  D)) Implication ( all conditionals) ~A v (~B v (~C v D))

Symbolizations The IRS can exact a PENALTY from the taxpayer only if the taxpayer is guilty of FRAUD or gross NEGLIGENCE. Accordingly, if a taxpayer is not guilty of fraud and not guilty of gross negligence, then the IRS cannot exact a penalty. P  (F v N)  (~F  ~N)  ~P

MARY will join us in St. Louis unless BILL is visiting from Memphis. We would have seen Bill in RAGSDALE'S last night, if he is visiting. And we didn't. So Mary will join us in St. Louis. M v B, B  R, ~R  M

If ABRAMS is telling the truth about the Sandinistas, then the U.S. should be supporting the military effort of the CONTRAS. To support the military effort of the contras, however, it is necessary to either SUPPLY them with arms or to allow them to sell DRUGS so that they can buy arms. If we supply the arms, Congress must GRANT its permission. And the contras would be BREAKING the law if they sell drugs. Congress won't grant permission for supplying arms and the contras won't sell drugs. So Abrams is not telling the truth about the Sandinistas. A  C, C  (S v D), S  G, D  B, ~G ● ~D  ~A

Constructing Proofs 1)P  (F v N)  (~F  ~N)  ~P 2)~ ( F v N)  ~P 1 Contra 3)(~F  ~N)  ~P 2 DeM

1.~A v (C  D)  ~A 2.~(E  C) 3.E 4.~E v ~C 2 DeM 5.~C3,4 DS 6.~C v ~D5 Add 7. ~(C & D) 6 Dem 8.~A1,6 DS

~Q v ~P, ~Q  (R v ~P), R  T, P  T 1. ~Q v ~Pprove T 2. ~Q  (R v ~P) 3. R  T 4. P 5. ~Q1,4DS 6. R v ~P2,5 MP 7. R6, 4 DS 8. T3,7 MP