Fermat’s last theorem proved in Hilbert arithmetic. I. From the proof by induction to the viewpoint of Hilbert arithmetic

Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (7):1-57 (2021)
  Copy   BIBTEX

Abstract

In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it.

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Hilbert arithmetic as a Pythagorean arithmetic: arithmetic as transcendental.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (54):1-24.
Finite Arithmetic with Infinite Descent.Yvon Gauthier - 1989 - Dialectica 43 (4):329-337.
Abelian groups and quadratic residues in weak arithmetic.Emil Jeřábek - 2010 - Mathematical Logic Quarterly 56 (3):262-278.
Satisfying Predicates: Kleene's Proof of the Hilbert–Bernays Theorem.Gary Ebbs - 2015 - History and Philosophy of Logic 36 (4):346-366.
The Quantum Strategy of Completeness: On the Self-Foundation of Mathematics.Vasil Penchev - 2020 - Cultural Anthropology eJournal (Elsevier: SSRN) 5 (136):1-12.
Godel's theorem in retrospect.Martin Tabakov - 1984 - Bulletin of the Section of Logic 13 (3):132-134.

Analytics

Added to PP
2022-03-10

Downloads
337 (#60,680)

6 months
131 (#29,279)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Vasil Penchev
Bulgarian Academy of Sciences

Citations of this work

No citations found.

Add more citations

References found in this work

Non-standard Analysis.Gert Heinz Müller - 2016 - Princeton University Press.
Mental causation.Stephen Yablo - 1992 - Philosophical Review 101 (2):245-280.
The Problem of Hidden Variables in Quantum Mechanics.Simon Kochen & E. P. Specker - 1967 - Journal of Mathematics and Mechanics 17:59--87.
Paradox without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251-252.
Is Conceivability a Guide to Possibility?Stephen Yablo - 1993 - Philosophy and Phenomenological Research 53 (1):1–42.

View all 77 references / Add more references