2920 search results - page 17 / 584 » Finite information logic |
111
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
CSL
2008
Springer
15 years 1 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
CADE
2004
Springer
16 years 2 days ago
2004
Springer
CATS
2006
15 years 1 months ago
2006
The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). Whi...
78
Voted
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These ...