301 search results - page 18 / 61 » On extensions of a theorem of Baxter |
FOCS
2002
IEEE
14 years 11 days ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
POPL
1993
ACM
13 years 11 months ago
1993
ACM
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
COMBINATORICS
2007
13 years 7 months ago
2007
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...
IGPL
2008
13 years 7 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
MKM
2004
Springer
14 years 23 days ago
2004
Springer
We describe an extension of first-order logic with sequence variables and sequence functions. We define syntax, semantics and inference system for the extension so that Completen...