This paper begins an axiomatic development of naive set theoryin a paraconsistent logic. Results divide into two sorts. There is classical recapture, where the main theorems of ordinal and Peano arithmetic are proved, showing that naive set theory can provide a foundation for standard mathematics. Then there are major extensions, including proofs of the famous paradoxes and the axiom of choice (in the form of the well-ordering principle). At the end I indicate how later developments of cardinal numbers will (...) lead to Cantor’s theorem, the existence of large cardinals, and a counterexample to the continuum hypothesis. (shrink)

In his highly perceptive, if underappreciated introduction to Wittgenstein’s Tractatus, Russell identifies a “lacuna” within Wittgenstein’s theory of number, relating specifically to the topic of transfinite number. The goal of this paper is two-fold. The first is to show that Russell’s concerns cannot be dismissed on the grounds that they are external to the Tractarian project, deriving, perhaps, from logicist ambitions harbored by Russell but not shared by Wittgenstein. The extensibility of Wittgenstein’s theory of number to the case of (...) transfinite cardinalities is, I shall argue, a desideratum generated by concerns intrinsic, and internal to Wittgenstein’s logical and semantic framework. Second, I aim to show that Wittgenstein’s theory of number as espoused in the Tractatus is consistent with Russell’s assessment, in that Wittgenstein meant to leave open the possibility that transfinite numbers could be generated within his system, but did not show explicitly how to construct them. To that end, I show how one could construct a transfinite number line using ingredients inherent in Wittgenstein’s system, and in accordance with his more general theories of number and of operations. (shrink)

William Lane Craig has argued that there cannot be actual infinities because inverse operations are not well-defined for infinities. I point out that, in fact, there are mathematical systems in which inverse operations for infinities are well-defined. In particular, the theory introduced in John Conway's *On Numbers and Games* yields a well-defined field that includes all of Cantor's transfinite numbers.

Ortega y Gasset is known for his philosophy of life and his effort to propose an alternative to both realism and idealism. The goal of this article is to focus on an unfamiliar aspect of his thought. The focus will be given to Ortega’s interpretation of the advancements in modern mathematics in general and Cantor’s theory of transfinite numbers in particular. The main argument is that Ortega acknowledged the historical importance of the Cantor’s Set Theory, analyzed it and (...) articulated a response to it. In his writings he referred many times to the advancements in modern mathematics and argued that mathematics should be based on the intuition of counting. In response to Cantor’s mathematics Ortega presented what he defined as an ‘absolute positivism’. In this theory he did not mean to naturalize cognition or to follow the guidelines of the Comte’s positivism, on the contrary. His aim was to present an alternative to Cantor’s mathematics by claiming that mathematicians are allowed to deal only with objects that are immediately present and observable to intuition. Ortega argued that the infinite set cannot be present to the intuition and therefore there is no use to differentiate between cardinals of different infinite sets. (shrink)

This paper is about the differences between probabilities and beliefs and why reasoning should not always conform to probability laws. Probability is defined in terms of urn models from which probability laws can be derived. This means that probabilities are expressed in rational numbers, they suppose the existence of veridical representations and, when viewed as parts of a probability model, they are determined by a restricted set of variables. Moreover, probabilities are subjective, in that they apply to classes of (...) events that have been deemed (by someone) to be equivalent, rather than to unique events. Beliefs on the other hand are multifaceted, interconnected with all other beliefs, and inexpressible in their entirety. It will be argued that there are not sufficient rational numbers to characterise beliefs by probabilities and that the idea of a veridical set of beliefs is questionable. The concept of a complete probability model based on Fisher's notion of identifiable subsets is outlined. It is argued that to be complete a model must be known to be true. This can never be the case because whatever a person supposes to be true must be potentially modifiable in the light of new information. Thus to infer that an individual's probability estimate is biased it is necessary not only to show that the estimate differs from that given by a probability model, but also to assume that this model is complete, and completeness is not empirically verifiable. It follows that probability models and Bayes theorem are not necessarily appropriate standards for people's probability judgements. The quality of a probability model depends on how reasonable it is to treat some existing uncertainty as if it were equivalent to that in a particular urn model and this cannot be determined empirically. Bias can be demonstrated in estimates of proportions of finite populations such as in the false consensus effect. However the modification of beliefs by ad hoc methods like Tversky and Kahneman's heuristics can be justified, even though this results in biased judgements. This is because of pragmatic factors such as the cost of obtaining and taking account of additional information which are not included even in a complete probability model. Finally, an analogy is drawn between probability models and geometric figures. Both idealisations are useful but qualitatively inadequate characterisations of nature. A difference between the two is that the size of any error can be limited in the case of the geometric figure in a way that is not possible in a probability model. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

