The Quantum Strategy of Completeness: On the Self-Foundation of Mathematics

Cultural Anthropology eJournal (Elsevier: SSRN) 5 (136):1-12 (2020)
  Copy   BIBTEX


Gentzen’s approach by transfinite induction and that of intuitionist Heyting arithmetic to completeness and the self-foundation of mathematics are compared and opposed to the Gödel incompleteness results as to Peano arithmetic. Quantum mechanics involves infinity by Hilbert space, but it is finitist as any experimental science. The absence of hidden variables in it interpretable as its completeness should resurrect Hilbert’s finitism at the cost of relevant modification of the latter already hinted by intuitionism and Gentzen’s approaches for completeness. This paper investigates both conditions and philosophical background necessary for that modification. The main conclusion is that the concept of infinity as underlying contemporary mathematics cannot be reduced to a single Peano arithmetic, but to at least two ones independent of each other. Intuitionism, quantum mechanics, and Gentzen’s approaches to completeness an even Hilbert’s finitism can be unified from that viewpoint. Mathematics may found itself by a way of finitism complemented by choice. The concept of information as the quantity of choices underlies that viewpoint. Quantum mechanics interpretable in terms of information and quantum information is inseparable from mathematics and its foundation.



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

Representation and Reality by Language: How to make a home quantum computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.
Quantum Complementarity: Both Duality and Opposition.Vasil Penchev - 2020 - Metaphysics eJournal (Elsevier: SSRN) 13 (13):1-6.
The Completeness: From Henkin's Proposition to Quantum Computer.Vasil Penchev - 2018 - Логико-Философские Штудии 16 (1-2):134-135.
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
Undecidability and intuitionistic incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
Hilbert’s Program.Richard Zach - 2003 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Center for the Study of Language and Information, Stanford University.


Added to PP

163 (#79,179)

6 months
28 (#44,245)

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

No references found.

Add more references