1410 search results - page 90 / 282 » Proving theorems by reuse |
AML
2011
13 years 5 months ago
2011
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
EUC
2005
Springer
14 years 3 months ago
2005
Springer
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
GCC
2003
Springer
14 years 3 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
ICFP
1999
ACM
14 years 2 months ago
1999
ACM
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
CSFW
2000
IEEE
14 years 1 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...