We study a transfinite iteration of the ordinal Hessenberg natural sum obtained by taking suprema at limit stages. We show that such an iterated natural sum differs from the more usual transfinite ordinal sum only for a finite number of iteration steps. The iterated natural sum of a sequence of ordinals can be obtained as a mixed sum (in an order‐theoretical sense) of the ordinals in the sequence; in fact, it is the largest mixed sum which satisfies a (...) finiteness condition. We introduce other infinite natural sums which are invariant under permutations and show that all the sums under consideration coincide in the countable case. (shrink)

There are two main objections against epistemological foundation of logical principles: 1. Every argument for them must necessarily make use of them. 2. Logical principles cannot be abstracted from experience because they imply elements of meaning that exceed in principle our finite experience (like universality & necessity). In opposition to these objections I argue for Husserl's thesis that logic needs a theory of experience as a foundation. To show the practicability of his attempt I argue that he is able to (...) avoid the two circles mentioned. Motivated by this investigation the Appendix presents some mathematical doubts concerning the proofs by Cantor of the transfiniteness of the set of real numbers. (shrink)

This paper develops transfinite extensions of transitivity and acyclicity in the context of population ethics. They are used to argue that it is better to add good lives, worse to add bad lives, and equally good to add neutral lives, where a life's value is understood as personal value. These conclusions rule out a number of theories of population ethics, feed into an argument for the repugnant conclusion, and allow us to reduce different-number comparisons to same-number ones. Challenges to (...) these arguments are addressed, including the issue of comparing existence and non-existence in terms of personal value, the possibility of minimal quanta of time and life, and the meaningfulness of measuring closeness between outcomes with different population sizes. An asymmetry is uncovered between transfinite cycles of worseness and betterness, supporting a version of the weak procreative asymmetry. Transfinite transitivity principles are also favourably compared to the better-known principles of continuity. (shrink)

We define the paraconsistent supra-logic Pσ by a type-shift from the booleans o of propositional logic Po to the supra-booleans σ of the propositional type logic P obtained as the propositional fragment of the transfinite type theory Q defined by Peter Andrews (North-Holland Studies in Logic 1965) as a classical foundation of mathematics. The supra-logic is in a sense a propositional logic only, but since there is an infinite number of supra-booleans and arithmetical operations are available for this and (...) other types, virtually anything can be specified. The supra-logic is a generalization of Lukasiewicz's three-valued logic, with the intermediate value duplicated many times and ordered such that none of the copies of this value imply other ones, but it differs from Lukasiewicz's many-valued logics as well as from logics based on bilattices. There are several automated theorem provers for classical higher order logic (finite type theory) and it should be possible to modify these to our needs. (shrink)

Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical notion (...) of elimination which characterises this move. (shrink)

For any ordinal $\Lambda$, we can define a polymodal logic $\mathsf{GLP}_\Lambda$, with a modality $[\xi]$ for each $\xi < \Lambda$. These represent provability predicates of increasing strength. Although $\mathsf{GLP}_\Lambda$ has no Kripke models, Ignatiev showed that indeed one can construct a Kripke model of the variable-free fragment with natural number modalities, denoted $\mathsf{GLP}^0_\omega$. Later, Icard defined a topological model for $\mathsf{GLP}^0_\omega$ which is very closely related to Ignatiev's. In this paper we show how to extend these constructions for arbitrary $\Lambda$. (...) More generally, for each $\Theta,\Lambda$ we build a Kripke model $\mathfrak I^\Theta_\Lambda$ and a topological model $\mathfrak T^\Theta_\Lambda$, and show that $\mathsf{GLP}^0_\Lambda$ is sound for both of these structures, as well as complete, provided $\Theta$ is large enough. (shrink)

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...) economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (shrink)

The author here constructs a system of simple type theory in which the type hierarchy does not extend merely to any finite height, but to an infinite height; this added part allows him to prove the existence of infinite sets within the theory, instead of taking it as an axiom in the usual simple type theory. The system has been presented in such sufficient generality so as to make it able to accommodate current scientific theories; the author has turned in (...) the direction of using type theory rather than set theory as the underlying logic of scientific theories. The system is formalized in Church's lambda-calculus notation; the semantics of the system are treated in great detail and appear to be the most complete study so far in print. The system is shown to contain at each type a "basic logic" somewhat similar to first-order logic; the author also shows that Peano's axioms for arithmetic appear as theorems when cast in suitable form. This book is one of a number of recent studies of type theory; together they represent a revival of interest in the subject, both as a foundation for mathematics and as an object of interest in itself. The book stems from Andrews' Princeton doctoral thesis.—P. J. M. (shrink)

