DeepAI AI Chat
Log In Sign Up

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

by   Elijah Malaby, et al.

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.


page 1

page 2

page 3

page 4


Learning to Prove Theorems by Learning to Generate Theorems

We consider the task of automated theorem proving, a key AI task. Deep l...

Synthesizing Lemmas for Inductive Reasoning

Recursively defined structures and properties about them are naturally e...

Machine Learner for Automated Reasoning 0.4 and 0.5

Machine Learner for Automated Reasoning (MaLARea) is a learning and reas...

Learning-Assisted Automated Reasoning with Flyspeck

The considerable mathematical knowledge encoded by the Flyspeck project ...

Generating Mutually Inductive Theorems from Concise Descriptions

We describe defret-mutual-generate, a utility for proving ACL2 theorems ...

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

This contribution reports on the continued formalisation of an axiomatic...

MizAR 60 for Mizar 50

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