On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz” in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based on a world of objects that could only be grasped (...) adequately by infinitary means. So the refutation might serve as a final clue to his epistemological credo.Whereas the Skolem paradox was to raise a lot of concern in the twenties and the early thirties, it seemed to have been settled by the time Zermelo wrote his paper, namely in favour of Skolem's approach, thus also accepting the noncategoricity and incompleteness of the first-order axiom systems. So the paper might be considered a late-comer in a community of logicians and set theorists who mainly followed finitary conceptions, in particular emphasizing the role of first-order logic. However, Zermelo never shared this viewpoint: In his first letter to Gödel of September 21, 1931, he had written that the Skolem paradox rested on the erroneous assumption that every mathematically definable notion should be expressible by a finite combination of signs, whereas a reasonable metamathematics would only be possible after this “finitistic prejudice” would have been overcome, “a task I have made my particular duty”. (shrink)

I discuss Skolem's own ideas on his ‘paradox’, some classical disputes between Skolemites and Antiskolemites, and the underlying notion of ‘informal mathematics’, from a point of view which I hope to be rather unusual. I argue that the Skolemite cannot maintain that from an absolute point of view everything is in fact denumerable; on the other hand, the Antiskolemite is left with the onus of explaining the notion of informal mathematical knowledge of the intended model of set theory. (...) 1 conclude that one must take seriously the embodiment of the uncountable into countable languages, as a symptom of some specific features which characterize mathematical languages with respect to other languages. (shrink)

On October 4, 1937, Zermelo composed a small note entitled “Der Relativismus in der Mengenlehre und der sogenannte Skolemsche Satz”(“Relativism in Set Theory and the So-Called Theorem of Skolem”) in which he gives a refutation of “Skolem's paradox”, i.e., the fact that Zermelo-Fraenkel set theory—guaranteeing the existence of uncountably many sets—has a countable model. Compared with what he wished to disprove, the argument fails. However, at a second glance, it strongly documents his view of mathematics as based (...) on a world of objects that could only be grasped adequately by infinitary means. So the refutation might serve as a final clue to his epistemological credo.Whereas the Skolem paradox was to raise a lot of concern in the twenties and the early thirties, it seemed to have been settled by the time Zermelo wrote his paper, namely in favour of Skolem's approach, thus also accepting the noncategoricity and incompleteness of the first-order axiom systems. So the paper might be considered a late-comer in a community of logicians and set theorists who mainly followed finitary conceptions, in particular emphasizing the role of first-order logic (cf. [8]). However, Zermelo never shared this viewpoint: In his first letter to Gödel of September 21, 1931, (cf. [1]) he had written that the Skolem paradox rested on the erroneous assumption that every mathematically definable notion should be expressible by a finite combination of signs, whereas a reasonable metamathematics would only be possible after this “finitistic prejudice” would have been overcome, “a task I have made my particular duty”. (shrink)

Skolem's Paradox involves a seeming conflict between two theorems from classical logic. The Löwenheim Skolem theorem says that if a first order theory has infinite models, then it has models whose domains are only countable. Cantor's theorem says that some sets are uncountable. Skolem's Paradox arises when we notice that the basic principles of Cantorian set theory—i.e., the very principles used to prove Cantor's theorem on the existence of uncountable sets—can themselves be formulated as (...) a collection of first order sentences. How can the very principles which prove the existence of uncountable sets be satisfied by a model which is itself only countable? How can a countable model satisfy the first order sentence which says that there are uncountably many mathematical objects—e.g., uncountably many real numbers? (shrink)

A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality. Its investigation needs philosophical (...) means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. A comparison to Mach’s doctrine is used to be revealed the fundamental and philosophical reductionism of Husserl’s phenomenology leading to a kind of Pythagoreanism in the final analysis. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. Thus the problem which of the two mathematics is more relevant to our being is discussed. An information interpretation of the Schrödinger equation is involved to illustrate the above problem. (shrink)

The Lowenheim-Skolem theorems say that if a first-order theory has infinite models, then it has models which are only countably infinite. Cantor's theorem says that some sets are uncountable. Together, these theorems induce a puzzle known as Skolem's Paradox: the very axioms of set theory which prove the existence of uncountable sets can be satisfied by a merely countable model. ;This dissertation examines Skolem's Paradox from three perspectives. After a brief introduction, chapters two and three (...) examine several formulations of Skolem's Paradox in order to disentangle the roles which set theory, model theory, and philosophy play in these formulations. In these chapters, I accomplish three things. First, I clear up some of the mathematical ambiguities which have all too often infected discussions of Skolem's Paradox. Second, I isolate a key assumption upon which Skolem's Paradox rests, and I show why this assumption has to be false. Finally, I argue that there is no single explanation as to how a countable model can satisfy the axioms of set theory ;In chapter four, I turn to a second puzzle. Why, even though philosophers have known since the early 1920's that Skolem's Paradox has a relatively simple technical solution, have they continued to find this paradox so troubling? I argue that philosophers' attitudes towards Skolem's Paradox have been shaped by the acceptance of certain, fairly specific, claims in the philosophy of language. I then tackle these philosophical claims head on. In some cases, I argue that the claims depend on an incoherent account of mathematical language. In other cases, I argue that the claims are so powerful that they render Skolem's Paradox trivial. In either case, though, examination of the philosophical underpinnings of Skolem's Paradox renders that paradox decidedly unparadoxical. ;Finally, in chapter five, I turn away from "generic" formulations of Skolem's Paradox to examine Hilary Putnam's "model-theoretic argument against realism." I show that Putnam's argument involves mistakes of both the mathematical and the philosophical variety, and that these two types of mistake are closely related. Along the way, I clear up some of the mutual charges of question begging which have characterized discussions between Putnam and his critics. (shrink)

