We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...