We first consider the entailment logic MC, based on meaning containment, which contains neither the Law of Excluded Middle (LEM) nor the Disjunctive Syllogism (DS). We then argue that the DS may be assumed at least on a similar basis as the assumption of the LEM, which is then justified over a finite domain or for a recursive property over an infinite domain. In the latter case, use is made of Mathematical Induction. We then show that an instance of the (...) LEM is intrumental in the proof of Cantor's Theorem, and we then argue that this is based on a more general form than can be reasonably justified. We briefly consider the impact of our approach on arithmetic and naive set theory, and compare it with intuitionist mathematics and briefly with recursive mathematics. Our "Four Basic Logical Issues" paper would provide useful background, the current paper being an application of the some of the ideas in it. (shrink)

Turing was a philosopher of logic and mathematics, as well as a mathematician. His work throughout his life owed much to the Cambridge milieu in which he was educated and to which he returned throughout his life. A rich and distinctive tradition discussing how the notion of “common sense” relates to the foundations of logic was being developed during Turing’s undergraduate days, most intensively by Wittgenstein, whose exchanges with Russell, Ramsey, Sraffa, Hardy, Littlewood and others formed part of the backdrop (...) which shaped Turing’s work. Beginning with a Moral Sciences Club talk in 1933, Turing developed an “anthropological” approach to the foundations of logic, influenced by Wittgenstein, in which “common sense” plays a foundational role. This may be seen not only in “On Computable Numbers” and Turing’s dissertation ), but in his exchanges with Wittgenstein in 1939 and in two later papers, “The Reform of Mathematical Phraseology and Notation” and “Solvable and Unsolvable Problems”. (shrink)

A mahāvidyā inference is used for establishing another inference. Its Reason is normally an omnipresent property. Its Target is defined in terms of a general feature that is satisfied by different properties in different cases. It assumes that there is no case that has the absence of its Target. The main defect of a mahāvidyā inference μ is a counterbalancing inference that can be formed by a little modification of μ. The discovery of its counterbalancing inference can invalidate such an (...) inference. This paper will argue that Cantor’s diagonal argument too shares some features of the mahāvidyā inference. A diagonal argument has a counterbalanced statement. Its main defect is its counterbalancing inference. Apart from presenting an epistemological perspective that explains the disquiet over Cantor’s proof, this paper would show that both the mahāvidyā and diagonal argument formally contain their own invalidators. (shrink)

A German translation with 2017 postscript of Floyd, Juliet. 2012. "Wittgenstein's Diagonal Argument: A Variation on Cantor and Turing." In Epistemology versus Ontology, Logic, Epistemology: Essays in Honor of Per Martin-Löf, edited by P. Dybjer, S. Lindström, E. Palmgren and G. Sundholm, 25-44. Dordrecht: Springer Science+Business Media. An analysis of philosophical aspects of Turing's diagonal argument in his (136) "On computable numbers, with an application to the Entscheidungsproblem" in relation to Wittgenstein's writings on Turing and Cantor.

Turing’s famous 1936 paper “On computable numbers, with an application to the Entscheidungsproblem” defines a computable real number and uses Cantor’s diagonal argument to exhibit an uncomputable real. Roughly speaking, a computable real is one that one can calculate digit by digit, that there is an algorithm for approximating as closely as one may wish. All the reals one normally encounters in analysis are computable, like π, √2 and e. But they are much scarcer than the uncomputable (...) reals because, as Turing points out, the computable reals are countable, whilst the uncomputable reals have the power of the continuum. Furthermore, any countable set of reals has measure zero, so the computable reals have measure zero. In other words, if one picks a real at random in the unit interval with uniform probability distribution, the probability of obtaining an uncomputable real is unity. One may obtain a computable real, but that is in- finitely improbable. But how about individual examples of uncomputable reals? We will show two: H and the halting probability Ω, both contained in the unit interval. Their construction was anticipated in.. (shrink)

