60 search results - page 4 / 12 » Some extensions of the Cauchy-Davenport theorem |
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
PLILP
1998
Springer
13 years 11 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
JSYML
2010
13 years 2 months ago
2010
We generalize the model theory of small profinite structures developed by Newelski to the case of compact metric spaces considered together with compact groups of homeomorphisms a...
GC
2007
Springer
13 years 7 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
TYPES
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...