A system of inference based on proof search: an extended abstract

07/24/2023
by   Dale Miller, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/05/2023

Proof-theoretic Semantics and Tactical Proof

The use of logical systems for problem-solving may be as diverse as in p...
research
01/29/2022

Logical Pseudocode: Connecting Algorithms with Proofs

Proofs (sequent calculus, natural deduction) and imperative algorithms (...
research
02/20/2023

A modest proposal: explicit support for foundational pluralism

Whilst mathematicians assume classical reasoning principles by default t...
research
06/04/2019

Learning dynamic polynomial proofs

Polynomial inequalities lie at the heart of many mathematical discipline...
research
12/05/2017

Determinism in the Certification of UNSAT Proofs

The search for increased trustworthiness of SAT solvers is very active a...
research
06/13/2020

Modelling High-Level Mathematical Reasoning in Mechanised Declarative Proofs

Mathematical proofs can be mechanised using proof assistants to eliminat...
research
04/04/2023

Introduction to Pylog

PyLog is a minimal experimental proof assistant based on linearised natu...

Please sign up or login with your details

Forgot password? Click here to reset