§1. Introduction. I dedicate this essay to the two-dozen-odd people whose refutations of Cantor's diagonal argument have come to me either as referee or as editor in the last twenty years or so. Sadly these submissions were all quite unpublishable; I sent them back with what I hope were helpful comments. A few years ago it occurred to me to wonder why so many people devote so much energy to refuting this harmless little argument—what had it done (...) to make them angry with it? So I started to keep notes of these papers, in the hope that some pattern would emerge.These pages report the results. They might be useful for editors faced with similar problem papers, or even for the authors of the papers themselves. But the main message to reach me is that there are several points of basic elementary logic that we usually teach and explain very badly, or not at all.In 1995 an engineer named William Dilworth, who had published a refutation of Cantor's argument in the Transactions of the Wisconsin Academy of Sciences, Arts and Letters, sued for libel a mathematician named Underwood Dudley who had called him a crank. (shrink)

In this paper, I try to accomplish two goals. The first is to provide a general characterization of a method of proofs called — in mathematics — the diagonal argument. The second is to establish that analogical thinking plays an important role also in mathematical creativity. Namely, mathematical research make use of analogies regarding general strategies of proof. Some of mathematicians, for example George Polya, argued that deductions is impotent without analogy. What I want to show is that (...) there exists a direct line leading from Cantor’s diagonal argument to constructions that underlies of the proofs of several important theorems of the mathematical logic (in particular, Church’s theorem concerning the undecidability of formal arithmetic, Gödel’s theorem concerning the incopleteness of formal arithmetic, Tarski’s theorem concerning truth, and Turing’s theorem concerning the Halting Problem), and that the line could be described as an analogical mapping. In other words, Cantor’s diagonal argument and the proofs of the limitative theorems are structurally the same. Hence they can be represented as instances (or special cases) of the same general scheme. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:The Uncanonical Dante: The Divine Comedy And Islamic PhilosophyPaul A. CantorThe distorted notions of invisible things which Dante and hisrival Milton have idealized, are merely the mask and the mantlein which these great poets walk through eternity enveloped anddisguised. It is a difficult question to determine how far theywere conscious of the distinction which must have subsisted intheir minds between their own creeds and that of the people.Dante at (...) least appears to wish to mark the full extent of it byplacing Riphaeus, whom Virgil calls justissimus unus, inParadise, and observing a most heretical caprice in hisdistribution of rewards and punishments.—Percy Shelley, A Defence of PoetryIThe case of Dante provides an excellent opportunity to open up the question of the Western canon. In one sense, Dante is the perfect example of a canonical author. His name is one of the few certain to appear on anybody’s short list of the truly central authors in the Western literary tradition. But in another sense Dante can be regarded as uncanonical. In his own day he was widely suspected of being heretical in his religious views, 1 and a careful reading of his works does indeed raise serious doubts about his being the pillar of orthodoxy he is often taken to be today. 2 Out of this interplay between the canonical and the noncanonical Dante, I hope to show that the issue of the Western canon is more complicated than either its defenders or its attackers generally present it.In discussing the issue of the canon, it is important to sort out at the [End Page 138] beginning what we do and do not mean by the term. A canonical work may merely be a work that has been accepted into the literary canon, one that has become a touchstone in the reading and teaching of literature. But the term canonical can suggest something else, that the work is orthodox and somehow represents a central authoritative position in Western culture. The word canonical is so loaded with religious connotations that it is difficult to separate the relatively neutral first meaning of the term from the loaded second meaning. Dante is a case in point. When people refer to him as a canonical author, they usually do not simply mean that he is widely read and taught. Most discussions of Dante today treat him as representing an authoritative cultural moment in the Western tradition, as the supreme embodiment of the medieval mind. Viewed that way, Dante becomes an emblem of everything contemporary critics of the Western canon bitterly hate and reject. The reason they feel that they must attack authors like Dante and displace them from the center of literary study is that these authors have come to stand for orthodoxy and thus seem to enforce the hegemony of Western culture.Critics who wish to champion various forms of non-Western culture have a particular axe to grind with canonical authors like Dante. The contemporary debate over the Western canon seems to be premised on a sharp opposition between Western and non-Western cultures, as if they were complete and irreconcilable antitheses, and even wholly unrelated. One of the principal charges against the Western canon is that it is Eurocentric, that it remains confined within a narrow orbit of European ideas and beliefs, thus excluding all other views of the world. A corrolary of the idea of Eurocentrism is the concept of Orientalism, developed by Edward Said. 3 Said argues that throughout its history, the Occident has defined itself in opposition to the Orient, basing its elevated self-image on a debased vision of the cultural Other. In Said’s argument, the Occident views itself as rational as opposed to an irrational Orient, as emotionally disciplined in contrast to an emotionally uncontrolled Orient, and as masculine over against a feminine Orient.In medieval Europe the Orient was chiefly represented by the Muslim world, and one does not have to look far in medieval literature to find the kinds of orientalist stereotypes about which Said writes. The French Song of Roland contains excellent examples, but even the Divine Comedy seems to... (shrink)

