TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

Similar documents
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

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

CSC Discrete Math I, Spring Propositional Logic

Compound Propositions

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

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

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

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

PROPOSITIONAL CALCULUS

AMTH140 Lecture 8. Symbolic Logic

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

Section 1.1: Logical Form and Logical Equivalence

THE LOGIC OF COMPOUND STATEMENTS

CSE 20: Discrete Mathematics

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

Boolean Logic. CS 231 Dianna Xu

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

DISCRETE STRUCTURES WEEK5 LECTURE1

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

Chapter 1, Section 1.1 Propositional Logic

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04

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

Today s Topic: Propositional Logic

A Little Deductive Logic

The statement calculus and logic

Discrete Mathematics

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

A Little Deductive Logic

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

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

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

Lecture 02: Propositional Logic

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

15414/614 Optional Lecture 1: Propositional Logic

Propositional Logic. Yimei Xiang 11 February format strictly follow the laws and never skip any step.

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

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

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

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

3.2: Compound Statements and Connective Notes

Mathematical Logic Part One

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

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

CSE 20 DISCRETE MATH. Fall

Mathematics for linguists

PL: Truth Trees. Handout Truth Trees: The Setup

Introduction. Applications of discrete mathematics:

Discrete Structures for Computer Science

A Statement; Logical Operations

DERIVATIONS AND TRUTH TABLES

1.1 Language and Logic

Propositional Logic. Spring Propositional Logic Spring / 32

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

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Propositional Languages

EECS 1028 M: Discrete Mathematics for Engineers

1.1 Language and Logic

We last time we began introducing equivalency laws.

Elementary Logic and Proof

CSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker

Mathematical Logic Part One

Artificial Intelligence. Propositional logic

Chapter 1 Elementary Logic

Proofs. Joe Patten August 10, 2018

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional 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

Mathematical Logic Part One

LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic

Propositional logic ( ): Review from Mat 1348

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

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

Truth Table Definitions of Logical Connectives

Logical Structures in Natural Language: Propositional Logic II (Truth Tables and Reasoning

Propositional Logic Not Enough

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 =

Chapter 5: Section 5-1 Mathematical Logic

Tecniche di Verifica. Introduction to Propositional Logic

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

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

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14

Philosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2015

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

CISC-102 Winter 2016 Lecture 17

DISCRETE MATHEMATICS BA202

Propositions. Frequently, we will use the word statement instead of proposition.

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

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

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

Chapter 2: Introduction to Propositional Logic

cis32-ai lecture # 18 mon-3-apr-2006

Logic and Inferences

Knowledge Representation. Propositional logic

Learning Goals of CS245 Logic and Computation

1 Propositional Logic

Propositional Equivalence

Philosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2014

Section L.1- Introduction to Logic

THE LOGIC OF COMPOUND STATEMENTS

Transcription:

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

Here s some Vocabulary we will be talking about in this PowerPoint. Atomic Sentences: Statements which express one proposition Connectives: These are used to make more complex statements. Connectives connect statements together, i.e..: and Conjunction: A conjunction connects two sentences by saying that they are both true. Disjunction: (inclusive) A disjunction connects two sentences that at least one of the statements are true, if not both. Disjunction: (exclusive) A disjunction where one of the two statements are not both. Negation: A negation in English denotes in by using the word not or more formally it s not the case that. It is a strange connective that operates in only one atomic sentence. Material Conditional: This is a stylistic variant that contains and antecedent and a consequent, i.e.: If then. Material Biconditional: This is a variant that contains same truth value for both conditions, i.e.: if and only if.

Atomic Sentences Atomic Sentences Today is Thursday. The atomic number of hydrogen is 1. It is raining outside right now. Not Atomic Sentences The atomic number for hydrogen is 1 and the atomic number for helium is 2. Are you hungry? Tomorrow is not a weekday. We can symbolize atomic sentences by using a capital letter. Traditionally, logicians like to start with the letter P and go on alphabetically from there. Some use a symbol representing the sentence, such as: H for The atomic number of hydrogen is 1.

: Conjunction: P: The atomic number of hydrogen is one. and Q: The atomic number of helium is two. Conjunction Symbol: Example: P Q Stylistic variants: and, but, although, in addition to The truth table for conjunction is the following: P Q P Q T T T T F F F T F F F F

Disjunction: (Inclusive) P: I will roll a 7 on this roll. or Q: I will roll an 11 on this roll. Disjunction Symbol: Stylistic variants: or, either or, unless Example : P Q The truth table for disjunction is the following: P Q P Q T T T T F F F T F F F F

Negation: P: The sky is blue. P: It is not the case the sky is blue Negation Symbol: Stylistic variants: it is not the case that, not, un-, non- Example: P The truth table for negation is the following: P P T F F T Going back to disjunction, we can now write an exclusive disjunction as (P Q) (P Q). Translating back to English, that says P or Q, but not both P and Q.

Material Conditional: P: x > 4 Q: x > 2 Material Conditional Symbol: Stylistic variants: if then, given that, only if Example: P Q The truth table for material conditional is the following: P Q P Q T T T T F F F T T F F T

Material Conditional - Continued Reflection If x > 4 then x > 2 -orsymbolically, (x > 4) (x > 2) Is this true? (Yes) Is it always true or just sometimes true? (Hmm??? Let s see ) P Q P Q T T T T F F F T T F F T 1. X = 5 Then both the antecedent and the consequent are true. 2. X = 3 Then the antecedent is false but the consequent is true. 3. X = 1 Then both the antecedent and the consequent are true. Notice that we can t find a value for x that makes the antecedent true but the consequent false. That s because this material conditional is always true. In other words, we can t create a situation like row two of the truth table for a material conditional. But we said that this material conditional is always true. And that includes the cases when x = 3 and x = 1 as well as when x =5. In other words, rows three and four of the truth table should be true!

Material Biconditional Symbol: Material Biconditional P: The lightbulb will go on. iif Q: The light switch is turned on Stylistic variants: if and only if, just in the case that Example: P Q The truth table for the material biconditional is the following: P Q P Q T T T Intuitively, P if and only if Q means that P and Q should always possess the same truth value, which is reflected in the truth table. T F F F T F F F T

YAY!!!!!! We made it through! Time for a little Laugh Therapy! https://www.youtube.com/watch?v=ljbbqhmzflc