335 search results - page 18 / 67 » Compact Proofs of Retrievability |
JSYML
1998
14 years 10 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
CHI
1995
ACM
15 years 2 months ago
1995
ACM
The field of information retrieval has traditionallyfocused on s consistingof titlesand abstracts. As a consequence, many underlying assumptions must be altered for retrieval fro...
CADE
2003
Springer
15 years 11 months ago
2003
Springer
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
FLOPS
2010
Springer
15 years 6 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
72
Voted
AIIA
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...