Cantor’s proof that the reals are uncountable forms a central pillar in the edifices of higher order recursion theory and set theory. It also has important applications in model theory, and in the foundations of topology and analysis. Due partly to these factors, and to the simplicity and elegance of the proof, it has come to be accepted as part of the ABC’s of mathematics. But even if as an Archimedean point it supports tomes of mathematical theory, there is (...) a question that demands clarification: What, exactly, does Cantor’s proof show? One of few places where this question is addressed is Appendix II of Wittgenstein’s Remarks on the Foundations of Mathematics. This essay is devoted to clarifying Wittgenstein’s remarks in that section. (shrink)

Drawing on Peter Harrison's argument that individuals should be attributed a central role in analyses of the relationship between science and religion, this article proposes that an understanding of personality can help us better appreciate a person's attitudes to both science and religion. Rather than seeing an individual's attitudes to these two topics as separate, if sometimes overlapping, parts of their lives, it is suggested that both may result from psychological drives and sometimes from the same psychological drive. Two (...) contrasting case studies are employed to illustrate this proposal. First, Paul Dirac who, it is argued, was on the autistic spectrum, a personality profile that is often linked to both mathematical physics and atheism. By contrast, Michael Faraday's scientific practice and his commitment to a specific form of Christianity were underpinned by his need for security, as assured by the God‐given laws that operated in both the physical and moral domains. (shrink)

Putnam construed the aim of Carnap’s program of inductive logic as the specification of a “universal learning machine,” and presented a diagonal proof against the very possibility of such a thing. Yet the ideas of Solomonoff and Levin lead to a mathematical foundation of precisely those aspects of Carnap’s program that Putnam took issue with, and in particular, resurrect the notion of a universal mechanical rule for induction. In this paper, I take up the question whether the Solomonoff–Levin proposal (...) is successful in this respect. I expose the general strategy to evade Putnam’s argument, leading to a broader discussion of the outer limits of mechanized induction. I argue that this strategy ultimately still succumbs to diagonalization, reinforcing Putnam’s impossibility claim. (shrink)

In a recent article, Christopher Ormell argues against the traditional mathematical view that the real numbers form an uncountably infinite set. He rejects the conclusion of Cantor’s diagonal argument for the higher, non-denumerable infinity of the real numbers. He does so on the basis that the classical conception of a real number is mys- terious, ineffable, and epistemically suspect. Instead, he urges that mathematics should admit only ‘well-defined’ real numbers as proper objects of study. In practice, this (...) means excluding as inadmissible all those real numbers whose decimal expansions cannot be calculated in as much detail as one would like by some rule. We argue against Ormell that the classical realist account of the continuum has explanatory power in mathematics and should be accepted, much in the same way that "dark matter" is posited by physicists to explain observations in cosmology. In effect, the indefinable real numbers are like the "dark matter" of real analysis. (shrink)

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)

Cantor's diagonal argument provides an indirect proof that there is no one-one function from the power set of a set A into A. This paper provides a somewhat more constructive proof of Cantor's theorem, showing how, given a function f from the power set of A into A, one can explicitly define a counterexample to the thesis that f is one-one.

Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses the semantic paradoxes, and how they arise as diagonal arguments and fixed point theorems in logic, computability theory, complexity theory and formal language theory.

