1302 search results - page 108 / 261 » Free-Style Theorem Proving |
121
click to vote
EJC
2010
15 years 4 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
114
click to vote
JCT
2008
15 years 4 months ago
2008
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
116
click to vote
AML
2000
15 years 4 months ago
2000
We study a local version of the order property in several frameworks, with an emphasis on frameworks where the compactness theorem fails: (1) Inside a fixed model, (2) for classes ...
126
click to vote
JSYML
2010
14 years 11 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
164
click to vote
AIML
2004
15 years 5 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...