3.3 Rules Negation: ¬¬p implies p Conjunction: p&q implies p, q

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

Propositional Equivalences

Logic & Critical Reasoning

Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.

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:

Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.

Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.

Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus

Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.

1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.

1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.

Introduction to Logic Logical Form: general rules

Discussion #9 1/9 Discussion #9 Tautologies and Contradictions.

Proofs Using Logical Equivalences Rosen 1.2 List of Logical Equivalences p  T  p; p  F  pIdentity Laws p  T  T; p  F  FDomination Laws p  p.

Aim: How do we solve truth tables?

Propositions and Truth Tables

1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.

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.

CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.

Copyright © Curt Hill Truth Tables A way to show Boolean Operations.

Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.

BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.

Chap. 2 Fundamentals of Logic. Proposition Proposition (or statement): an declarative sentence that is either true or false, but not both. e.g. –Margret.

Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.

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.

Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.

COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.

CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.

Lesson 1.4. and ornot Logic Gate: A device that acts on input signals that it receives to produce an output signal (1 or 0). True = 1 False = 0.

AIM: WHAT IS AN INDIRECT PROOF?

Chapter 7 Logic, Sets, and Counting

Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

Review Given p: Today is Thursday q: Tomorrow is Friday

Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.

Exercises for CS3511 Week 31 (first week of practical) Propositional Logic.

Chapter 7 Logic, Sets, and Counting Section 1 Logic.

Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.

Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.

CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.

Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.

Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,

CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.

Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.

Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK

Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.

Contingent A statement is contingent iff it is neither a logical truth nor a contradiction.

 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.

Chapter 1 Propositional Logic

2. The Logic of Compound Statements Summary

DISCRETE MATHEMATICS CHAPTER I.

CSNB 143 Discrete Mathematical Structures

COT 3100, Spr Applications of Discrete Structures

Chapter 8 Logic Topics

Fundamentals of Logic Sentence: A sentence is usually collection of words Proposition: A proposition is usually a declarative to which it is meaningful.

Propositional Equivalences

Information Technology Department

Propositional Equivalence (§1.2)

Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.

Review To check an argument with a tree:.

Let us build the tree for the argument Q>-P | P>Q.

Logical Truth To show a statement A is a logic truth (tautology) ...

Symbolic Logic 2/25/2019 rd.

Statements of Symbolic Logic

Open Branches Sometimes trees have more than one open branch.

Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.

Presentation transcript:

3.3 Rules Negation: ¬¬p implies p Conjunction: p&q implies p, q Negated conjunction: ¬(p&q) implies ¬pV¬q Ex. p&q, ¬(p&q) invalid

Rules Disjunction: pVq has two branches Negated disjuction: one branch: ¬p ¬q Ex. (pVq)Vr ¬((pV(qVr)

3.4 Rule II Conditional: p→q implies ¬pVq, so it has two branches: ¬p; q The negation of conditional: ¬(p→q) implies ¬(¬pVq) implies p&¬q So it has one branch: p ¬q

Rules Bi-conditional: p↔q implies (p→q)&(q→p); so we have (p→q) (q→p)

Negated bi-conditional ¬(p↔q) ¬((p→q)&(q→p)) (¬(p→q))V(¬(q→p)) ¬(p→q) ¬(p→q) ¬(¬pVq) ¬(¬qVp) ¬¬p&¬q ¬¬q&¬p p q ¬q ¬p

Example sV(r&q) s→r ¬(r&m)

3.5 Other applications Test for equivalence: Assume ¬(A↔B) A B ¬B ¬A If both branches close, then A and B are equivalent. Ex. p→q implies ¬p→¬q Test for logical truth Assume ¬A, if all branches close, than A is a tautology. Open: contingent or contradiction Ex. pv¬p

Testing for contradiction and safisfiability Consider A, and assume A itself. If closed, A is an contradiction Ex. p&¬p Open: Satisfiable Ex. p&r