Journal of Symbolic Logic 46 (3):625-633 (1981)
AbstractWe define a first-order theory FIN which has a recursive axiomatization and has the following two properties. Each finite part of FIN has finite models. FIN is strong enough to develop that part of mathematics which is used or has potential applications in natural science. This work can also be regarded as a consistency proof of this hitherto informal part of mathematics. In FIN one can count every set; this permits one to prove some new probabilistic theorems
Similar books and articles
Objective Probabilities in Number Theory.J. Ellenberg & E. Sober - 2011 - Philosophia Mathematica 19 (3):308-322.
Infinity: New Research Frontiers.Michał Heller & W. H. Woodin (eds.) - 2011 - Cambridge University Press.
Finite Mathematics and the Justification of the Axiom of Choicet.Pierluigi Miraglia - 2000 - Philosophia Mathematica 8 (1):9-25.
Part II. Perspectives on Infinity From Mathematics : 2. The Mathematical Infinity / Enrico Bombieri ; 3. Warning Signs of a Possible Collapse of Contemporary Mathematics. [REVIEW]Edward Nelson - 2011 - In Michał Heller & W. H. Woodin (eds.), Infinity: New Research Frontiers. Cambridge University Press.
On the Existence of Strong Chains in ℘(Ω1)/Fin.Piotr Koszmider - 1998 - Journal of Symbolic Logic 63 (3):1055 - 1062.
Added to PP
Historical graph of downloads
Citations of this work
Theological Metaphors in Mathematics.Stanisław Krajewski - 2016 - Studies in Logic, Grammar and Rhetoric 44 (1):13-30.
Infinity and continuum in the alternative set theory.Kateřina Trlifajová - 2021 - European Journal for Philosophy of Science 12 (1):1-23.
Point-Free Topological Spaces, Functions and Recursive Points; Filter Foundation for Recursive Analysis. I.Iraj Kalantari & Lawrence Welch - 1998 - Annals of Pure and Applied Logic 93 (1-3):125-151.
A Constructive Approach to Nonstandard Analysis.Erik Palmgren - 1995 - Annals of Pure and Applied Logic 73 (3):297-325.