1. 2 3 Exam 1:Sentential LogicTranslations (+) Exam 2:Sentential LogicDerivations Exam 3:Predicate LogicTranslations Exam 4:Predicate LogicDerivations.

Slides:



Advertisements
Similar presentations
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
Advertisements

How can it be a syllogism if it doesn’t look like an A,E, I, or O statement? Translating “Ordinary” Sentences into the Standard Forms.
Goals Determine the true value of statements with AND, OR, IF..THEN. Negate statements with the connectives above Construct truth tables Understand when.
1. 2 Exam 1:Sentential LogicTranslations (+) Exam 2:Sentential LogicDerivations Exam 3:Predicate LogicTranslations Exam 4:Predicate LogicDerivations Exam.
Fourth Grade Grammar Jeopardy Start.
Today’s Topics Introduction to Predicate Logic Venn Diagrams Categorical Syllogisms Venn Diagram tests for validity Rule tests for validity.
Today’s Topics Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)
1 Logic What is it?. 2 Formal logic is the science of deduction. It aims to provide systematic means for telling whether or not given conclusions follow.
1. 2 Exam 1Sentential LogicTranslations (+) Exam 2Sentential LogicDerivations Exam 3Predicate LogicTranslations Exam 4Predicate LogicDerivations 6
Exam 1:Sentential LogicTranslations (+) Exam 2:Sentential LogicDerivations Exam 3:Predicate LogicTranslations Exam 4:Predicate LogicDerivations.
1. 2 Exam 1Sentential LogicTranslations (+) Exam 2Sentential LogicDerivations Exam 3Predicate LogicTranslations Exam 4Predicate LogicDerivations 6
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
1. 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 1 60% of Exam 1 warm-up.
1 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 60% of Exam 10 arguments.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Symbolization in Predicate Logic In Predicate Logic, statements predicate properties of specific individuals or members of a group. Singular Statement:
Copyright © Cengage Learning. All rights reserved.
Adapted from Discrete Math
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Chapter 3 – Introduction to Logic
Discrete Mathematics and Its Applications
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Atomic Sentences Chapter 1 Language, Proof and Logic.
2.2 Statements, Connectives, and Quantifiers
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
Thinking Mathematically Statements, Negations, and Quantified Statements.
Predicates and Quantifiers
Critical Thinking: A User’s Manual
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
Discrete Mathematics Lecture # 1. Course Objectives  Express statements with the precision of formal logic.  Analyze arguments to test their validity.
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.
Uniqueness Quantifier ROI for Quantified Statement.
Lecture 1-3: Quantifiers and Predicates. Variables –A variable is a symbol that stands for an individual in a collection or set. –Example, a variable.
Logic.
Week 13 Warm-Ups English 12 Mrs. Fountain.
Today’s Topics Introduction to Predicate Logic Venn Diagrams
The Foundations: Logic and Proofs
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2 Chapter Introduction to Logic and Sets
CSCI 3310 Mathematical Foundation of Computer Science
CS201: Data Structures and Discrete Mathematics I
4.1 The Components of Categorical Propositions
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Math - Module #1 - Logic
Chapter 1 Logic and Proof.
(1.4) An Introduction to Logic
1 Chapter An Introduction to Problem Solving
PREPOSITIONAL PHRASES
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
PARTS OF SPEECH.
1 Chapter An Introduction to Problem Solving
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Thinking Mathematically
CS201: Data Structures and Discrete Mathematics I
The Structure of Sentential Logic
Presentation transcript:

1

2

3 Exam 1:Sentential LogicTranslations (+) Exam 2:Sentential LogicDerivations Exam 3:Predicate LogicTranslations Exam 4:Predicate LogicDerivations Exam 5:(finals) very similar to Exam 3 Exam 6:(finals) very similar to Exam 4

4 When computing your final grade, four highest scores I count your four highest scores. missedzero (A missed exam counts as a zero.)

5 In predicate logic, every atomic sentence consists of predicate one predicate and subjects one or more “subjects” including subjects, direct objects, indirect objects, etc. subjectsarguments in mathematics “subjects” are called “arguments” (Shakespeare used the term ‘argument’ to mean ‘subject’)

