1717 search results - page 56 / 344 » A Computable Spectral Theorem |
162
click to vote
TPHOL
1997
IEEE
15 years 8 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
138
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show th...
136
click to vote
ARTS
1999
Springer
15 years 8 months ago
1999
Springer
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...
114
click to vote
GC
2007
Springer
15 years 3 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
138
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...