Name
Abstract | ||
|---|---|---|
Let 0 ≤ r q. We will define a new kind of quantifier $</font
>(q,r)\exists^{(q,r)}. Informally, $</font
>(q,r) xf</font
>\exists^{(q,r)} x\phi means “the number of positions x that satisfy Φ is congruent to r modulo q”. Formally, let w be a V-structure over A, and let x Ï</font
> n</font
>x \notin \nu. We obtain | w |\left | w \right | different ( n</font
>È</font
>{ x } )\left ( \nu \cup \left \{ x \right \} \right )-structures w’ by adjoining x to the second component of a letter of w. We define
w \vDash $</font
>(q,r) xf</font
>w \vDash \exists ^{(q,r)} x\phi
if and only if the number of these w’ for which
w¢</font
>\vDash f</font
>w' \vDash \phi
is congruent to r modulo q.
|
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-1-4612-0289-9_7 | Logic and Automata |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Howard Straubing | 1 | 528 | 60.92 |
| Denis Thérien | 2 | 671 | 55.71 |