LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
sav08:classical_decision_problem [2008/04/02 23:06]
vkuncak
sav08:classical_decision_problem [2008/04/02 23:53]
vkuncak
Line 13: Line 13:
 For each such description,​ determine whether the subsets of formulas that satisfy it are decidable or not. For each such description,​ determine whether the subsets of formulas that satisfy it are decidable or not.
  
-Example: the exists-forall class that we will study is denoted ​+Example: the exists-forall class that we will look at shortly ​is denoted ​$[\exists^* \forall^*,​all,​(0)]_{=}$.
  
 ===== References ===== ===== References =====