Test 4 Review For test 4, you need to know: Definitions the recursive definition of ‘formula of PL’ atomic formula of PL sentence of PL bound variable.

Slides:



Advertisements
Similar presentations
1.3 Predicates and Quantifiers
Advertisements

The First-Order Variable Hierachy on Ordered Graphs Benjamin Rossman MIT.
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
The Logic of Quantified Statements
Chapter 3 Tuple and Domain Relational Calculus. Tuple Relational Calculus.
Section 1.3. More Logical Equivalences Constructing New Logical Equivalences We can show that two expressions are logically equivalent by developing.
Predicate Logic and the language PL  In SL, the smallest unit is the simple declarative sentence.  But many arguments (and other relationships between.
SL Truth value assignments. SL Truth value assignments PL Interpretation.
FOL Practice. Models A model for FOL requires 3 things: A set of things in the world called the UD A list of constants A list of predicates, relations,
The Language P 8 9 ( 8 x) ( 9 y) ( 8 z) 9 8. Quantificational Logic Quantificational Logic: Quantificational Logic is the logic of sentences involving.
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
For 42 – 47: UD = everything; Ax = x is an apple; Nxy = x is in y; Px = x is a pear; Rx = x is rotten; b = the basket 42There are apples and pears in the.
For Friday, read chapter 6, section 2. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class.
March 10: Quantificational Notions Interpretations: Every interpretation interprets every individual constant, predicate, and sentence letter of PL. Our.
Review Test 5 You need to know: How to symbolize sentences that include quantifiers of overlapping scope Definitions: Quantificational truth, falsity and.
Predicate Logic (PL) 1.Syntax: The language of PL Formula VS. Sentence Symbolize A-, E, I-, and O-sentences 2.Semantic: a sentence compare two sentences.
March 5: more on quantifiers We have encountered formulas and sentences that include multiple quantifiers: Take, for example: UD: People in Michael’s office.
Copyright © Cengage Learning. All rights reserved.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
PL continued: Quantifiers and the syntax of PL 1. Quantifiers of PL 1. Quantifier symbols 2. Variables used with quantifiers 2. Truth functional compounds.
1Everyone that Michael likes likes either Henry or Sue 2Michael likes everyone that both Sue and Rita like 3Michael likes everyone that either Sue or Rita.
1 Section 3.4 Recursive Definitions. 2 Recursion Recursion is the process of defining an object in terms of itself Technique can be used to define sequences,
1 Number Theory and Methods of Proof Content: Properties of integer, rational and real numbers. Underlying theme: Methods of mathematical proofs.
Adapted from Discrete Math
Predicates and Quantifiers
Section 1.3: Predicates and Quantifiers
English  FOL: universal quantifier The structure of the universal quantifier is:  X(... ...) Key words in an English sentence that indicates an universal.
The Foundations: Logic and Proofs
Logical Equivalence & Predicate Logic
Theoretical basis of GUHA Definition 1. A (simplified) observational predicate language L n consists of (i) (unary) predicates P 1,…,P n, and an infinite.
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
1st-order Predicate Logic (FOL)
1 Language Definitions Lecture # 2. Defining Languages The languages can be defined in different ways, such as Descriptive definition, Recursive definition,
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
© Jalal Kawash 2010Peeking into Computer Science George Boole English Mathematician His The Mathematical Analysis of Logic, 1848 is the first.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
1Everyone that Michael likes likes either Henry or Sue 2Michael likes everyone that both Sue and Rita like 3Michael likes everyone that either Sue or Rita.
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
First Order Logic Dr. Rogelio Dávila Pérez Professor - Researcher Information Technologies Department ITESM, Campus Guadalajara.
Nested Quantifiers Section 1.5.
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.
CS-554 Part-3: First-Order Logic
Discrete Mathematics CS 2610 August 22, Agenda Last class Propositional logic Logical equivalences This week Predicate logic & rules of inference.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
 Term- number or product of a number and a variable  Constant- term with no variable  Coefficient- number that multiplies to a variable  Like Terms-
1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
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.
EXAMPLE FORMULA DEFINITION 1.
Predicate Calculus Discussion #14 Chapter 2, Section 1 1/20.
Discussion #14 Predicate Calculus
Chapter 1 The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
Predicate Calculus Discussion #14 Chapter 2, Section 1.
Syntax of First-Order Predicate Calculus (FOPC): 1. Alphabet
1st-order Predicate Logic (FOL)
Title the next blank page of your notebook: Grammar.
Discrete Mathematics Lecture 3: Predicate and Quantifier
For Wednesday, read chapter 8, section 2 (pp )
Formal Methods in software development
George Boole English Mathematician
Predicates and Quantifiers
Chapter 1: Propositional and First-Order Logic
CS201: Data Structures and Discrete Mathematics I
Predicate Calculus. Predicate Calculus Topics Predicates Variables and instantiation Quantifiers Logical expressions Bound and free variables.
Relational Calculus Chapter 4, Part B 7/1/2019.
1st-order Predicate Logic (FOL)
Presentation transcript:

Test 4 Review For test 4, you need to know: Definitions the recursive definition of ‘formula of PL’ atomic formula of PL sentence of PL bound variable free variable

Test 4 Review You need to know: The kinds of formulas of PL How to identify formulas of each kind How to break down a formula identifying its main logical operator its immediate subformula or subformulas any main logical operators of its immediate subformulas and its subformulas, and so forth and remember that for any formula P of PL, and remember that for any formula P of PL, P is itself a subformula

Test 4 Review Identify the subformulas of: (  y) [(Iay  Iya) & ~Gyy] Main logical operator Kind of formula Immediate subformula Main logical operators (if any) of it or them Immediate subformulas (if any) of it or them The formula itself

Test 4 Review (  y) [(Iay  Iya) & ~Gyy] Main logical operator: (  y) Kind of formula: quantified formula Immediate subformula: (Iay  Iya) & ~Gyy MLO: & Immediate subformulas: Iay  Iya and Gyy Left formula’s MLO is  and immediate subformulas are lay and lya. They and Gyy are atomic formulas.

Test 4 Review The subformulas of (  y) [(Iay  Iya) & ~Gyy]: (  y) [(Iay  Iya) & ~Gyy] (Iay  Iya) & ~Gyy Gyy (Iay  Iya) Iay Iya

Test 4 Review You need to be able to: Symbolize English sentences into PL using a provided symbolization key If appropriate, provide a symbolization using a universal quantifier and one using an existential quantifier for a sentence. Construct a symbolization key appropriate to a provided set of sentences

Test 4 Review (new slide) Equivalent forms: 1. All As are Bs. (  x) (P  Q)~ (  x) (P & ~Q) 2. Some As are Bs. (  x) (P & Q)~(  x) (P  ~Q) 3. Some As are not Bs. (  x) (P & ~Q)~(  x) (P  ~B) 4. No As are Bs. (  x) (P  ~Q)~(  x) (P & Q)

Test 4 Review To provide a symbolization key for a set of sentences, you need to: Specify a UD Provide formulas for all predicates Provide constants for names and definite descriptions. The UD can be as general as ‘Everything’ or as specific as ‘the jelly beans in this jar’. Consider the sentences, the predicates you’ll need, etc.

Test 4 Review Construct a symbolization key for the following set of sentences: ‘Witches are made of wood.’ ‘All things made of wood float.’ ‘Witches float.’ ‘Joan is a witch.’ UD: Everything Wx: x is a witch Mx: x is made of wood Fx: x floats j: Joan

Symbolizing English sentences in PL UD: the positive integers Lxyx is larger than y Sxyx is smaller than y Ex:x is even Ox:x is odd Dx:x is evenly divisible by 2 a:2 b:3

UD: the positive integers Lxy: x is larger than y Sxy: x is smaller than y Ex: x is even Ox: x is odd Dx: x is evenly divisible by 2 a: 2 b: 3 Even positive integers are evenly divisible by 2. No odd positive integer is evenly divisible by 2. If 3 is evenly divisible by 2, 3 is even. Any positive integer not evenly divisible by 2 is odd. 2 is smaller than 3, but 2 is even. 3 is not larger than itself, but it is larger than 2.

How changing the UD makes a difference UD: the positive integers and UD: the positive integers and Charles Ix:x is a positive integer Lxyx is larger than y Sxyx is smaller than y Ex:x is even Ox:x is odd Dx:x is evenly divisible by 2 a:2 b:3 c: Charles

Changing the UD makes a difference Even positive integers are evenly divisible by 2. (  x) [(Ix & Ex)  Dx] or ~(  x) [Ix & Ex) & ~Dx] No odd positive integer is evenly divisible by 2. ~(  x) [(Ix & Ox) & Dx] or (  x) [Ix & Ox)  ~Dx] Any positive integer not evenly divisible by 2 is odd. (  x) [Ix & ~Dx)  Ox] or ~(  x) [(Ix & ~Dx) & ~Ox]

Changing the UD makes a difference No positive integer is larger than Charles. ~(  x) (Ix & Lxc) (  x) (Ix  ~Lxc) Charles is larger than some positive integer. (  x) (Ix & Lcx) ~(  x) (Ix  ~Lcx)

1 UD:Marbles Rx:x is red Gx:x is green Bx:x is blue Sx:x is a shooter Cx:x is a cat’s eye 2 UD: The marbles being used by Sarah and Mark Mx:x is a marble Rx:x is red Gx:x is green Bx:x is blue Sx:x is a shooter Cx:x is a cat’s eye

Symbolize each of the following sentences using UD 1, and then using UD 2: 1. None of the marbles is red but some are shooters. 2. No red marble is a blue marble. 3. Some marbles are red or cat’s eyes, but no marble is both. 4. Some but not all of the marbles are blue. 5. Some of the marbles are cat’s eyes and some are shooters, but none of the marbles is red. 6. All the marbles that are shooters are red.