0% found this document useful (0 votes)
14 views14 pages

Lecture 04 Propositional Function and Quantifiers

Uploaded by

Dimi Legaspi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views14 pages

Lecture 04 Propositional Function and Quantifiers

Uploaded by

Dimi Legaspi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

Lecture 04

Proposition or not?
1. She is beautiful.

2. The lions in Manila Zoo are fierce.

3. x is greater than 3.
Subject and Predicate
1. She is beautiful.
Subject:
Predicate:

2. x is greater than 3.
Subject:
Predicate:

subject – focus of the sentence


Predicate – refers to anything about the subject
Propositional function
 Symbolic equivalent of predicate

e.g. x is greater than 3.

variable:
Propositional function:

*when the variables in a propositional function are


assigned values, the resulting statement becomes
a proposition with a certain truth value.
Truth values of propositional
functions
1. Let P(x) denote “x > 3”. What is the truth
value of P(3)?

2. Let A(x) denote “Student with student


number x belongs to batch 2008.” What is the
truth value of A(2007-69833)?
Quantifiers
 One way of creating a proposition from a
propositional function
 Expresses the extent to which the predicate

covers (domain of discourse or just domain)

1. universal quantifier
2. existential quantifier
Universal quantification

 
 The universal quantification of P(x) is the statement
P(x) for all values of x in the domain
Notation: xP(x)
“for all x, P(x)”
“for every x, P(x)”
where is called the universal quantifier
 xP(x) is false iff there is a value x in the domain for which P(x )
0 0
is false. x0 is called a counterexample.
e.g. All BSAM students batch 2015 at UP Mindanao are lefthanded.
predicate/propositional function?
domain?
counterexample?
in symbols?
True or False?
What if the domain is empty?
  
xP(x) will still be true since there is no value
in the domain for which P(x) will be false
Universal quantification and
conjunction
  
Given a domain containing x1, x2, …, xn. xP(x)
is the same as the conjunction
P(x1) P(x2) … P(xn)

e.g. Write the equivalent conjunction of xP(x) if


P(x) is the statement “x2 < 10” and the domain
consists of the positive integers not exceeding
4.
Existential quantification

 
 The existential quantification of P(x) is the proposition
There exists an element x in the domain such that P(x).
Notation: xP(x)
“There is an x such that P(x).”
“There is at least one x such that P(x).”
“For some x, P(x).”
 xP(x) is true iff P(x) is true for at least one value of x in

the domain.
e.g. There exists a BSAM batch 2015 student of UPMin
who lives outside Davao City.
predicate/propositional function?
domain?
true or false?
What if the domain is empty?
  
xP(x) will be false since there is no value in
the domain for which P(x) will be true
Existential quantification and
disjunction
  
Given a domain containing x1, x2, …, xn. xP(x)
is the same as the disjunction
P(x1) P(x2) … P(xn)

e.g. Write the equivalent conjunction of xP(x) if


P(x) is the statement “x2 > 10” and the domain
consists of the positive integers not exceeding
4.
Quantifiers with restricted domains
  x<0(x2>0)

 y≠0(y3≠0)

 z>0(z2=2)
Negation
   Negation
xP(x) ~ xP(x)  x ~P(x)

xP(x) ~ xP(x)  x ~P(x)

Negate:
All BSAM students batch 2014 at UP Mindanao are
lefthanded.
There exists a BSAM batch 2014 student of UPMin
who lives outside Davao City.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy