318 search results - page 17 / 64 » Real Number Computability and Domain Theory |
TPHOL
2007
IEEE
15 years 5 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
ML
2000
ACM
14 years 10 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
CADE
2005
Springer
15 years 11 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
JUCS
2010
14 years 5 months ago
2010
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...
100
click to vote
ASWSD
2004
Springer
15 years 4 months ago
2004
Springer
– A safety-critical real-time computer system must provide its services with a dependability that is much better than the dependability of any one of its constituent components. ...