Journal of Symbolic Logic

Analysis Without Actual Infinity

Jan Mycielski

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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

Article information

Source
J. Symbolic Logic, Volume 46, Issue 3 (1981), 625-633.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183740834

Mathematical Reviews number (MathSciNet)
MR627910

Zentralblatt MATH identifier
0466.03024

JSTOR
links.jstor.org

Citation

Mycielski, Jan. Analysis Without Actual Infinity. J. Symbolic Logic 46 (1981), no. 3, 625--633. https://projecteuclid.org/euclid.jsl/1183740834


Export citation