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.

In the paper below the authors describe three super-tasks. They show that although the abstract notion of a super-task may be, as Benacerraf suggested, a conceptual mismatch, the completion of the three super-tasks involved can be defined rather naturally, without leading to inconsistency, by means of a particular kinematical interpretation combined with a principle of continuity.