Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers

08/14/2022
by   Christoph Benzmüller, et al.
0

This paper reports on an exploration of variants of Boolos' curious inference, using higher-order automated theorem provers (ATPs). Surprisingly, only a single shorthand notation had to be provided by hand. All higher-order lemmas required for obtaining short proof are automatically discovered by the ATPs. Given the observations and suggestions in this paper, full proof automation of Boolos' example on the speedup of proof lengths, and related examples, now seems to be within reach for higher-order ATPs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2018

The Higher-Order Prover Leo-III

The automated theorem prover Leo-III for classical higher-order logic wi...
research
08/21/2013

Formalization, Mechanization and Automation of Gödel's Proof of God's Existence

Gödel's ontological proof has been analysed for the first-time with an u...
research
02/08/2018

The Higher-Order Prover Leo-III (Extended Version)

The automated theorem prover Leo-III for classical higher-order logic wi...
research
08/16/2022

SAT-Inspired Higher-Order Eliminations

We generalize several propositional preprocessing techniques to higher-o...
research
12/19/2018

Coroutines with Higher Order Functions

Coroutines are non-preemptive concurrent subroutines that, unlike preemp...
research
08/08/2016

Holophrasm: a neural Automated Theorem Prover for higher-order logic

I propose a system for Automated Theorem Proving in higher order logic u...
research
10/01/2015

Higher-order asymptotics for the parametric complexity

The parametric complexity is the key quantity in the minimum description...

Please sign up or login with your details

Forgot password? Click here to reset