1410 search results - page 55 / 282 » Proving theorems by reuse |
JSYML
2007
13 years 9 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
Various new nonembeddability results (mainly into L1) are proved via Fourier analysis. In particular, it is shown that the Edit Distance on {0, 1}d has L1 distortion (log d) 1 2 â...
LICS
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper we describe the promoted tyft tyxt rule format for de ning higher-order languages. The rule format is a generalization of Groote and Vaandrager's tyft tyxt form...
APAL
2010
13 years 10 months ago
2010
We introduce a new and general notion of canonical extension for algebras in the algebraic counterpart AlgS of any finitary and congruential logic S. This definition is logic-base...
DCG
2008
13 years 10 months ago
2008
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...