Some analogous higher-order versions of Skolem’s paradox will be introduced. The generalizability of two solutions for Skolem’s paradox will be assessed: the course-book approach and Bays’ one. Bays’ solution to Skolem’s paradox, unlike the course-book solution, can be generalized to solve the higher-order paradoxes without any implication about the possibility or order of a language in which mathematical practice is to be formalized.

Over the years, Skolem’s Paradox has generated a fairly steady stream of philosophical discussion; nonetheless, the overwhelming consensus among philosophers and logicians is that the paradox doesn’t constitute a mathematical problem (i.e., it doesn’t constitute a real contradiction). Further, there’s general agreement as to why the paradox doesn’t constitute a mathematical problem. By looking at the way firstorder structures interpret quantifiers—and, in particular, by looking at how this interpretation changes as we move from structure to structure—we (...) can give a technically adequate “solution” to Skolem’s Paradox. So, whatever the philosophical upshot of Skolem’s Paradox may be, the mathematical side of Skolem’s Paradox seems to be relatively straightforward. (shrink)

We will formulate some analogous higher-order versions of Skolem’s paradox and assess the generalizability of two solutions for Skolem’s paradox to these paradoxes: the textbook approach and that of Bays (2000). We argue that the textbook approach to handle Skolem’s paradox cannot be generalized to solve the parallel higher-order paradoxes, unless it is augmented by the claim that there is no unique language within which the practice of mathematics can be formalized. Then, we argue (...) that Bays’ solution to the original Skolem’s paradox, unlike the textbook solution, can be generalized to solve the higher-order paradoxes without any implication about the possibility or order of a language in which mathematical practice is to be formalized. (shrink)

. Remarkably, despite the tremendous success of axiomatic set-theory in mathematics, logic and meta-mathematics, e.g., model-theory, two philosophical worries about axiomatic set-theory as the adequate catch of the set-concept keep haunting it. Having dealt with one worry in a previous paper in this journal, we now fulfil a promise made there, namely to deal with the second worry. The second worry is the Skolem Paradox and its ensuing Skolemite skepticism. We present a comparatively novel and simple analysis of (...) the argument of the Skolemite skeptic, which will reveal a general assumption concerning the meaning of the set-concept (we call it Connexion M). We argue that the Skolemite skeptics argument is a petitio principii and that consequently we find ourselves in a dialectical situation of stalemate.Few (if any) working set-theoreticians feel a tension – let alone see a paradox – between, on the one hand, what the Löwenheim–Skolem theorems and related results seem to be telling us about the set-concept, and, on the other hand, their uncompromising and successful use of the set-concept and their continuing enthusiasm about it, in other words: their lack of skepticism about the set-concept. Further, most (if not all) working settheoreticians have a relaxed attitude towards the ubiquitous undecidability phenomenon in set-theory, rather than a worrying one. We argue these are genuine philosophical problems about the practice of set-theory. We propound solutions, which crucially involve a renunciation of Connexion M. This breaks the dialectical situation of stalemate against the Skolemite skeptic. (shrink)

This paper shows how to conservatively extend theories formulated in non-classical logics such as the Logic of Paradox, the Strong Kleene Logic and relevant logics with Skolem functions. Translations to and from the language extended by Skolem functions into the original one are presented and shown to preserve derivability. It is also shown that one may not always substitute s=f(t) and A(t, s) even though A determines the extension of a function and f is a Skolem (...) function for A. (shrink)

Hume's Principle requires the existence of the finite cardinals and their cardinal, but these are the only cardinals the Principle requires. Were the Principle an analysis of the concept of cardinal number, it would already be peculiar that it requires the existence of any cardinals; an analysis of bachelor is not expected to yield unmarried men. But that it requires the existence of some cardinals, the countable ones, but not others, the uncountable, makes it seem invidious; it is as if (...) an analysis of people required that there be men but not women, or whites but not blacks. If we deprive the Principle of existential commitments, it will cease to yield Dedekind's axioms for the natural numbers and so fail a good test of material adequacy. But since there are cardinals no second-order theory guarantees, neither can the Principle be beefed up to require all cardinals. (shrink)

The articles in this volume represent a part of the philosophical literature on higher-order logic and the Skolem paradox. They ask the question what is second-order logic? and examine various interpretations of the Lowenheim-Skolem theorem.

A. N. Turing’s 1936 concept of computability, computing machines, and computable binary digital sequences, is subject to Turing’s Cardinality Paradox. The paradox conjoins two opposed but comparably powerful lines of argument, supporting the propositions that the cardinality of dedicated Turing machines outputting all and only the computable binary digital sequences can only be denumerable, and yet must also be nondenumerable. Turing’s objections to a similar kind of diagonalization are answered, and the implications of the paradox for the (...) concept of a Turing machine, computability, computable sequences, and Turing’s effort to prove the unsolvability of the Entscheidungsproblem, are explained in light of the paradox. A solution to Turing’s Cardinality Paradox is proposed, positing a higher geometrical dimensionality of machine symbol-editing information processing and storage media than is available to canonical Turing machine tapes. The suggestion is to add volume to Turing’s discrete two-dimensional machine tape squares, considering them instead as similarly ideally connected massive three-dimensional machine information cells. Three-dimensional computing machine symbol-editing information processing cells, as opposed to Turing’s two-dimensional machine tape squares, can take advantage of a denumerably infinite potential for parallel digital sequence computing, by which to accommodate denumerably infinitely many computable diagonalizations. A three-dimensional model of machine information storage and processing cells is recommended on independent grounds as better representing the biological realities of digital information processing isomorphisms in the three-dimensional neural networks of living computers. (shrink)