446 search results - page 58 / 90 » A Combinatorial Theorem for Trees |
100
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
JLP
2007
14 years 11 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
103
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
CADE
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
CSL
2001
Springer
15 years 4 months ago
2001
Springer
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...