446 search results - page 29 / 90 » A Theorem Prover for a Computational Logic |
CADE
2007
Springer
15 years 10 months ago
2007
Springer
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...
84
Voted
TAPSOFT
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
DIAGRAMS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We have developed a diagrammatic logic for theorem proving, focusing on the domain of metric-space analysis (a geometric domain, but traditionally taught using a dry alge...