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

@article{Benzmller2022WhoFT,
  title={Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers},
  author={Christoph Benzm{\"u}ller and David Fuenmayor and Alexander Steen and Geoff Sutcliffe},
  journal={ArXiv},
  year={2022},
  volume={abs/2208.06879}
}
This paper reports on an exploration of Boolos’ Curious Inference, using higher-order automated theorem provers (ATPs). Surprisingly, only suitable shorthand notations had to be provided by hand for ATPs to find a short proof. The higher-order lemmas required for constructing a short proof are automatically discovered by the ATPs. Given the observa-tions and suggestions in this paper, full proof automation of Boolos’ and related examples now seems to be within reach of higher-order ATPs 

References

SHOWING 1-10 OF 45 REFERENCES

A curious inference

Z is an inference in the first-order predicate calculus with identity and function signs, and it should be evident from the sketch that there is a derivation of (6) from (l)-(5) in any standard axiomatic system of second-order logic whose every symbol can easily be written down.

A Critique of Proof Planning

  • A. Bundy
  • Computer Science
    Computational Logic: Logic Programming and Beyond
  • 2002
This work critically examine proof planning, identifying both its strengths and weaknesses, and uses this analysis to explore ways of enhancing proof planning to overcome its current weaknesses.

Introducing StarExec: a Cross-Community Infrastructure for Logic Solving

StarExec allows community organizers to store, manage and make available benchmark libraries; competition organizers to run logic solver competitions; and community members to do comparative evaluations of logic solvers on public or private benchmark problems.

Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure

Key developments have been the specification of the THF language, the addition of higher-order problems to theTPTP, the development of the TPTP THF infrastructure, several ATP systems for higher- order logic, and the use of higher -order ATP in a range of domains.

A Lost Proof

We re-investigate a proof example presented by George Boolos which perspicuously illustrates Gödel’s argument for the potentially drastic increase of proof-lengths in formal systems when carrying

cvc5: A Versatile and Industrial-Strength SMT Solver

This paper serves as a comprehensive system description of cvc5 ’s architectural design and highlights the major features and components introduced since CVC4 1.8.

Faster, Higher, Stronger: E 2.3

The basic logical and software architecture of the system, as well as core features of the implementation, are described, including recently added features and extensions, including the extension to many-sorted logic, optional limited support for higher-order logic, and the integration of SAT techniques via PicoSAT.

Superposition with Lambdas

A superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans is designed and implemented in the Zipperposition prover and evaluated on TPTP and Isabelle benchmarks.

Faster, higher, stronger.

  • B. Rubin
  • Medicine
    American journal of respiratory and critical care medicine
  • 2013
Identification of asthma phenotypes using cluster analysis in the Severe Asthma Research Program and Cluster analysis and clinical asthma phenotype, and obesity, asthma, and oxidative stress.

Isabelle/HOL: A Proof Assistant for Higher-Order Logic

This presentation discusses Functional Programming in HOL, which aims to provide students with an understanding of the programming language through the lens of Haskell.