For Friday, read Chapter 2, section 5. As nongraded homework, do the problems at the end of the section. I sent out graded HW#2 yesterday. It’s due on.

Slides:

Advertisements

Similar presentations

Unit 4 He said I was hard-working. ( Section A ) Violet.

Advertisements

Logic & Critical Reasoning Translation into Propositional Logic.

It all builds on one little sheet of paper… sentence basics.

The Foundations: Logic and Proofs

Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.

04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.

For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.

Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.

2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.

Logic 2 The conditional and biconditional

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

Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.

For Wednesday, read chapter 6, section 1. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class. In.

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

For Wednesday, read chapter 2, sections 3 and 4. As nongraded homework, do the problems at the end each section. Also try exercises 7.1, C, D, and E on.

For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.

For Friday, read chapter 2, sections 1-2 (pp ). As nongraded homework, do the problems on p. 19. Graded homework #1 is due at the beginning of class.

For Friday, read chapter 2, section 5. As nongraded homework, do the problems at the end of the section. Reminder: try exercises 7.1, C, D, and E on the.

1 Section 1.1 Logic. 2 Proposition Statement that is either true or false –can’t be both –in English, must contain a form of “to be” Examples: –Cate Sheller.

On Monday, we’ll work on Chapter 2, sections 4 and 5. Exam #1 is one week from today. It covers Chapters 1 and 2 (except for chapter 2, section 6). On.

Reading: Chapter 4, section 4 Nongraded Homework: Problems at the end of section 4. Graded Homework #4 is due at the beginning of class on Friday. You.

For Monday, read Chapter 4, Sections 1 and 2. Nongraded homework: Problems on pages Graded HW #4 is due on Friday, Feb. 11, at the beginning of.

Exam #1 is Friday. It will take the entire period. You do not need to bring an exam booklet; you’ll write directly on the exam. Outline: I. T/F, covering.

CSE115/ENGR160 Discrete Mathematics 01/17/12 Ming-Hsuan Yang UC Merced 1.

For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.

The Foundations: Logic and Proofs

Intro to Discrete Structures

Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

2009/9 1 Logic and Proofs §1.1 Introduction §1.2 Propositional Equivalences §1.3 Predicates and Quantifiers §1.4 Nested Quantifiers §1.5~7 Methods of Proofs.

Discrete Mathematics and Its Applications

Chapter 1: The Foundations: Logic and Proofs

Chapter 1, Part II: Predicate Logic With Question/Answer Animations.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Objectives 1. Statements, quantifiers, and compound statements 2. Statements involving the words not,

PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.

For Wednesday, read chapter 2, sections 3 and 4. As nongraded homework, do the problems at the end each section. Also try exercises 7.1, C, D, and E on.

Logic Review. FORMAT Format Part I 30 questions 2.5 marks each Total 30 x 2.5 = 75 marks Part II 10 questions Answer only 5 of them! Total 5 x 5 marks.

1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.

Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.

Translating Conditionals Some more advanced issues: 1. ‘only if ’ 2. necessary and sufficient conditions 3. dealing with time.

1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.

1 DISJUNCTIVE AND HYPOTHETICAL SYLLOGISMS DISJUNCTIVE PROPOSITIONS: E.G EITHER WHALES ARE MAMMALS OR THEY ARE VERY LARGE FISH. DISJUNCTS: WHALES ARE MAMMALS.(P)

PART 2 CONTENTS: CONTENTS: THE FIRST CONDITIONAL.

Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.

Chapter 1: The Foundations: Logic and Proofs

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

CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.

Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.

 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.

Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.

1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.

Structure and punctuation of compound and complex sentences Yeon heui kim.

Uniqueness Quantifier ROI for Quantified Statement.

Introduction to Logic © 2008 Pearson Addison-Wesley.

Discrete Mathematical

Truth Tables and Equivalent Statements

The Foundations: Logic and Proofs

Principles of Computing – UFCFA3-30-1

Symbolization Review.

Chapter 8 Logic Topics

Information Technology Department

Copyright © Cengage Learning. All rights reserved.

Discrete Mathematics Dr.-Ing. Erwin Sitompul

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Discrete Mathematics Lecture # 3.

CHAPTER 3 Logic.

Section 3.3 Truth Tables for the Conditional and Biconditional

CHAPTER 3 Logic.

If v.s. Only If v.s. If and Only If (Iff)

Presentation transcript:

For Friday, read Chapter 2, section 5. As nongraded homework, do the problems at the end of the section. I sent out graded HW#2 yesterday. It’s due on Friday at the beginning of class. Exam #1 will be given one week from Friday. It covers Chapters 1 and 2 (except for chapter 2, section 6).

If she’s invited, Tammy will come to the party. I → P Tammy will come to the party only if she’s invited. (This is taken to mean that she won’t come if she’s not invited.) P → I

Also, sufficient condition = antecedent, necessary condition = consequent If you’re a human, then you’re a mammal. (H: You’re a human; M: You’re a mammal) Sufficient → necessary H → M but if someone says that being a mammal is sufficient for being a human, then write M → H, even though the statement is false.

‘Whenever’ and ‘unless’ Whenever Terry lectures, she uses slides. (L: Terry lectures; S: Terry uses slides) L → S Tom will not graduate unless he fulfills all of the course requirements. (G: Tom graduates; F: Tom fulfills all of the course requirements) ~ F → ~ G

‘↔’ is the double-arrow; it abbreviates ‘if and only if’ and equivalent phrases (such as ‘just in case’) Martha is brilliant if and only if she is a genius. (B: Martha is brilliant; G: Martha is a genius) B ↔ G

3. Parentheses are used for grouping. Either Tom is a doctor or Jill is a doctor, but not both. (T: Tom is a doctor; J: Jill is a doctor) (T v J) & ~ (T & J) This expresses the exclusive ‘or’, by the way.

Tips for grouping in longer translations: 1. Use punctuation as a guide; the stronger the form of punctuation, the larger the scope of the operator in the corresponding position. Pat is happy, or Tom is happy; but both of them are rich. (P: Pat is happy; T: Tom is happy; R: Pat is rich; H: Tom is rich). (P v T) & ( R & H)

2. Consider the relative positions of logical terms (e.g., ‘either’, ‘or’, ‘if’, ‘then’ and ‘both’). Either Jim will graduate and his wife will be promoted or he’ll be sad. (G: Jim will graduate; P: Jim’s wife will be promoted; S: Jim will be sad) (G & P) v S

3. Compound subjects and predicates indicate grouping. Terry and Pat are from Russia or Tracy is from Ghana. (T: Terry is from Russia; P: Pat is from Russia; G: Tracy is from Ghana) (T & P) v G

Symbolizing Complete Arguments An argument: After I get my B.A., I’ll either go to law school, medical school, or business school. I hear that law school is a grind, and med school takes forever. An MBA it is, then. First determine the conclusion: B: I’m getting an MBA (or I’m going to business school; treat these as equivalent).