Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
By a well-known result of Cook and Reckhow [4, 12], all Frege systems for the Classical Propositional Calculus (CPC) are polynomially equivalent. Mints and Kojevnikov [11] have re...
Abstract: Interoperability for information systems remains a challenge both at the semantic and organisational levels. The original three-level architecture for local databases nee...
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...