This paper consists of two parts and has two aims. The first is to elaborate on the historical-philosophical background of Cantor’s notions of infinity in the context of Spinoza’s influence on him. To achieve this aim, in the first part I compare Spinoza’s and Cantor’s conceptions of actual infinity along with their mathematical implications. Explaining the metaphysical, conceptual, and methodological aspects of Cantor’s expansion of the orthodox finitist conception of number of his time, I discuss how he adopts Spinoza’s motifs (...) to overcome the challenges on his way to proposing his transfinite infinites. To achieve the second aim, i.e., to investigate the philosophical foundations of Cantor’s transfinite infinites, I follow a three-step outline analyzing Cantor’s three principles along with their metaphysical and epistemological-linguistic aspects. I analyze the strengths and weak sides of Lakoff and Núñez’s Basic Metaphor of Infinity and Pantsar’s Process → Object Metaphor, then compare their interpretations with mine. I conclude that the metaphors can be improved when their source domains are limited to the target domains they apply to and when supported by a thorough analysis of the historical-philosophical background of their target domains. (shrink)

I follow standard mathematical practice and theory to argue that the natural numbers are the finite von Neumann ordinals. I present the reasons standardly given for identifying the natural numbers with the finite von Neumann's (e.g., recursiveness; well-ordering principles; continuity at transfinite limits; minimality; and identification of n with the set of all numbers less than n). I give a detailed mathematical demonstration that 0 is { } and for every natural number n, n is the (...) set of all natural numbers less than n. Natural numbers are sets. They are the finite von Neumann ordinals. (shrink)

Georg Cantor argued that pure mathematics would be better-designated “free mathematics” since mathematical inquiry need not justify its discoveries through some extra-mental standard. Even so, he spent much of his later life addressing ancient and scholastic objections to his own transfinite number theory. Some philosophers have argued that Cantor need not have bothered. Thomas Aquinas at least, and perhaps Aristotle, would have consistently embraced developments in number theory, including the transfinite numbers. The author of this paper asks (...) whether the restriction of arithmetic to the natural numbers that is apparently assumed by Aristotle and Aquinas is necessary in the light of their stated principles. The author concludes that, while some texts from Aristotle and Thomas suggest that such discoveries as zero, rational, and real numbers, and even Cantor’s own transfinite numbers, are legitimate objects of scientific knowledge, a careful analysis shows that they are incompatible with the ultimate arithmetical principle, the unit. (shrink)

Numbers. Natural numbers -- Integers -- Real numbers -- Irrational and transcendental numbers -- Funny numbers. Zero -- e : the unnatural natural number -- [Phi] : the golden ratio -- i : the imaginary number -- Writing numbers. Roman numerals -- Egyptian fractions -- Continued fractions -- Logic. Mr. Spock is not logical -- Proofs, truth, and trees : oh my! -- Programming with logic -- Temporal reasoning -- Sets. Cantor's diagonalization : infinity (...) isn't just infinity -- Axiomatic set theory : keep the good, dump the bad -- Models : using sets as the LEGOs of the math world -- Transfinite numbers : counting and ordering infinite sets -- Group theory : finding symmetries with sets -- Mechanical math. Finite state machines : simplicity goes far -- The turing machine -- Pathology and the heart of computing -- Calculus : no, not that calculus- [lambda] calculus -- Numbers, booleans, and recursion -- Types, types, types : modeling [lambda] calculus -- The halting problem. (shrink)

