1717 search results - page 99 / 344 » A Computable Spectral Theorem |
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
In Theorem 6.1 of [3] it was shown that, when v = r + c - 1, every triple array TA(v, k, rr, cc, k : r ? c) is a balanced grid BG(v, k, k : r?c). Here we prove the converse of thi...
123
click to vote
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
We prove in this paper that if r and s are two semilinear power series in commuting variables and s has bounded coefficients, then r-s is a rational series. This result can be tho...
136
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
142
click to vote
JLP
2000
15 years 4 months ago
2000
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
114
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...