Following Post program, we will propose a linguistic and empirical interpretation of Gödel’s incompleteness theorem and related ones on unsolvability by Church and Turing. All these theorems use the diagonal argument by Cantor in order to find limitations in finitary systems, as human language, which can make “infinite use of finite means”. The linguistic version of the incompleteness theorem says that every Turing complete language is Gödel incomplete. We conclude that the incompleteness and unsolvability theorems find limitations in (...) our finitary tool, which is our complete language. (shrink)

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by. In full topological models * is not generally definable, but over Cantor-space and the reals it can be classically shown that; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic.Over [0, 1], the operator * is (...) (constructively and classically) undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. (shrink)

Cantor argued that absolute infinity is beyond mathematical comprehension. His arguments imply that the domain of mathematics cannot be grasped by mathematical means. We argue that this inability constitutes a foundational problem. For Cantor, however, the domain of mathematics does not belong to mathematics, but to theology. We thus discuss the theological significance of Cantor’s treatment of absolute infinity and show that it can be interpreted in terms of negative theology. Proceeding from this interpretation, we refer to the recent (...) debate on absolute generality and argue that the method of diagonalization constitutes a modern version of the vianegativa. On our reading, negative theology can evoke an attitude of humility with respect to the boundedness of the human condition. Along these lines, we think that the foundational problem of mathematics concerning its domain can be addressed through a methodological attitude of humility. (shrink)

This short sketch of Gödel’s incompleteness proof shows how it arises naturally from Cantor’s diagonalization method [1891]. It renders Gödel’s proof and its relation to the semantic paradoxes transparent. Some historical details, which are often ignored, are pointed out. We also make some observations on circularity and draw brief comparisons with natural language. The sketch does not include the messy details of the arithmetization of the language, but the motives for it are made obvious. We suggest this as a (...) more efficient way to teach the topic than what is found in the standard textbooks. For the sake of self–containment Cantor’s original diagonalization is included. A broader and more technical perspective on diagonalization is given in [Gaifman 2005]. In [1891] Cantor presented a new type of argument that shows that the set of all binary sequences (sequences of the form a0, a1,…,an,…, where each ai is either 0 or 1) is not denumerable ─ that is, cannot be arranged in a sequence, where the index ranges over the natural numbers. Let A0, A2,…An, … be a sequence of binary sequences. Say An = an,0, an,1, …, an,i, … . Define a new sequence A* = b0, b1,…,bn,… , by putting. (shrink)

It would be an understatement to say that Russell was interested in Cantorian diagonal paradoxes. His discovery of the various versions of Russell’s paradox—the classes version, the predicates version, the propositional functions version—had a lasting effect on his views in philosophical logic. Similar Cantorian paradoxes regarding propositions—such as that discussed in §500 of The Principles of Mathematics—were surely among the reasons Russell eventually abandoned his ontology of propositions.1 However, Russell’s reasons for abandoning what he called “denoting concepts”, and his (...) rejection of similar “semantic dualisms” such as Frege’s theory of sense and reference—at least in “On Denoting”—made no explicit mention of any Cantorian paradox. My aim in this paper is to argue that such paradoxes do pose a problem for certain theories such as Frege’s, and early Russell’s, about how definite descriptions are meaningful. My first aim is simply to lay out the problem I have in mind. Next, I shall turn to arguing that the theories of descriptions endorsed by Frege and by Russell prior to “On Denoting” are susceptible to the problem. Finally, I explore what responses a.. (shrink)

Richard Kimberly Heck and Paolo Mancosu have claimed that the possibility of non-Cantorian assignments of cardinalities to infinite concepts shows that Hume's Principle (HP) is not implicit in the concept of cardinal number. Neologicism would therefore be threatened by the ‘good company' HP is kept by such alternative assignments. In his review of Mancosu's book, Bob Hale argues, however, that ‘getting different numerosities for different countable infinite collections depends on taking the groups in a certain order – but it is (...) of the essence of cardinal numbers that the cardinal size of a collection does not depend upon how its members are ordered'. This paper's goal is to implement Hale's response to the Good Company problem by producing a Cantorian argument for HP. In Section 2, we present the Heck-Mancosu argument against neologicism. In Section 3, we discuss Hale's defence of Hume's Principle. In Section 4, we discuss Cantor's abstractionist definitions of number. In Section 5, we argue that good abstraction must comply with what we call ‘Gödel’s Minimal Account of Abstraction’ (GMAA). We finally show (Sections 5 and 6) that non-Cantorian theories of cardinality fail to satisfy GMAA. (shrink)

