Strict finitism and the logic of mathematical applications
The aim of the book under review is to show that some applied classical mathematical theories can be developed within strict finitism, more exactly in a fragment of quantifier-free primitive recursive arithmetic \textbf{PRA} with the accepted functions limited to elementary recursive functions. Consequently, strict finitism is elementary recursive mathematics. It can be interpreted as a theory about concrete and finite computational devices. Hence one can try to solve in this way the problem of applicability of classical mathematical theories to the world of physical entities which are finite and discrete. The book consists of 8 chapters. In Chapter 1, the philosophical motivations are introduced. The general philosophical position of the author is radical naturalism and nominalism. Chapter 2 presents the logical framework for strict finitism. Chapter 3 develops the basics of calculus within strict finitism. In Chapters 4--8, some other advanced applied mathematical theories are developed within strict finitism, in particular metric spaces (Chapter 4), complex analysis (Chapter 5), integration (Chapter 6), Hilbert spaces (Chapter 7) and semi-Riemannian geometry (Chapter 8). They contain a case study of demonstrating applicability by reducing to strict finitism. It should be added that developing mathematics within strict finitism is very close to developing mathematics in Errett Bishop's constructive mathematics. Hence the monograph under review follows many ideas from the book [Constructive analysis. Berlin etc.: Springer-Verlag (1985; Zbl 0656.03042)] by \textit{E. Bishop} and \textit{D. Bridges}.
- Finite mathematics as the foundation of classical mathematics and quantum theory. With applications to gravity and particle theory
- Introduction to a naturalistic philosophy of mathematics
- Mathematics and its applications. A transcendental-idealist perspective
- The applicability of mathematics as a scientific and a logical problem
- scientific article; zbMATH DE number 6316615
- Explicit finitism
- Concrete mathematics. Finitistic approach to foundations
- The paradox of phase transitions in the light of constructive mathematics
- Introduction to a naturalistic philosophy of mathematics
- scientific article; zbMATH DE number 193711 (Why is no real title available?)
- Strict finitism and the happy sorites
- A constructive version of the extremum value theorem for spaces of vector-valued functions
- Foundations as truths which organize mathematics
- Finite mathematics as the foundation of classical mathematics and quantum theory. With applications to gravity and particle theory
- A type D breakdown of the Navier Stokes equation in d = 3 spatial dimensions
- On a finitary version of mathematical analysis
- Strict finitism and feasibility
- Wright's strict finitistic logic in the classical metatheory: the propositional case
- Completely discretized, finite quantum mechanics
- Practical stability analysis of sliding-mode control with explicit computation of sampling time
- Computer-assisted proofs for Lyapunov stability via sums of squares certificates and constructive analysis
- Fundamental limit on angular measurements and rotations from quantum mechanics and general relativity
This page was built for publication: Strict finitism and the logic of mathematical applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q381241)
