Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...