In this short work, Cantor's famous 'diagonal' proof of the non-recursivity of the class of real numbers is stated and discussed.

I OFFER AN ANALYSIS OF DESCARTES'S COGITO WHICH IS RADICALLY NOVEL WHILE INCORPORATING MUCH AVAILABLE INSIGHT. BY ENLARGING FOCUS FROM THE DICTUM ITSELF TO THE REASONING OF DOUBT, DREAMING AND DEMON, I DEMONSTRATE A CLOSE PARALLEL TO THE LOGIC OF THE LIAR PARADOX. THIS HELPS TO EXPLAIN FAMILIAR PARADOXICAL FEATURES OF DESCARTES'S ARGUMENT. THE ACCOUNT PROVES TO BE TEXTUALLY ELEGANT AND, MOREOVER, HAS CONSIDERABLE INDEPENDENT PHILOSOPHICAL PLAUSIBILITY AS AN ACCOUNT OF MIND AND SELF.

The article deals with Cantor’s diagonal argument and its alleged philosophical consequences such as that there are more reals than integers and, hence, that some of the reals must be independent of language because the totality of words and sentences is always count-able. My claim is that the main flaw of the argument for the existence of non-nameable objects or truths lies in a very superficial understanding of what a name or representation actually is.

In lieu of an abstract, here is a brief excerpt of the content:The humble origins of Russell's paradox by J. Alberto Coffa ON SEVERAL OCCASIONS Russell pointed out that the discovery of his celebrated paradox concerning the class of all classes not belonging to themselves was intimately related to Cantor's proof that there is no greatest cardinal. lOne of the earliest remarks to that effect occurs in The Principles ofMathematics where, referring to the universal class, the class of all classes (...) and the class of all propositions, he notes that when we apply the reasoning of his [Cantor's] proofto the cases in question we find ourselves met by definite contradictions, of which the one discussed in Chapter x is an example. (P. 362) And in a footnote he adds: "It was in this way that I discovered this contradiction". Throughout his writings Russell left a number ofhints concerning the sort of connection he had drawn between Cantor's proof and his own discovery. In fact, his suggestions are so specific that there would seem to be little room left for speculation concerning how the discovery took place.2 The picture that emerges almost immediately from Russell's observations is the following. For reasons which are 1 See, e.g., Bertrand Russell, The Principles of Mathematics, 2nd ed. (London: Allen & Unwin, 1937), §§100, 344-9; G. Frege, Wissenschaftlicher Briefwechsel (Hamburg: Felix Meiner Verlag, 1976), pp. 215-16; B. Russell, Essays in Analysis, ed. D. Lackey (New York: George Braziller, 1973), p. 139; B. Russell, Introducrion to Mathemarical Philosophy (New York: Simon and Schuster, 1971), p. 136; B. Russell, My Philosophical Development (New York: Simon and Schuster, 1959), pp. 75-6; The Autobiography of Bertrand Russell, I (New York: Bantam Books, 1968), 195. 2 See, e.g., Ch. Thiel's "Einleitung des Herausgebers" in Frege, Wissenschaftlicher Briefwechsel, pp. 203 and 216 (footnote), and 1. Grattan-Guinness, "How Bertrand Russell Discovered his Paradox", Historia Marhematica, 5 (1978),127-37. 31 32 Russell, nos. 33-4 (Spring-Summer 1979) never made clear, Russell decided to analyze Cantor's argument applying it to "large" classes such as the universal class V, and the class of all classes. When, for example, we consider V, its power set and the correlationf(x) = {x} if x is not a class, f(x) =. x otherwise, then Cantor's diagonal class D turns out to be the class of all classes not belonging to themselves. Moreover, since the element ofV which is taken toD byfisD itself(i.e., sincef(D) = D), Cantor's reasoning invites us to raise the question whether D belongs tof(D) (i.e., toD) or not; and it establishes that it does precisely if it doesn't.3 The purpose of this note is to present recently uncovered information that complements and corrects our present understanding of Russell's discovery of his paradox. As it turns out, far from originating from his desire to apply the ideas in Cantor's theorem, a version of Russell's paradox first occurred in an argument that Russell had devised, late in 1900, in order to establish the invalidity of that theorem. An appeal to "large" classes such as V or Class was, as we shall see, essential to Russell's attempted refutation. As he displayed the details of his counterexample Russell's paradox emerged, at first unrecognized, as the by-product of a project that the paradox itself would eventually undermine. In a paper written in 1901 and largely devoted to a popular exposition and defence of Cantor's theory of the infinite, Russell expressed what appeared to be a rpinor reservation to Cantor's treatment : There is a greatest of all infinite numbers, which is the number of things altogether, of every sort and kind. It is obvious that there cannot be a greater number than this, because, if everything has been taken, there is nothing left to add. Cantor has a proof that there is no greatest number, and if this proof were valid, the contradictions of infinity would reappear in a sublimated form. But in this one point, the master has been guilty of a very subtle fallacy, which I hope to explain in some future work.4 3 See Principles, §349. Perhaps I should remind... (shrink)

Computationalism is the claim that all possible thoughts are computations, i.e. executions of algorithms. The aim of the paper is to show that if intentionality is semantically clear, in a way defined in the paper, then computationalism must be false. Using a convenient version of the phenomenological relation of intentionality and a diagonalization device inspired by Thomson's theorem of 1962, we show there exists a thought that cannot be a computation.

Computationalism is the claim that all possible thoughts are computations, i.e. executions of algorithms. The aim of the paper is to show that if intentionality is semantically clear, in a way defined in the paper, then computationalism must be false. Using a convenient version of the phenomenological relation of intentionality and a diagonalization device inspired by Thomson's theorem of 1962, we show there exists a thought that canno be a computation.

The exploration of metaphysical arguments in the symbolic AI environment provides clarification and raises unexpected questions about notions in philosophy of religion and theology. Recent attempts to apply automatic theorem prover technology to Anselm's ontological argument have led to a simplification of the argument. This computationally discovered simplification has given rise to logical observations. The article assesses one of these observations: the application of the diagonal method (in Cantor's version) to Anselm's argument. The evaluation of the (...) applications of theorem provers to metaphysical and theological arguments contributes to the following topics in philosophy of religion: the limits of natural theology, the relationship between religion and STEM, and theology's scientificity. (shrink)

