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
Previous revision
Last revision Both sides next revision
sav08:classical_decision_problem [2008/04/02 23:53]
vkuncak
sav08:classical_decision_problem [2008/04/02 23:58]
vkuncak
Line 6: Line 6:
  
 Classify formulas according to Classify formulas according to
-  ​* presence or absence of equality in formulas +  * regular expression describing the sequence of quantifiers (e.g. $\exists^* \forall^*$ means formulas $\exists ​x_1. \ldots. \exists ​x_n. \forall ​y_1.\ldots \forall y_m. F$ where $F$ is quantifier-free)
-  ​* regular expression describing the sequence of quantifiers (e.g. $\exists^* \forall^*$ means formulas $\forall ​x_1. \ldots. \forall ​x_n. \exists ​y_1.\ldots \exists y_n. F$)+
   * number and arity of relation symbols   * number and arity of relation symbols
   * number and arity of function symbols   * number and arity of function symbols
 +  * presence or absence of equality in formulas
  
 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.