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.
We say that a first order theoryTislocally finiteif every finite part ofThas a finite model. It is the purpose of this paper to construct in a uniform way for any consistent theoryTa locally finite theory FIN which is syntactically isomorphic toT.Our construction draws upon the main idea of Paris and Harrington  and generalizes the syntactic aspect of their result from arithmetic to arbitrary theories. The first mathematically strong locally finite theory, called FIN, was defined in . Now we get (...) much stronger ones, e.g. FIN.From a physicalistic point of view the theorems of ZF and their FIN-counterparts may have the same meaning. Therefore FIN is a solution of Hilbert's second problem. It eliminates ideal objects from the proofs of properties of concrete objects.In  we will demonstrate that one can develop a direct finitistic intuition that FIN is locally finite. We will also prove a variant of Gödel's second incompleteness theorem for the theory FIN and for all its primitively recursively axiomatizable consistent extensions.The results of this paper were announced in . (shrink)
The nominalistic ontology of Kotarbinski, Slupecki and Tarski does not provide any direct interpretations of the sets of higher types which play important roles in type theory and in set theory. For this and other reasons I will interpret those theories as descriptions of some finite structures which are actually constructed in human imaginations and stored in their memories. Those structures will be described in this lecture. They are hinted by the idea of Skolem functions and Hilbert's -symbols, and they (...) constitute a finitistic modification of Tarski's concept of a model. They suggest also a form of the evolutionary process which leads to the development of human intelligence and language. (shrink)
We show that several theorems about Polish spaces, which depend on the axiom of choice ), have interesting corollaries that are theorems of the theory \, where \ is the axiom of dependent choices. Surprisingly it is natural to use the full \ to prove the existence of these proofs; in fact we do not even know the proofs in \. Let \ denote the axiom of determinacy. We show also, in the theory \\), a theorem which strenghtens and generalizes (...) the theorem of Drinfeld and Margulis about the unicity of Lebesgue’s measure. This generalization is false in \, but assuming the existence of large enough cardinals it is true in the model \,\in \rangle \). (shrink)
We show that strong measure zero sets -totally bounded metric space) can be characterized by the nonexistence of a winning strategy in a certain infinite game. We use this characterization to give a proof of the well known fact, originally conjectured by K. Prikry, that every dense \ subset of the real line contains a translate of every strong measure zero set. We also derive a related result which answers a question of J. Fickett.
This paper consists of three parts supplementing the papers of K. Hauser 2002 and D. Mumford 2000: There exist regular open sets of points in with paradoxical properties, which are constructed without using the axiom of choice or the continuum hypothesis. There exist canonical universes of sets in which one can define essentially all objects of mathematical analysis and in which all our intuitions about probabilities are true. Models satisfying the full axiom of choice cannot satisfy all those intuitions and (...) they violate them in a very similar way as those models which satisfy also the continuum hypothesis. (shrink)