Although recent evidence is somewhat ambiguous, if not confusing, Patrick Grim still seems to believe that his Cantorian argument against omniscienceis sound. According to this argument, it follows by Cantor’s power set theorem that there can be no set of all truths. Hence, assuming that omniscience presupposes precisely such a set, there can be no omniscient being. Reconsidering this argument, however, guided in particular by Alvin Plantinga’s critique thereof, I find it far from convincing. Not only (...) does it have an enormously untoward side effect, but it is self-referentially incoherent as well. (shrink)

This chapter presents a response to Chapter 1. The arguments put forward in that chapter attempted to drive us from the paradise created by Cantor’s theory of infinite number. The principal complaint is that Cantor’s proof that the subsets of a set are more numerous than its elements fails to yield an adequate diagnosis of Russell’s paradox. This chapter argues that Cantor’s proof was never meant to be a diagnosis of Russell’s paradox. Further, it argues that (...) class='Hi'>Cantor’s theory is fine as it is. (shrink)

§1. Introduction. I dedicate this essay to the two-dozen-odd people whose refutations of Cantor's diagonal argument have come to me either as referee or as editor in the last twenty years or so. Sadly these submissions were all quite unpublishable; I sent them back with what I hope were helpful comments. A few years ago it occurred to me to wonder why so many people devote so much energy to refuting this harmless little argument—what had it done (...) to make them angry with it? So I started to keep notes of these papers, in the hope that some pattern would emerge.These pages report the results. They might be useful for editors faced with similar problem papers, or even for the authors of the papers themselves. But the main message to reach me is that there are several points of basic elementary logic that we usually teach and explain very badly, or not at all.In 1995 an engineer named William Dilworth, who had published a refutation of Cantor's argument in the Transactions of the Wisconsin Academy of Sciences, Arts and Letters, sued for libel a mathematician named Underwood Dudley who had called him a crank. (shrink)

