DeepAI AI Chat
Log In Sign Up

Towards Concise, Machine-discovered Proofs of Gödel's Two Incompleteness Theorems

05/06/2020
by   Elijah Malaby, et al.
0

There is an increasing interest in applying recent advances in AI to automated reasoning, as it may provide useful heuristics in reasoning over formalisms in first-order, second-order, or even meta-logics. To facilitate this research, we present MATR, a new framework for automated theorem proving explicitly designed to easily adapt to unusual logics or integrate new reasoning processes. MATR is formalism-agnostic, highly modular, and programmer-friendly. We explain the high-level design of MATR as well as some details of its implementation. To demonstrate MATR's utility, we then describe a formalized metalogic suitable for proofs of Gödel's Incompleteness Theorems, and report on our progress using our metalogic in MATR to semi-autonomously generate proofs of both the First and Second Incompleteness Theorems.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/17/2020

Learning to Prove Theorems by Learning to Generate Theorems

We consider the task of automated theorem proving, a key AI task. Deep l...
09/21/2020

Synthesizing Lemmas for Inductive Reasoning

Recursively defined structures and properties about them are naturally e...
02/11/2014

Machine Learner for Automated Reasoning 0.4 and 0.5

Machine Learner for Automated Reasoning (MaLARea) is a learning and reas...
11/29/2012

Learning-Assisted Automated Reasoning with Flyspeck

The considerable mathematical knowledge encoded by the Flyspeck project ...
09/29/2020

Generating Mutually Inductive Theorems from Concise Descriptions

We describe defret-mutual-generate, a utility for proving ACL2 theorems ...
01/03/2022

Formalising Geometric Axioms for Minkowski Spacetime and Without-Loss-of-Generality Theorems

This contribution reports on the continued formalisation of an axiomatic...
03/12/2023

MizAR 60 for Mizar 50

As a present to Mizar on its 50th anniversary, we develop an AI/TP syste...