PS10 Sets & Logic. Sam Maddy Austin Jacob For each of these statements, list the students for which the statement is true:

Similar documents
Section 1.1: Logical Form and Logical Equivalence

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

Section L.1- Introduction to Logic

CSC Discrete Math I, Spring Propositional Logic

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

Proofs. Joe Patten August 10, 2018

PROPOSITIONAL CALCULUS

2.2: Logical Equivalence: The Laws of Logic

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

Truth Tables for Arguments

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

EECS 1028 M: Discrete Mathematics for Engineers

Compound Propositions

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

Mathematical Logic Part One

Chapter 2: The Logic of Compound Statements

1.1 Statements and Compound Statements

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

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Chapter 1: Formal Logic

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

Logic and Truth Tables

1.1 Language and Logic

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

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

Definition 2. Conjunction of p and q

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

PHI Propositional Logic Lecture 2. Truth Tables

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.

1.1 Language and Logic

1.3 Propositional Equivalences

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

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

Read ahead and use your textbook to fill in the blanks. We will work the examples together.

Chapter 4: Classical Propositional Semantics

Solutions to Homework I (1.1)

Today s Topic: Propositional Logic

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese

PS10.3 Logical implications

Mathematical Reasoning (Part I) 1

CSE 20: Discrete Mathematics

CSE 20 DISCRETE MATH. Fall

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

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

THE LOGIC OF COMPOUND STATEMENTS

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

15414/614 Optional Lecture 1: Propositional Logic

First Order Logic: Syntax and Semantics

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

Tautologies, Contradictions, and Contingencies

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Propositional Logic. Fall () Propositional Logic Fall / 30

We last time we began introducing equivalency laws.

Section 3.1 Statements, Negations, and Quantified Statements

Discrete Mathematics and Applications COT3100

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd:

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

THE LOGIC OF COMPOUND STATEMENTS

AMTH140 Lecture 8. Symbolic Logic

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Only one of the statements in part(a) is true. Which one is it?

Equivalence and Implication

Question 1 (a). Explain different logical connectives with the help of examples. Ans: Logical Connectivity:-

Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9

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

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

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.


University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018

Logic and Propositional Calculus

Introducing Proof 1. hsn.uk.net. Contents

CSE 240 Logic and Discrete Mathematics

Logic and Truth Tables

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

Korey Nishimoto. Nature of Mathematics

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

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

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

MAT2345 Discrete Math

Symbolic Logic Outline

Truth Tables for Propositions

Part Two: The Basic Components of the SOFL Specification Language

2-1. Inductive Reasoning and Conjecture. Lesson 2-1. What You ll Learn. Active Vocabulary

Propositional Logic. Spring Propositional Logic Spring / 32

Chapter 1, Section 1.1 Propositional Logic

Logic Overview, I. and T T T T F F F T F F F F

13.3 Truth Tables for the Conditional and the Biconditional

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 1

Discrete Structures for Computer Science

Topic 1: Propositional logic

Exclusive Disjunction

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

n Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

PHIL12A Section answers, 16 February 2011

Proving simple set properties...

Section 1.1: Propositions and Connectives

Chapter 1 Elementary Logic

Transcription:

PS10 Sets & Logic Lets check it out: We will be covering A) Propositions, negations, B) Conjunctions, disjunctions, and C) intro to truth tables, D) 3 propositions. hink about this. On Saint Patrick s Day, the students in a class are all encouraged to wear green clothes to school. Sam Maddy Austin Jacob or each of these statements, list the students for which the statement is true: a) I am wearing a green shirt. b) I am not wearing a green shirt. c) I am wearing a green shirt and green pants. d) I am wearing a green shirt or green pants. e) I am wearing a green shirt or green pants, but not both. 1

Propositions Propositions are statements which may be true or false. hey are not if a form of a question, but rather an assertion that do not include opinions. Propositions do no have to have the same answer every time its asserted, but rather are indeterminate. he truth value of a proposition is whether it is true or false. [Note that Logic is closely associated with set notation and Venn diagrams.] Examples Which of the following statements are propositions? If they are propositions, are they true, false, or indeterminate? 1) 14 7 = 2 2) You have a turtle on your back. 3) I like your flannel hat. 4) Mr. Saputo has 2300 records. 2

PROPOSIION NOAION We represent propositions by letters such as p, q, and r. or example, p: It always rains on uesdays. q: 37 + 9 = 46 r: x is an even number. Negation Even though I have botched it a few times, negation means something different than A. his is the compliment. he negation of a proposition p is not p, and is written as p. he truth value of p is the opposite of the truth value of p. Example: he proposition p: It is raining outside. he negation of p, p: It is not raining outside. Write down an example about yourself! 3

