Double Negation p :: ~ ~p 1.A > ~ (B . C) 2. B . C ~ ~ ( H v K) ~ H

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Proofs using all 18 rules, from Hurley 9th ed. pp Q > (F > A) 2. R > (A > F) 3. Q ∙ R / F ≡ A (J ∙ R) > H 2. (R > H) > M 3. ~(P v.
1 Section 6.3 Formal Reasoning A formal proof (or derivation) is a sequence of wffs, where each wff is either a premise or the result of applying a proof.
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
When you vote for the President you are actually voting for an ELECTOR to vote for you Each state has a determined number of electors.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
§ 1.2 Operations with Real Numbers and Simplifying Algebraic Expressions.
EXAMPLE 3 Identify properties of real numbers
Sect. 1.3 Solving Equations  Equivalent Equations  Addition & Multiplication Principles  Combining Like Terms  Types of Equations  But first: Awards,
Normal Forms, Tautology and Satisfiability 2/3/121.
CS1502 Formal Methods in Computer Science
7.4 Rules of Replacement II Trans, Impl, Equiv, Exp, Taut.
Philosophy 200 substitution rules. Substitution Sometimes, when you translate a statement from English to SL, you translate it in a form that is less.
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.
Properties.
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements when switching order of antecedent and consequent If the car starts, there’s gas in the tank.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Fungi: Plant, Animal, or Something Else Entirely?.
Chapter 1: The Foundations: Logic and Proofs
Properties for Real Numbers Rules that real numbers follow.
Sect. 1.2 Operations & Properties of Real Numbers  Absolute Value  Inequalities  Addition, Subtraction, Opposites  Multiplication, Division, Reciprocals.
TODAY WE ARE GOING TO PLAY….. “NAME THAT PROPERTY!”
Ch 2.3 & 2.4 Objective: To solve problems involving operations with integers.
Symbolic Logic ⊃ ≡ · v ~ ∴. What is a logical argument? Logic is the science of reasoning, proof, thinking, or inference. Logic allows us to analyze a.
Ch 2.5 Objective: To multiply integers.. Properties Commutative Property: a * b = b * a Two numbers can be multiplied in either order and the result is.
1.(p  q) 2. (r  s) 3. p v r  q v s 4. (p  q)  (r  s) conj. 1,2 5. q v sC.D. 3,4.
Fiorina Chapter 3 A 50:50 Nation? Red and Blue State People are Not That Different.
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) 
(2 x 1) x 4 = 2 x (1 x 4) Associative Property of Multiplication 1.
Review of Common Test #1 Mistakes. Plurality versus Majority Plurality winner = candidate with more first place votes than any other Majority winner =
Law of logic Lecture 4.
PHIL 012 2/14/2001 Logical Equivalence & Translation.
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Discrete Structures – CNS 2300
The Foundations: Logic and Proofs
Today we are going to play…..
More on Logical Equivalence
Natural Deduction: Using simple valid argument forms –as demonstrated by truth-tables—as rules of inference. A rule of inference is a rule stating that.
PRIME AND COMPOSITE NUMBERS
ELECTORAL COLLEGE.
A v B ~ A B > C ~C B > (C . P) B / ~ B mt 1,2 / B ds 1,2
Propositional Equivalences
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.
TTL Voltage Levels LOW HIGH Power Supply Range
Logic Gates.
Write-your-own test questions (and answers)
Today we are going to play…..
Deductive Reasoning: Propositional Logic
CS 270 Math Foundations of CS
Natural Deduction 1 Hurley, Logic 7.4.
8.2 Using the Rule of Inference
More on Logical Equivalence
Electoral College.
Simplification of Boolean Expressions
Malini Sen WESTERN LOGIC Presented by Assistant Professor
Logic Gates.
1. (H . S) > [ H > (C > W)]
Reasoning with the Propositional Calculus
Boolean Algebra How gates get picked.
Reasoning with the Propositional Calculus
Natural Deduction Hurley, Logic 7.2.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
UNIT 4 ELECTORAL COLLEGE MR Hayner.
Natural Deduction Hurley, Logic 7.3.
ELECTORAL COLLEGE.
Transposition (p > q) : : ( ~ q > ~ p) Negate both statements
Chapter 8 Natural Deduction
Presentation transcript:

Double Negation p :: ~ ~p 1.A > ~ (B . C) 2. B . C ~ ~ ( H v K) ~ H 3. ~ ~ (B . C) 2 DN 4. ~A 1,3 MT 3. H v K 1 DN 4. K 2 ,3 DS

~ ( N v W) :: (~N . ~W) Neither Nader nor Whatshisname will be elected :: Nader won’t be and Whatshisname won’t be. ~ ( B . K) :: (~ B v ~K) Not both Bush and Kerry will win: Either Bush won’t be or Kerry won’t be. deMorgan’s Rule DM ~ (p v q) :: (~p . ~q) ~ (p . q) :: (~ p v ~q) 1. ~( N v W) 2. B > N / ~B 3. ~ N . ~ W 1 DM 4. ~N 3 SIMP 5. ~B MT 2,4

COMM Commutation (p . q) : : (q . p) (p v q) : : (q v p) (J > N) v (C v D) ~C ~D / J >N ~ C . ~ D CONJ 2,3, ~ (C v D) DM 4 J > N COMM, DS 1,5 6. (C v D) v (J >N) COMM, 1 7. J >N DS 5, 6

Association ASSOC [ p . (q . r)] : : [ (p . q) . r] [ p v (q v r)] : : [ (p v q) v r] 1. A . (B . C) / C 2. (A . B) . C ASSOC 1 3. C . (A . B) COMM 2 4. C SIMP 3

Distribution [p v (q . r)] : : [(p v q) . (p v r)] We either eat at Seacobeck or we go downtown and eat at Bangkok Café : : Either we eat at Seacobeck or go downtown and either we eat at Seacobeck or we eat at Bangkok Café. [ p. (q v r)] : : [ p . q) v (p . r)] We’re going downtown and either we’ll eat at Bangkok or at Foodes : : We’re going downtown and eating at Bangkok or else we’re going downtown and eating at Foodes.

Rules of Replacement Double Negation DN p :: ~ ~p deMorgan’s Rule DM ~ (p v q) :: (~p . ~q) ~ (p . q) :: (~ p v ~q) Commutation COMM (p . q) : : (q . p) (p v q) : : (q v p) Association ASSOC [ p . (q . r)] : : [ (p . q) . r] [ p v (q v r)] : : [ (p v q) v r] Distribution DIST [p v (q . r)] : : [(p v q) . (p v r)] [ p. (q v r)] : : [ p . q) v (p . r)]