Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
sav08:exists-forall_class_definition [2008/04/03 13:42] vkuncak |
sav08:exists-forall_class_definition [2009/05/14 13:09] vkuncak |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== Exists-Forall Class Definition ====== | ====== Exists-Forall Class Definition ====== | ||
+ | |||
+ | Also called [[wp>Paul Bernays|Berneys]]-[[wp>Schoenfinkel]] class and Effectively Propositional Logic (EPR). | ||
Notation according to [[Classical Decision Problem]] classification: $[\exists^* \forall^*,all,(0)]_{=}$ | Notation according to [[Classical Decision Problem]] classification: $[\exists^* \forall^*,all,(0)]_{=}$ | ||
Line 9: | Line 11: | ||
* no function symbols | * no function symbols | ||
- | === Example === | + | ===== Examples ===== |
For binary relations $r,s,t$ to express $r \circ s \subseteq t$, we can introduce binary relation symbols $R$, $S$, $T$ and write formula | For binary relations $r,s,t$ to express $r \circ s \subseteq t$, we can introduce binary relation symbols $R$, $S$, $T$ and write formula |