The Eternal Unprovability Filter – Part I

Dissertation, Thinkstrike (2016)
  Copy   BIBTEX

Abstract

I prove both the mathematical conjectures P ≠ NP and the Continuum Hypothesis are eternally unprovable using the same fundamental idea. Starting with the Saunders Maclane idea that a proof is eternal or it is not a proof, I use the indeterminacy of human biological capabilities in the eternal future to show that since both conjectures are independent of Axioms and have definitions connected with human biological capabilities, it would be impossible to prove them eternally without the creation and widespread acceptance of new axioms. I also show that the same fundamental concepts cannot be used to demonstrate the eternal unprovability of many other mathematical theorems and open conjectures. Finally I investigate the idea’s implications for the foundations of mathematics including its relation to Godel’s Incompleteness Theorem and Tarsky’s Undefinability Theorem.

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Unprovability and Proving Unprovability.Mingzhong Cai - 2015 - Studia Logica 103 (3):559-578.
Reflections on Concrete Incompleteness.G. Longo - 2011 - Philosophia Mathematica 19 (3):255-280.
Spinoza on Composition, Causation, and the Mind's Eternity.John Grey - 2014 - British Journal for the History of Philosophy 22 (3):446-467.
The Notion of Explanation in Gödel’s Philosophy of Mathematics.Krzysztof Wójtowicz - 2019 - Studia Semiotyczne—English Supplement 30:85-106.
The Eternal Recurrence and Nietzsche’s Ethic of Virtue.Lester H. Hunt - 1993 - International Studies in Philosophy 25 (2):3-11.
A Note on Derivability Conditions.Taishi Kurahashi - 2020 - Journal of Symbolic Logic 85 (3):1224-1253.
Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.
Incompleteness in the Finite Domain.Pavel Pudlák - 2017 - Bulletin of Symbolic Logic 23 (4):405-441.
It Depends on What One Means by “Eternal”: Why Boethius is not an Eternalist.Michael Wiitala - 2010 - Proceedings of the American Catholic Philosophical Association 84:253-261.
Unprovability threshold for the planar graph minor theorem.Andrey Bovykin - 2010 - Annals of Pure and Applied Logic 162 (3):175-181.

Analytics

Added to PP
2016-08-21

Downloads
476 (#60,260)

6 months
52 (#99,924)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references