Chapter 3 section 3. Conditional pqpqpq TTT TFF FTT FFT The p is called the hypothesis and the q is called the conclusion.

Slides:

Advertisements

Similar presentations

3.4 More on the Conditional

Advertisements

Logic ChAPTER 3.

TRUTH TABLES Section 1.3.

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.

Constructing a Truth Table

Logic & Critical Reasoning

Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.

Appetizer: True or False 1.2  2 2.If 2 = 3, then 5 = 6. 3.If 1 = 2, then I am the Pope. 4.Open the window. 5.If the proof is wrong, then the proposition.

The Conditional & Biconditional MATH 102 Contemporary Math S. Rook.

Logic ChAPTER 3 1. Truth Tables and Validity of Arguments

Types of Conditionals Geometry. The converse of a conditional statement is formed by switching the hypothesis and conclusion. p: x is prime. q: x is odd.

Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.

1 Intro to Logic Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.

2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.

Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F

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

Conditional Statements

Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.

Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Truth Tables for Negation, Conjunction, and Disjunction.

3.2 – Truth Tables and Equivalent Statements

Logic ChAPTER 3.

CSE 20 – Discrete Mathematics Dr. Cynthia Bailey Lee Dr. Shachar Lovett Peer Instruction in Discrete Mathematics by Cynthia Leeis licensed under a Creative.

Propositional Logic.

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.

Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.

Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.

Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.

Discrete Maths 2. Propositional Logic Objective

MATH 102 Contemporary Math S. Rook

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.

Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

Discrete Mathematics Lecture1 Miss.Amal Alshardy.

Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and q,

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

Students will analyze statements, write definitions as conditional statements and verify validity. Why? So you can verify statements, as seen in Ex 2.

3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)

Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements

LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.

Conditional Statements

Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.

Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.

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

How do I show that two compound propositions are logically equivalent?

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

6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.

3.1 Statements and Quantifiers 3.2 Truth Tables.  A statement is a declarative sentence that is either true or false.  Examples: Mr. Healey is my math.

1 If-then Statements “If-then statements” are also called “Conditional Statements” or just “Conditionals” “If-then statements” are also called “Conditional.

Conditional Statements and the Converse Geometry Unit 11, Day 7 Ms. Reed.

Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.

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,

Fundamental Logic Gates And, Or, Not. Logic Gates: The Basics Regulate the flow of electricity within circuits to perform desired functionalities Each.

Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.

Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.

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

TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.

Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.

Section 1.3 Implications. Vocabulary Words conditional operation ( ⇒ or →) conditional proposition conditional statement (implication statement) hypothesis.

Reasoning and Proof Chapter Use Inductive Reasoning Conjecture- an unproven statement based on an observation Inductive reasoning- finding a pattern.

2-1 I F -T HEN S TATEMENTS AND C ONVERSES  Chapter 2 Test: Monday Oct. 1 st  Quiz: Wed. Sept. 26  Start today’s notes in current notes section.

Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.

Aim 1.4: To work with conditionals and biconditionals Do Now: Determine the truth value of the following sentences: 1.9 is a prime number and New York.

Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction

Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.

Presentation transcript:

Chapter 3 section 3

Conditional pqpqpq TTT TFF FTT FFT The p is called the hypothesis and the q is called the conclusion.

Examples I am an owner of a small factory, a rush order must be filled out by Monday. I approach you with this generous offer: p = You work for me on Saturday. q = I’ll give you a $100 bonus. If you work for me on Sat., then I’ll will give you a $100 bonus.

Case 1 You come to work and you receive the bonus. If p is true and q is true. Case 2 You come to work and you don’t receive the bonus. If p is true then q is false.

Case 3 You don’t come to work, but I will give you a bonus. If p is false, then q is true. Case 4 You don’t come to work and you don’t receive the bonus. If p is false, then q is false.

Case 3 explaination Do you understand why? In mathematics we tend to use if…then statements a little different. Do not read more into my statement. You do not expect to get the bonus if you did not come to work because that is your experience. I never said that. You are assuming this condition.

pq(p  ~q)  (~p  q) TT TF FT FF

Biconditional Iff- if and only if. It means that two statements say the same thing.

Examples x+3 = 7 iff x = 4 Today is Monday iff tomorrow is Tuesday.

Table pqpqpq TTT TFF FTF FFT