Three Dogmas of First-Order Logic and some Evidence-based Consequences for Constructive Mathematics of differentiating between Hilbertian Theism, Brouwerian Atheism and Finitary Agnosticism


Authors
Abstract
We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. We then adopt what may be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. We then consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary, evidence-based, definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways. We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences.
Keywords Agnosticism, algorithmic computability, algorithmic verifiability, atheism, axiom of choice, Bell's inequalities, Bohm, Brouwer, categoricity, Classical Mechanics, Cohen, completeness, comprehension axiom, consistency, de Broglie, emergence, entanglement, EPR paradox, epsilon-calculus, finitary, formal quantification, first-order logic FOL, fundamental dimensionless constants, Goedel, Goodstein's Theorem, Heisenberg, Hilbert, interpretation, Intuitionism, Law of Excluded Middle LEM, Lucas' Goedelian argument, model, omega-consistency, omega-rule, Peano Arithmetic, Poincare, Quantum Mechanics, Rosser's Rule C, second-order arithmetic, subsystem ACA0, Schroedinger's cat paradox, Tarski, theism, truth assignments, uncertainty, undecidability, unspecified.
Categories (categorize this paper)
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Paradox Without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Computability and Logic.George S. Boolos, John P. Burgess & Richard C. Jeffrey - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.

View all 61 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Internal Categoricity in Arithmetic and Set Theory.Jouko Väänänen & Tong Wang - 2015 - Notre Dame Journal of Formal Logic 56 (1):121-134.
Towards Applied Theories Based on Computability Logic.Giorgi Japaridze - 2010 - Journal of Symbolic Logic 75 (2):565-601.
Finitism: An Essay on Hilbert's Programme.David Watson Galloway - 1991 - Dissertation, Massachusetts Institute of Technology
Troubles with (the Concept of) Truth in Mathematics.Roman Murawski - 2006 - Logic and Logical Philosophy 15 (4):285-303.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
An Open Formalism Against Incompleteness.Francesc Tomàs - 1999 - Notre Dame Journal of Formal Logic 40 (2):207-226.
A System of Arithmetic in Modal Logic.Lee Merrill Davidson - 1981 - Dissertation, Yale University
A Constructive Analysis of Learning in Peano Arithmetic.Federico Aschieri - 2012 - Annals of Pure and Applied Logic 163 (11):1448-1470.

Analytics

Added to PP index
2018-05-31

Total views
329 ( #17,651 of 2,271,537 )

Recent downloads (6 months)
57 ( #13,238 of 2,271,537 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature