62 search results - page 8 / 13 » On a Generalisation of Herbrand's Theorem |
CCCG
2009
13 years 8 months ago
2009
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
JUCS
2010
13 years 2 months ago
2010
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
FOCS
2002
IEEE
14 years 15 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...
JCT
2007
13 years 7 months ago
2007
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Parameterised monads have the same relationship to adjunctions with parameters as monads do to adjunctions. In this paper, we investigate algebras for parameterised monad...