290 search results - page 17 / 58 » Theorem Proving Using Lazy Proof Explication |
APAL
2008
14 years 9 months ago
2008
Abstract. We prove a version of the associated sheaf functor theorem in Algebraic Set Theory. The proof is established working within a Heyting pretopos equipped with a system of s...
65
Voted
CSL
1994
Springer
15 years 1 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
LPAR
2001
Springer
15 years 1 months ago
2001
Springer
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
APAL
2005
14 years 9 months ago
2005
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...