q logic
-
The language of propositions
-
Applications
- Translating proprisations
-
Logical Equivalences
Predicate Logic
-
-
We are extending propositional logic
- like we are using variables, because everything isn’t binary just like HS operator
- All, every some and stuff like that
-
Variables
-
expressions with variables are not propositions
- they don’t have truth tables as they are analog
-
Quantifiers
-
English words
- all
- some
-
the two most important quantifiers are:
- universal quantifier: “for all” symbol ∀
- existential quantifier: “there exists” ∃
-
Example
- all students in this class took a class n java
-
some students in this class took a class in java
-
Worst case scenario
- when the domain of the guy is finite we can think of the worst case scenario as the default
- ∃xP(x) loop through all x in the domain
- if at some step, p(x) is true, then ∃xP(x)
-
Equivalence in predicate logic
- statements that has predicates and quantifiers are equivalently
Proofs