A new viewpoint of the Gödel's incompleteness theorem and its applications

05/08/2018
by   Tianheng Tsui, et al.
0

A new viewpoint of the Gödel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a proof of statement in first order logic from finite concrete examples, and an approach be proposed to improve searching mathematical proof by neural network.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2017

A Proof of Stavi's Theorem

Kamp's theorem established the expressive equivalence of the temporal lo...
research
05/15/2023

Eigenvariables, bracketing and the decidability of positive minimal predicate logic

We give a new proof of a theorem of Mints that the positive fragment of ...
research
12/15/2017

A Heuristic Proof Procedure for First-Order Logic

Inspired by the efficient proof procedures discussed in Computability l...
research
03/05/2020

From Kruskal's theorem to Friedman's gap condition

Harvey Friedman's gap condition on embeddings of finite labelled trees p...
research
07/18/2022

CD Tools – Condensed Detachment and Structure Generating Theorem Proving (System Description)

CD Tools is a Prolog library for experimenting with condensed detachment...
research
01/27/2022

Positive First-order Logic on Words and Graphs

We study FO+, a fragment of first-order logic on finite words, where mon...
research
07/21/2018

Towards Neural Theorem Proving at Scale

Neural models combining representation learning and reasoning in an end-...

Please sign up or login with your details

Forgot password? Click here to reset