Predicate Logic

Universal quantification
∀
Everyone at NUS is smart:
∀x At(x,NUS) ⇒ Smart(x )
∀x P is true in a model m iff P is true with x being each possible object
in the model
Roughly speaking, equivalent to the conjunction of instantiations of
P
At(KingJohn,NUS) ⇒ Smart(KingJohn)
∧ At(Richard,NUS) ⇒ Smart(Richard)
∧ At(NUS,NUS) ⇒ Smart(NUS)
∧
...
Artificial Intelligence: Predicate Logic Slide: 15