In the paper, a detailed analysis of some new logical aspects of Cantor’s diagonal proof of the uncountability of continuum is presented. For the first time, strict formal, axiomatic, and algorithmic definitions of the notions of potential and actual infinities are presented. It is shown that the actualization of infinite sets and sequences used in Cantor’s proof is a necessary, but hidden, condition of the proof. The explication of the necessary condition and its factual usage within the (...) framework of Cantor’s proof makes, Cantor’s proof invalid. It’s shown that traditional Cantor’s proof has a second necessary, but hidden as well, condition which is teleological by its nature, i.e., is not mathematical. The explication of the second necessary condition makes Cantor’s statement on the uncountability of continuum unprovable from the point of view of classical logic.One of the most dramatic facts in history of science is connected just with the notion of actual infinity and consists in the following. On the one hand, Aristotle, Berkeley, Locke, Descartes, Spinoza, Gauss, Kant, Cauchy, Kronecker, Hermite, Poincaré, Bair, Borel, Brouwer, Quine, Wittgenstein, Weyl, Luzin, and a lot of other outstanding creators of classical logic and classical mathematics, during millenniums, stated categorically and insistently warned about that the actual infinity is a self-contradictory notion and its usage in mathematics is inadmissible (e.g., according to Poincare, “There is no actual infinity. - Cantorians forgot that and fell into contradictions. Later generations will regard Mengenlehre (set theory) as a disease from which one has recovered”). On the other hand, a lot of outstanding scientists of the XX c.c., such as Hilbert, Church, Turing, Gödel, etc., and modern axiomatic set theory as a whole ignored this (intuitive though) opinion of genii and accepted Cantor’s “transfinite paradise”, based on the actual infinity. In the paper some logical, philosophical, and psychological aspects of this historical “favorable opposition” are analyzed, and the fact that the scientific intuition of genii has won the historical battle against the mytho-’logic’ of Cantor’s transfinite ‘paradise’ is explained and logically justified. (shrink)

In the paper, a detailed analysis of some new logical aspects of Cantor’s diagonal proof of the uncountability of continuum is presented. For the first time, strict formal, axiomatic, and algorithmic definitions of the notions of potential and actual infinities are presented. It is shown that the actualization of infinite sets and sequences used in Cantor’s proof is a necessary, but hidden, condition of the proof. The explication of the necessary condition and its factual usage within the (...) framework of Cantor’s proof makes, Cantor’s proof invalid. It’s shown that traditional Cantor’s proof has a second necessary, but hidden as well, condition which is teleological by its nature, i.e., is not mathematical. The explication of the second necessary condition makes Cantor’s statement on the uncountability of continuum unprovable from the point of view of classical logic.One of the most dramatic facts in history of science is connected just with the notion of actual infinity and consists in the following. On the one hand, Aristotle, Berkeley, Locke, Descartes, Spinoza, Gauss, Kant, Cauchy, Kronecker, Hermite, Poincaré, Bair, Borel, Brouwer, Quine, Wittgenstein, Weyl, Luzin, and a lot of other outstanding creators of classical logic and classical mathematics, during millenniums, stated categorically and insistently warned about that the actual infinity is a self-contradictory notion and its usage in mathematics is inadmissible (e.g., according to Poincare, “There is no actual infinity. - Cantorians forgot that and fell into contradictions. Later generations will regard Mengenlehre (set theory) as a disease from which one has recovered”). On the other hand, a lot of outstanding scientists of the XX c.c., such as Hilbert, Church, Turing, Gödel, etc., and modern axiomatic set theory as a whole ignored this (intuitive though) opinion of genii and accepted Cantor’s “transfinite paradise”, based on the actual infinity. In the paper some logical, philosophical, and psychological aspects of this historical “favorable opposition” are analyzed, and the fact that the scientific intuition of genii has won the historical battle against the mytho-’logic’ of Cantor’s transfinite ‘paradise’ is explained and logically justified. (shrink)

