446 search results - page 78 / 90 » A Theorem Prover for a Computational Logic |
108
click to vote
CSFW
2012
IEEE
13 years 8 days ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
ACL2
2006
ACM
15 years 3 months ago
2006
ACM
Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a pa...
BIRTHDAY
1997
Springer
15 years 2 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...