# Best-Path Theorem Proving: Compiling Derivations

Research output: Chapter in Book/Report/Conference proceedingChapter

## Abstract

When computers answer our questions in mathematics and logic they need also to be able to supply justification and explanatory insight. Typical theorem provers do not do this. The paper focuses on tableau theorem provers for First Order Predicate Calculus. The paper introduces a general construction and a technique for converting the tableau data structures of these to human friendly linear proofs using any familiar rule set and ‘laws of thought’. The construction uses a type of tableau in which only leaf nodes are extended. To produce insightful proofs, improvements need to be made to the intermediate output. Dependency analysis and refinement, ie compilation of proofs, can produce benefits. To go further, the paper makes other suggestions including a perhaps surprising one: the notion of best proof or insightful proof is an empirical matter. All possible theorems, or all possible proofs, distribute evenly, in some sense or other, among the possible uses of inference steps. However, with the proofs of interest to humans this uniformity of distribution does not hold. Humans favor certain inferences over others, which are structurally very similar. The author’s research has taken many sample questions and proofs from logic texts, scholastic tests, and similar sources, and analyzed the best proofs for them (‘best’ here usually meaning shortest). This empirical research gives rise to some suggestions on heuristic. The general point is: humans are attuned to certain forms inference, empirical research can tell us what those are, and that empirical research can educate as to how tableau theorem provers, and their symbiotic linear counterparts, should run. In sum, tableau theorem provers, coupled with transformations to linear proofs and empirically sourced heuristic, can provide transparent and accessible theorem proving.

Original language English (US) Studies in History and Philosophy of Science(Netherlands) Springer Science and Business Media B.V. 255-274 20 https://doi.org/10.1007/978-94-007-3983-3_18 Published - 2012

### Publication series

Name Studies in History and Philosophy of Science(Netherlands) 28 1871-7381 2215-1958

## Keywords

• Leaf Node
• Natural Deduction
• Skolem Function
• Standard Tableau
• Theorem Prover

## ASJC Scopus subject areas

• History and Philosophy of Science
• History
• Philosophy

## Fingerprint

Dive into the research topics of 'Best-Path Theorem Proving: Compiling Derivations'. Together they form a unique fingerprint.