2019viXraRequires access

Shorter Refutation of Gödel’s Completeness Theorem

Colin James

Open publisher page 0 citations

Abstract

The completeness theorem rendered as (∀x.R(x,x))→(∀x∃y.R(x,y)) is not tautologous. The application of Isabelle/HOL to prove the same also is not tautologous, to invalidate that tool. These demonstrations form a non tautologous fragment of the universal logic VŁ4.

About this research paper

What this paper is about

The completeness theorem rendered as (∀x.R(x,x))→(∀x∃y.R(x,y)) is not tautologous. The application of Isabelle/HOL to prove the same also is not tautologous, to invalidate that tool. These demonstrations form a non tautologous fragment of the universal logic VŁ4.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The completeness theorem rendered as (∀x.R(x,x))→(∀x∃y.R(x,y)) is not tautologous. The application of Isabelle/HOL to prove the same also is not tautologous, to invalidate that tool. These demonstrations form a non tautologous fragment of the universal logic VŁ4.

Key concepts: Completeness (order theory), HOL, Gödel's completeness theorem, Fragment (logic), Mathematics, Discrete mathematics, Gödel, Calculus (dental)

Related papers

Back to paper searchBrowse research topicsOriginal source
Shorter Refutation of Gödel’s Completeness Theorem — Research Paper | ScholarLens