There are nine kinds of number: cardinal (measure of class size), ordinal (corresponds to position), generalized ordinal (position in multidimensional discrete manifold), signed (relation between cardinals), rational (different kind of relation between cardinals), real (limit), complex (pair of reals), transfinite (size of reflexive class), and dimension (measure of complexity.

Cantor’s theory of cardinal numbers offers a way to generalize arithmetic from finite sets to infinite sets using the notion of one-to-one association between two sets. As is well known, all countable infinite sets have the same ‘size’ in this account, namely that of the cardinality of the natural numbers. However, throughout the history of reflections on infinity another powerful intuition has played a major role: if a collectionAis properly included in a collectionBthen the ‘size’ ofAshould be less (...) than the ‘size’ ofB(part–whole principle). This second intuition was not developed mathematically in a satisfactory way until quite recently. In this article I begin by reviewing the contributions of some thinkers who argued in favor of the assignment of different sizes to infinite collections of natural numbers (Thabit ibn Qurra, Grosseteste, Maignan, Bolzano). Then, I review some recent mathematical developments that generalize the part–whole principle to infinite sets in a coherent fashion (Katz, Benci, Di Nasso, Forti). Finally, I show how these new developments are important for a proper evaluation of a number of positions in philosophy of mathematics which argue either for the inevitability of the Cantorian notion of infinite number (Gödel) or for the rational nature of the Cantorian generalization as opposed to that, based on the part–whole principle, envisaged by Bolzano (Kitcher). (shrink)

This is a text for a one or two semester course on axiomatic set theory; the goal is to introduce and develop one system of set theory in a complete and thorough way, presupposing only the elusive "mathematical maturity" of the reader. There are nine chapters which begin with a development of propositional and predicate logic oriented toward set theory and develop the Zermelo-Fraenkel system in exceptional detail. The book starts slowly, the first 120 pages being devoted to logical preliminaries (...) and the introduction of axioms; it gathers speed, however, and the remaining chapters include treatment of the algebra of classes, relations and functions, order of various sorts and Zorn's lemma, real numbers and equivalence classes, the equipollence of sets, similarity as a relation of sets, the ordinal numbers and their arithmetic, the cardinal numbers and their arithmetic. These later chapters are extremely detailed and comprehensive, presenting a wealth of material. There are numerous exercises, many quite difficult, at the end of each chapter, along with a summary of that chapter's content. Because of the single-mindedness of the book, there is little reference to other systems of set theory, but this is not a drawback at all. The presentation is orthodox, but not dull; careful, but not generally pedantic or repetitive. This makes it a good text for self-study.—P. J. M. (shrink)

There are two well‐known ways of doing arithmetic with ordinal numbers: the “ordinary” addition, multiplication, and exponentiation, which are defined by transfinite iteration; and the “natural” (or “Hessenberg”) addition and multiplication (denoted ⊕ and ⊗), each satisfying its own set of algebraic laws. In 1909, Jacobsthal considered a third, intermediate way of multiplying ordinals (denoted × ), defined by transfinite iteration of natural addition, as well as the notion of exponentiation defined by transfinite iteration of his (...) multiplication, which we denote. (Jacobsthal's multiplication was later rediscovered by Conway.) Jacobsthal showed these operations too obeyed algebraic laws. In this paper, we pick up where Jacobsthal left off by considering the notion of exponentiation obtained by transfinitely iterating natural multiplication instead; we shall denote this. We show that and that ; note the use of Jacobsthal's multiplication in the latter. We also demonstrate the impossibility of defining a “natural exponentiation” satisfying reasonable algebraic laws. (shrink)

Most of this work is devoted to presenting aspects of proof theory that have developed out of Gentzen's work. Thus the them is "cut elimination" and transfinite induction over constructive ordinals. Smullyan's tableau systems will be used for the formalisms and some of the basic logical results as presented in Smullyan [1] will be assumed to be known (essentially only the classical completeness and consistency proofs for propositional and first order logic).

I consider the natural infinitary variations of the games Wordle and Mastermind, as well as their game‐theoretic variations Absurdle and Madstermind, considering these games with infinitely long words and infinite color sequences and allowing transfinite game play. For each game, a secret codeword is hidden, which the codebreaker attempts to discover by making a series of guesses and receiving feedback as to their accuracy. In Wordle with words of any size from a finite alphabet of n letters, including infinite (...) words or even uncountable words, the codebreaker can nevertheless always win in n steps. Meanwhile, the mastermind number, defined as the smallest winning set of guesses in infinite Mastermind for sequences of length ω over a countable set of colors without duplication, is uncountable, but the exact value turns out to be independent of, for it is provably equal to the eventually different number, which is the same as the covering number of the meager ideal. I thus place all the various mastermind numbers, defined for the natural variations of the game, into the hierarchy of cardinal characteristics of the continuum. (shrink)

The nature of of Infinite Number is discussed in a rigorous but easy-to-follow manner. Special attention is paid to Cantor's proof that any given set has more subsets than members, and it is discussed how this fact bears on the question: How many infinite numbers are there? This work is ideal for people with little or no background in set theory who would like an introduction to the mathematics of the infinite.

As the crusade to outlaw the teaching of evolution changed to a battle for equal time for creationism, the ideological defenses of that doctrine also shifted from primarily biblical to more scientific grounds. This essay describes the historical development of “scientific creationism” from a variety of late–nineteenth– and early–twentieth–century creationist reactions to Charles Darwin's theory of evolution, through the Scopes trial and the 1960s revival of creationism, to the current spread of strict creationism around the world.