A system of inference based on proof search: an extended abstract
Author:
Open Access
- 26 June 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-11
Abstract
Gentzen designed his natural deduction proof system to "come as close as possible to actual reasoning." Indeed, natural deduction proofs closely resemble the static structure of logical reasoning in mathematical arguments. However, different features of inference are compelling to capture when one wants to support the process of searching for proofs. PSF (Proof Search Framework) attempts to capture these features naturally and directly. The design and metatheory of PSF are presented, and its ability to specify a range of proof systems for classical, intuitionistic, and linear logic is illustrated.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- A formal framework for specifying sequent calculus proof systemsTheoretical Computer Science, 2013
- A focused approach to combining logicsAnnals of Pure and Applied Logic, 2011
- Specifying Proof Systems in Linear Logic with SubexponentialsElectronic Notes in Theoretical Computer Science, 2011
- A Logical Characterization of Forward and Backward Chaining in the Inverse MethodJournal of Automated Reasoning, 2008
- Specifying theorem provers in a higher-order logic programming language2005
- Forum: A multiple-conclusion specification logicTheoretical Computer Science, 1996
- A framework for defining logicsJournal of the ACM, 1993
- Logic Programming with Focusing Proofs in Linear LogicJournal of Logic and Computation, 1992
- Linear logicTheoretical Computer Science, 1987
- A natural extension of natural deductionThe Journal of Symbolic Logic, 1984