A system of inference based on proof search: an extended abstract
Author:
Preprint
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
- Version 1, 2023-07-24, ArXiv
- Published version: , 1.
This publication has 12 references indexed in Scilit:
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systemsJournal of Logical and Algebraic Methods in Programming, 2022
- Mechanized Metatheory RevisitedJournal of Automated Reasoning, 2018
- A formal framework for specifying sequent calculus proof systemsTheoretical Computer Science, 2013
- A focused approach to combining logicsAnnals of Pure and Applied Logic, 2011
- A Framework for Proof SystemsJournal of Automated Reasoning, 2010
- A Logical Characterization of Forward and Backward Chaining in the Inverse MethodJournal of Automated Reasoning, 2008
- Normal Natural Deduction Proofs (in classical logic)Studia Logica, 1998
- Forum: A multiple-conclusion specification logicTheoretical Computer Science, 1996
- Logic Programming with Focusing Proofs in Linear LogicJournal of Logic and Computation, 1992
- Uniform proofs as a foundation for logic programmingAnnals of Pure and Applied Logic, 1991