In this article, as implied by the title, I intend to argue for the unattainability of Cantor’s Absolute at least in terms of the proof-theoretical means of set-theory and of the theory of large cardinals. For this reason a significant part of the article is a critical review of the progress of set-theory and of mathematical foundations toward resolving problems which to the one or the other degree are associated with the concept of infinity especially the one beyond that (...) of the natural intuition of natural numbers. Naturally the review includes the foundation and development of the theory of large cardinals, especially after Cohen’s revolutionary introduction of the forcing method, insofar as it paved the way toward a transcendence of the delimitative character of Gödel’s constructible universe L and further toward ever stronger infinity assumptions. Given that Cantor in his theory of transfinite numbers defined the mathematical absolute in ontological rather than concrete mathematical terms, I proceed in the last section to a philosophical discussion with certain prompts from phenomenology regarding the transposability of the formal conception of the infinite to the level of subjective constitution and argue in these terms on the infeasibility of acceding to an ‘absolute’ infinite cardinality. Of course the argumentation is strongly based on a view of the set-theoretical universe V of von Neumann’s cumulative hierarchy as a formal representative of the essential traits one would seek from a model of Cantor’s Absolute. It is also based on the conclusions reached from the whole discussion within the context of formal-theoretical structures as such. (shrink)

I argue that Composition as Identity blocks the plural version of Cantor's Theorem, and that therefore the plural version of Cantor's Theorem can no longer be uncritically appealed to. As an example, I show how this result blocks a recent argument by Hawthorne and Uzquiano.

This book is about one of the most baffling of all paradoxes – the famous Liar paradox. Suppose we say: 'We are lying now'. Then if we are lying, we are telling the truth; and if we are telling the truth we are lying. This paradox is more than an intriguing puzzle, since it involves the concept of truth. Thus any coherent theory of truth must deal with the Liar. Keith Simmons discusses the solutions proposed by medieval philosophers and offers (...) his own solutions and in the process assesses other attempts to solve the paradox. Unlike such attempts, Simmons' 'singularity' solution does not abandon classical semantics and does not appeal to the kind of hierarchical view found in Barwise's and Etchemendy's The Liar. Moreover, Simmons' solution resolves the vexing problem of semantic universality – the problem of whether there are semantic concepts beyond the expressive reach of a natural language such as English. (shrink)

Although recent evidence is somewhat ambiguous, if not confusing, Patrick Grim still seems to believe that his Cantorian argument against omniscienceis sound. According to this argument, it follows by Cantor’s power set theorem that there can be no set of all truths. Hence, assuming that omniscience presupposes precisely such a set, there can be no omniscient being. Reconsidering this argument, however, guided in particular by Alvin Plantinga’s critique thereof, I find it far from convincing. Not only (...) does it have an enormously untoward side effect, but it is self-referentially incoherent as well. (shrink)

A mahāvidyā inference is used for establishing another inference. Its Reason is normally an omnipresent property. Its Target is defined in terms of a general feature that is satisfied by different properties in different cases. It assumes that there is no case that has the absence of its Target. The main defect of a mahāvidyā inference μ is a counterbalancing inference that can be formed by a little modification of μ. The discovery of its counterbalancing inference can invalidate such an (...) inference. This paper will argue that Cantor’s diagonal argument too shares some features of the mahāvidyā inference. A diagonal argument has a counterbalanced statement. Its main defect is its counterbalancing inference. Apart from presenting an epistemological perspective that explains the disquiet over Cantor’s proof, this paper would show that both the mahāvidyā and diagonal argument formally contain their own invalidators. (shrink)

This invaluable resource is the first one-volume, in-depth, comprehensive history of modern science ever published.

This paper deploys a Cantor-style diagonal argument which indicates that there is more possible mathematical content than there are propositional functions in Russell and Whitehead's Principia Mathematica and similar formal systems. This technical result raises a historical question: "How did Russell, who was himself an expert in diagonal arguments, not see this coming?" It turns out that answering this question requires an appreciation of Russell's understanding of what logic is, and how he construed the relationship between logic (...) and Principia Mathematica. (shrink)