Strict finitism and the logic of mathematical applications (Q381241)

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}.