Proof-terms for classical and intuitionistic resolution

From MaRDI portal





There is a sharp distinction between local methods of automated deduction for classical logic and global methods. For a nonclassical logic many attempts to formulate local methods fail to preserve the essential properties of local methods for classical systems. In this paper, the authors extend Parigot's \(\lambda\mu\)-calculus to include disjunction and explicit substitution. They present a suitable system of realizers for full classical logic and some characterization of the intuitionistic force of such realizers. Then this characterization is lifted to resolution via Mints's translation. The presented results support a type-theoretical analysis of search spaces in both classical and intuitionistic logic.











This page was built for publication: Proof-terms for classical and intuitionistic resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487255)