DeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations )

Similar documents
CSC Discrete Math I, Spring Propositional Logic

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Logic and Truth Tables

Logic and Truth Tables

Truth Tables for Arguments

a. ~p : if p is T, then ~p is F, and vice versa

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Logic. Def. A Proposition is a statement that is either true or false.

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Propositional Equivalence

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y

Chapter 1, Section 1.1 Propositional Logic

Logic Review Solutions

1.1 Statements and Compound Statements

DERIVATIONS AND TRUTH TABLES

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

PROPOSITIONAL CALCULUS

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

PL: Truth Trees. Handout Truth Trees: The Setup

Section 1.1: Logical Form and Logical Equivalence

Chapter 2: The Logic of Compound Statements

The statement calculus and logic

Logic and Propositional Calculus

Note: The area of logic that deals with propositions is called the propositional calculus or propositional logic.

Mathematical Logic Part One

Mathematical Logic Part One

Logical forms and substitution instances. Philosophy and Logic Unit 2, Section 2.1

Formal Logic. Critical Thinking

THE LOGIC OF COMPOUND STATEMENTS

Ella failed to drop the class. Ella dropped the class.

Definition 2. Conjunction of p and q

EECS 1028 M: Discrete Mathematics for Engineers

8.8 Statement Forms and Material Equivalence

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

Propositional Logic. Spring Propositional Logic Spring / 32

Logic and Propositional Calculus

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

Mathematical Logic Part One

THE LOGIC OF COMPOUND STATEMENTS

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

A statement is a sentence that is definitely either true or false but not both.

Mathematical Logic Part One

What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.

Mat 243 Exam 1 Review

Logical Agents. September 14, 2004

Overview. 1. Introduction to Propositional Logic. 2. Operations on Propositions. 3. Truth Tables. 4. Translating Sentences into Logical Expressions

Philosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2015

Chapter 1: The Logic of Compound Statements. January 7, 2008

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

PHI Propositional Logic Lecture 2. Truth Tables

Boolean Logic. CS 231 Dianna Xu

Philosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2014

Propositional Logic Review

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

Sec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Introduction to Sets and Logic (MATH 1190)

Today s Topic: Propositional Logic

Propositional Logic and Semantics

1.1 Language and Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Mathematical Reasoning (Part I) 1

Prof. Girardi Exam 1 Math 300 MARK BOX

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

Artificial Intelligence Chapter 7: Logical Agents

MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.

7 LOGICAL AGENTS. OHJ-2556 Artificial Intelligence, Spring OHJ-2556 Artificial Intelligence, Spring

Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13

PHIL12A Section answers, 16 February 2011

Today s Lecture 2/9/10. Symbolizations continued Chapter 7.2: Truth conditions for our logical operators

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration

LECTURE # 3 Laws of Logic

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

Compound Propositions

III. Elementary Logic

Logical Agents. Chapter 7

cse541 LOGIC FOR COMPUTER SCIENCE

Propositional Logic George Belic

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

It is not the case that ϕ. p = It is not the case that it is snowing = It is not. r = It is not the case that Mary will go to the party =

2.2: Logical Equivalence: The Laws of Logic

1.3 Propositional Equivalences

AMTH140 Lecture 8. Symbolic Logic

To reason to a correct conclusion, we must build our arguments on true statements. Sometimes it is helpful to use truth tables. Simple Truth Table p

The Logic of Compound Statements cont.

Artificial Intelligence. Propositional logic

Propositional Logic Not Enough

3.2: Compound Statements and Connective Notes

Chapter 2: Introduction to Propositional Logic

A Little Deductive Logic

VALIDITY IN SENTENTIAL LOGIC

Propositional Language - Semantics

Transcription:

DeMorgan s aws and the Biconditional Philosophy and ogic Sections 2.3, 2.4 ( Some difficult combinations )

Some difficult combinations Not both p and q = ~(p & q) We won t both sing and dance. A negation of a conjunction. Both not p and not q = (~p & ~q) We won t sing and we won t dance. A conjunction of negations.

~(p & q) (~p & ~q) hese are not equivalent to one another. he first says: it is not the case that both will happen. he second says: it is the case that both will not happen.