Back to the example p: It is raining outside p: it is not raining outside. rom this example we can see that p is false when p is true true when p is false With this information, it is simple to organize the information in a ruth table. he first row is your propositions in general, followed by columns that that correspond with the truth value outcomes. Negation with sets or sets, the negation can also be the compliment. hey are one in the same, but the terminology is different. Example: U = 1 2, 3,5,7,9,11 ind the negation of x when x Z 4

NEGAION AND VENN DIAGRAMS We can use a Venn diagram to represent these propositions and their negations. or example, consider p: x is greater than 10. U is the universal set of all the values that the variable x may take. P is the truth set of the proposition p, or the set of values of x U for which p is true. P is the truth set of p. Example Consider U = x 2 < x < 12, x N and proposition p: x is a prime number. ind the truth sets of p and p, and display them on a Venn diagram. 5

COMPOUND PROPOSIIONS Compound propositions are statements which are formed using connectives such as and and or. Lets start with conjunctions: When two propositions are joined using the word and, the new proposition is the conjunction of the original propositions. If p and q are propositions, p q is used to denote their conjunction. Example p: Adriana had coffee for breakfast q: Adriana had bacon for breakfast p q: Adriana had coffee and bacon for breakfast. p q is only true if Adriana had both coffee and a bacon for breakfast, which means that both p and q are true. If either of p or q is not true, or both p and q are not true, then p q is not true. his leads to something very important: A conjunction is true only when both original propositions are true. 6

Lets use Adriana as an example We are going to look at a truth table to help us understand each situation that could possibly happen. Lets use Adriana as an example We can use Venn diagrams to represent conjunctions. Suppose: P is the truth set of p, and Q is the truth set of q. he truth set of p q is P Q, the region where both p and q are true. 7

Lets do another example. Write down p q for the following pairs of propositions and fill in a truth table: A. p: ranco is a student, q: ranco is a senior p q p q B. p: Heidi is a figure skater, q: Heidi is a profession sycronized swimmer. A. Which situation is true on the table? p q p q Lets do another example. A. Decide whether p q is true or false. Highlight the truth table that this circumstance follows. p: 4 is a factor of 16, q: 3 is a factor of 16. p q p q 8

DISJUNCION When two propositions are joined by the word or, the new proposition is the disjunction of the original propositions. If p and q are propositions, p q is used to denote their disjunction. Example: p: Daisy ran the 500m today q: Daisy ran the 1,000m today. p q: A disjunction is true when one or both propositions are true. A disjunction is only false if both propositions are false. he truth table for the disjunction p or q is: Here is the truth table for every disjunction p q p q 9

Venns If P and Q are the truth sets for propositions p and q respectively, then the truth set for p q is P Q, the region where p or q or both are true. he exclusive disjunction is true when only one of the propositions is true. he exclusive disjunction of p and q is written p q. We can describe p V q as p or q, but not both, or exactly one of p and q. Example: p: Orion ate cereal for breakfast q: Orion ate toast for breakfast p V q: Sally ate cereal or toast, but not both, for breakfast. he truth table for the exclusive disjunction p V q is: p q p q 10

he exclusive disjunction is true when only one of the propositions is true. he exclusive disjunction of p and q is written p q. We can describe p V q as p or q, but not both, or exactly one of p and q. Example: p: Orion ate cereal for breakfast q: Orion ate toast for breakfast p V q: Sally ate cereal or toast, but not both, for breakfast. If P and Q are the truth sets for propositions p and q respectively, then the truth set for p V q is the region shaded, where exactly one of p and q is true. p q P Q (P Q) p q p q Example 11

Do we have time for more? RUH ABLES AND LOGICAL EQUIVALENCE he truth tables for negation, conjunction, disjunction, and exclusive disjunction can be summarized in one table. p q p p q p q p q Construct a truth table for p q. We start by listing all possible combinations of p and q. We can fill in each column afterwards. p q q p q 12

AUOLOGY AND LOGICAL CONRADICION A compound proposition is a tautology if all the values in its truth table column are true. A compound proposition is a logical contradiction if all the values in its truth table column are false. 1) is p p a tautology a logical contradiction or neither? p p p p More difficult Show that ( q p) (q p) is a logical contradiction. 13

One last thing in C wo propositions are logically equivalent if they have the same truth table column. Lets do one alone Construct a truth table for the following propositions: 1) p q p q p p q 14

Lets break it down using the symbols = Both need to be true to have a true = One or more need to be true to have a true. = Only one can be true to have a true = he opposite of whatever it is in front of. hree propositions r is used to state a third proposition. At this point, what p, q and r are tend to get abstract, therefore, we are going focus on what happens in the truth table. p q r 15

You try to construct a 3 prop truth table for (p q) r Homework P.236 8B.1 #2, 3 P. 238 8B.2 #2, 4, 5, 9, 11-13 P.242 8C.1 #1-9 odd. P.244 8C.2 #2-6 even 16