6 is a dog Elle is awake Kay is asleep Jay PredicateSubject

7 Jay is taller than Elle Elle is next to Kay KayrespectsJay ObjectPredicateSubject

8 to from to JayElleprefersKay JayElleboughtKay KayEllesoldJay Indirect Object Direct Object PredicateSubject

9 predicate A predicate is an "incomplete" expression – i.e., an expression with one or more blanks – such that, whenever the blanks are filled by noun phrases, the resulting expression is a sentence. predicatenoun phrase 2 noun phrase 1 sentence

10 connective A connective is an "incomplete" expression – i.e., an expression with one or more blanks – such that, whenever the blanks are filled by sentences, the resulting expression is a sentence. connectivesentence 2 sentence 1 sentence 3

11 is tall is taller than recommendsto

12 Predicatesupper case letters 1.Predicates are symbolized by upper case letters. Subjectslower case letters 2.Subjects are symbolized by lower case letters. Predicatesfirst 3.Predicates are placed first. Subjectssecond 4.Subjects are placed second. Pred sub 1 sub 2 …

13 Kay recommended Elle to Jay Jay recommended Kay to Elle Kay is taller than Elle Jay is taller than Kay Kay is tall Jay is tall R kej R jke T ke T jk TkTk TjTj

14 neither Jay nor Kay is tall both Jay and Kay are tall Jay is not taller than Kay Jay is not tall Jay is taller than both Kay and Elle T jk & T je Tj & TkTj & Tk Tj & TkTj & Tk  T jk TjTj

15 JayandKayare married Jay and Kay are married (individually) = Jayis marriedandKayis married Jay is married, and Kay is married andare married Mj&MkMj & MkMj&MkMj & Mk JayandKayare married Jay and Kay are married (to each other) M jk

16 Quantifiers are linguistic expressions denoting quantity. Examples every, all, any, each, both, either some, most, many, several, few no, neither at least one, at least two, etc. at most one, at most two, etc. exactly one, exactly two, etc.

17 Quantifiers Quantifiers combine common nounsverb phrases common nouns and verb phrases to form sentences. Examples everysenioris happy every senior is happy nofreshmanis happy no freshman is happy at least onejunioris happy at least one junior is happy fewsophomoresare happy few sophomores are happy mostgraduatesare happy most graduates are happy predicate logic treats both common nouns and verb phrases as predicates

18  some, at least one existential quantifier  every, any universal quantifier symbol English expressions official name

19 Actually, they are both upside-down.  backwards ‘E’ A E  upside-down ‘A’

20 Quantifier Phrases are Simply Noun Phrases Jay is happy Kay is happy some one is happy every one is happy subject predicate

21 Quantifier Phrases are Sentential Adverbs

22 some oneis happy there is some onewho is happy there is some one such thathe/she is happy there is some x such thatx is happy xHxxHx there is an x (such that) H x pronunciation

23 every oneis happy every one is such thathe/she is happy whoever you areyou are happy no matter who you areyou are happy no matter who x isx is happy xHxxHx for any x H x pronunciation

24 modern logic takes ‘  ’ to mean at least one which means one or more which means one, or two, or three, or … not if a (counting) number is not one or more it must be zero negationat least one thus, the negation of ‘at least one’ not at least one is ‘not at least one’ none which is ‘none’

25 no oneis happy there is no onewho is happy there is no one such thathe/she is happy there is no x such thatx is happy there is not some x such thatx is happy xHxxHx there is no x (such that) H x pronunciation

26 not every oneis happy not every one is such thathe/she is H it is not true that whoever you areyou are H it is not true that no matter who you areyou are H it is not true that no matter who x isx is H xHxxHx not for any x H x pronunciation

27 supposenot everyone is happy thenthere is someone who is not happy i.e.,there is some x : x is not happy  xHx  x  Hx the converse argument is also valid =

28 supposeno one is happy thenno matter who you are you are not happy i.e.no matter who x is x is not happy  xHx  x  Hx the converse argument is also valid =

29