1717 search results - page 121 / 344 » A Computable Spectral Theorem |
241
click to vote
PADL
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Boyer and Moore's ACL2 theorem prover combines firstorder applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being...
138
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – prod...
122
click to vote
ECAI
1994
Springer
15 years 8 months ago
1994
Springer
1 We develop a learning component for a theorem prover designed for verifying statements by mathematical induction. If the prover has found a proof, it is analyzed yielding a so-ca...
125
click to vote
CPC
2004
15 years 4 months ago
2004
Heap ordered trees are planted plane trees, labelled in such a way that the labels always increase from the root to a leaf. We study two parameters, assuming that p of the n nodes ...
174
click to vote
ISSAC
2011
Springer
14 years 7 months ago
2011
Springer
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-...