Difficulties, continued Neither p nor q = Not either p or q = It is not the case that either p or q = ~(p v q) We will neither sing nor dance. A negation of a disjunction. Either not p or not q = (~p v ~q) Either we won t sing or we won t dance. A disjunction of negations.

~(p v q) (~p v ~q) hese too are not equivalent to one another. he first says: neither will happen. he second says: one or the other of them won t happen.

We need a fourth connective he preceding formulations use = incorrectly. Clearly the sentences are different sentences. What we want to say is that the two sentences have equivalent truth conditions No matter what pattern of on/off switches occurs in the world, these two sentences will light up at exactly the same times. One is on (true) if and only if the other is on (true). or this we need...

Biconditional symbol: (triple bar) translation: if and only if P Q P Q

Simplest rule: rue only if the truthvalues match P Q P Q

hat is: rue only if both are rue OR both are alse (it's the second clause that gets forgotten) P Q P Q

DeMorgan s aws A conjunction (p & q) is true if and only if both conjuncts are true. So it is false ( ~(p & q)) if one or the other of the conjuncts is false. hat is: ~(p & q) (~p v ~q) Not both p and q Either not p or not q.

DeMorgan s aws (2) A disjunction is false ( ~(p v q)) if and only if both disjuncts are false. So: ~(p v q) (~p & ~ q) Neither p nor q Both not p and not q.

Cross correlations ~(p & q) (~p v ~q) (~p & ~ q) ~(p v q) Not both p and q Either not p or not q Both not p and not q Neither p nor q

In English It is not the case that we will both sing and dance. Either we will not sing or we will not dance. ~(s & d) (~s v ~d) Both we will not sing and we will not dance. We will neither sing nor dance. (~s & ~d) ~(s v d)

~(p & q) (~p v ~q) P Q

~(p & q) (~p v ~q) P Q p & q

~(p & q) (~p v ~q) P Q p & q ~(p & q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p & q) (~p v ~q) P Q p & q ~(p & q) ~p ~q ~p v ~q ~(p& q) (~p v ~q)

~(p& q) (~p v ~q) ~p v ~q ~q ~p ~(p & q) p & q Q P ~(p & q) (~p v ~q)

Symbolize & test for validity Valerie is either a doctor or a lawyer. Valerie is neither a doctor nor a stockbroker. Hence Valerie is a lawyer. D: Valerie is a doctor. : Valerie is a lawyer. S: Valerie is a stockbroker.

Valerie is either a doctor or a lawyer. D v Valerie is neither a doctor nor a stockbroker. Hence Valerie is a lawyer. D: Valerie is a doctor. : Valerie is a lawyer. S: Valerie is a stockbroker.

Valerie is either a doctor or a lawyer. D v Valerie is neither a doctor nor a stockbroker. Hence Valerie is a lawyer. D: Valerie is a doctor. : Valerie is a lawyer. S: Valerie is a stockbroker.

Valerie is either a doctor or a lawyer. D v Valerie is neither a doctor nor a stockbroker. Hence Valerie is a lawyer. D: Valerie is a doctor. : Valerie is a lawyer. S: Valerie is a stockbroker.

he test Construct a truth table. Use a separate column for each premise. Put the conclusion on the rightmost end. Compute the values. Ask: Is there any row where all the premises are true and the conclusion is false? If yes: the argument is invalid. If no: the argument is valid.

D v herefore,

D v herefore, D S

D v herefore, D S D v

D v herefore, D S D v (D v S)

D v herefore, D S D v (D v S)

D v herefore, D S D v (D v S)

D v herefore, D S D v (D v S)

D v herefore, D S D v (D v S)

D v herefore, D S D v (D v S)

D v herefore, D S D v (D v S)

D v herefore, (D v S) D v S D

D v herefore, (D v S) D v S D

D v herefore, (D v S) D v S D

D v herefore, (D v S) D v S D

D v herefore, (D v S) D v S D

he test Is there any row where all the premises are true and the conclusion is false? If yes: the argument is invalid. If no: the argument is valid.

he test Is there any row where all the premises are true and the conclusion is false? Note that on any row we need to look only at the columns for the premises and for the conclusion. he other columns can be ignored! Mark the premise columns somehow, and put the conclusion in your last column.

D v herefore, (D v S) D v S D

D v herefore, (D v S) D v S D No such row. VAID!