3 search results - page 1 / 1 » Order Structures and Generalisations of Szpilrajn's Theorem |
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
X;R ;R R R X X R R 1 2 1 2 1 1 2 1 2 2 1 2
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
ENTCS
2006
13 years 7 months ago
2006
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...