It is well known that the circumflex notation used by Russell and Whitehead to form complex function names in Principia Mathematica played a role in inspiring Alonzo Church's “lambda calculus” for functional logic developed in the 1920s and 1930s. Interestingly, earlier unpublished manuscripts written by Russell between 1903–1905—surely unknown to Church—contain a more extensive anticipation of the essential details of the lambda calculus. Russell also anticipated Schönfinkel's combinatory logic approach of treating multiargument functions as functions having other functions as value. (...) Russell’s work in this regard seems to have been largely inspired by Frege’s theory of functions and “value-ranges”. This system was discarded by Russell due to his abandonment of propositional functions as genuine entities as part of a new tack for solving Russell’s paradox. In this article, I explore the genesis and demise of Russell’s early anticipation of the lambda calculus. (shrink)

The aim of this paper is to clarify the role of category theory in the foundations of mathematics. There is a good deal of confusion surrounding this issue. A standard philosophical strategy in the face of a situation of this kind is to draw various distinctions and in this way show that the confusion rests on divergent conceptions of what the foundations of mathematics ought to be. This is the strategy adopted in the present paper. It is divided into 5 (...) sections. We first show that already in the set theoretical framework, there are different dimensions to the expression foundations of. We then explore these dimensions more thoroughly. After a very short discussion of the links between these dimensions, we move to some of the arguments presented for and against category theory in the foundational landscape. We end up on a more speculative note by examining the relationships between category theory and set theory. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

The view that toposes originated as generalized set theory is a figment of set theoretically educated common sense. This false history obstructs understanding of category theory and especially of categorical foundations for mathematics. Problems in geometry, topology, and related algebra led to categories and toposes. Elementary toposes arose when Lawvere's interest in the foundations of physics and Tierney's in the foundations of topology led both to study Grothendieck's foundations for algebraic geometry. I end with remarks on a categorical view of (...) the history of set theory, including a false history plausible from that point of view that would make it helpful to introduce toposes as a generalization from set theory. (shrink)

A comprehensive survey of Martin-Löf's constructive type theory, considerable parts of which have only been presented by Martin-Löf in lecture form or as part of conference talks. Sommaruga surveys the prehistory of type theory and its highly complex development through eight different stages from 1970 to 1995. He also provides a systematic presentation of the latest version of the theory, as offered by Martin-Löf at Leiden University in Fall 1993. This presentation gives a fuller and updated account of the system. (...) Earlier, brief presentations took no account of the issues related to the type-theoretical approach to logic and the foundations of mathematics, while here they are accorded an entire part of the book. Readership: Comprehensive accounts of the history and philosophy of constructive type theory and a considerable amount of related material. Readers need a solid background in standard logic and a first, basic acquaintance with type theory. (shrink)

This paper shows how the universals of category theory in mathematics provide a model (in the Platonic Heaven of mathematics) for the self-predicative strand of Plato's Theory of Forms as well as for the idea of a "concrete universal" in Hegel and similar ideas of paradigmatic exemplars in ordinary thought. The paper also shows how the always-self-predicative universals of category theory provide the "opposite bookend" to the never-self-predicative universals of iterative set theory and thus that the paradoxes arose from having (...) one theory (e.g., Frege's Paradise) where universals could be either self-predicative or non-self-predicative (instead of being always one or always the other). (shrink)

Today it would be considered "bad Platonic metaphysics" to think that among all the concrete instances of a property there could be a universal instance so that all instances had the property by virtue of participating in that concrete universal. Yet there is a mathematical theory, category theory, dating from the mid-20th century that shows how to precisely model concrete universals within the "Platonic Heaven" of mathematics. This paper, written for the philosophical logician, develops this category-theoretic treatment of concrete universals (...) along with a new concept to abstractly model the functions of a brain. (shrink)

In this article, I examine the ramified-type theory set out in the first edition of Russell and Whitehead's Principia Mathematica. My starting point is the ‘no loss of generality’ problem: Russell, in the Introduction (Russell, B. and Whitehead, A. N. 1910. Principia Mathematica, Volume I, 1st ed., Cambridge: Cambridge University Press, pp. 53–54), says that one can account for all propositional functions using predicative variables only, that is, dismissing non-predicative variables. That claim is not self-evident at all, hence a problem. (...) The purpose of this article is to clarify Russell's claim and to solve the ‘no loss of generality’ problem. I first remark that the hierarchy of propositional functions calls for a fine-grained conception of ramified types as propositional forms (‘ramif-types’). Then, comparing different important interpretations of Principia’s theory of types, I consider the question as to whether Principia allows for non-predicative propositional functions and variables thereof. I explain how the distinction between the formal system of the theory, on the one hand, and its realizations in different epistemic universes, on the other hand, makes it possible to give us a more satisfactory answer to that question than those given by previous commentators, and, as a consequence, to solve the ‘no loss of generality’ problem. The solution consists in a substitutional semantics for non-predicative variables and non-predicative complex terms, based on an epistemic understanding of the order component of ramified types. The rest of the article then develops that epistemic understanding, adding an original epistemic model theory to the formal system of types. This shows that the universality sought by Russell for logic does not preclude semantical considerations, contrary to what van Heijenoort and Hintikka have claimed. (shrink)

Bertrand Russell: Logic For Russell, Aristotelian syllogistic inference does not do justice to the subject of logic. This is surely not surprising. It may well be something of a surprise, however, to learn that in Russell’s view neither Boolean algebra nor modern quantification theory do justice to the subject. For Russell, logic is a synthetic … Continue reading Russell: Logic →.

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)

For some time now, academic philosophers of mathematics have concentrated on intramural debates, the most conspicuous of which has centered on Benacerraf's epistemological challenge. By the late 1980s, something of a consensus had developed on how best to respond to this challenge. But answering Benacerraf leaves untouched the more advanced epistemological question of how the axioms are justified, a question that bears on actual practice in the foundations of set theory. I suggest that the time is ripe for philosophers of (...) mathematics to turn outward, to take on a problem of real importance for mathematics itself. (shrink)

Dramatic changes or revolutions in a field of science are often made by outsiders or 'trespassers,' who are not limited by the established, 'expert' approaches. Each essay in this diverse collection shows the fruits of intellectual trespassing and poaching among fields such as economics, Kantian ethics, Platonic philosophy, category theory, double-entry accounting, arbitrage, algebraic logic, series-parallel duality, and financial arithmetic.

There are several open problems in the study of the calculi which result from adding either of Hilbert's ϵ- or τ-operators to the first order intuitionistic predicate calculus. This paper provides answers to several of them. In particular, the first complete and sound semantics for these calculi are presented, in both a “quasi-extensional” version which uses choice functions in a straightforward way to interpret the ϵ- or τ-terms, and in a form which does not require extensionality assumptions. Unlike the classical (...) case, the addition of either operator to intuitionistic logic is non-conservative. Several interesting consequences of the addition of each operator are proved. Finally, the independence of several other schemes in either calculus are also proved, making use of the semantics supplied earlier in the paper. (shrink)

Principia Mathematic goes to great lengths to hide its order/type indices and to make it appear as if its incomplete symbols behave as if they are singular terms. But well-hidden as they are, we cannot understand the proofs in Principia unless we bring them into focus. When we do, some rather surprising results emerge ? which is the subject of this paper.

Some of the forerunners of quantum theory regarded the basic entities of such theories as 'non-individuals'. One of the problems is to treat collections of such 'things', for they do not obey the axioms of standard set theories like Zermelo- Fraenkel. In this paper, collections of objects to which the standard concept of identity does not apply are termed 'quasi-sets'. The motivation for such a theory, linked to what we call 'the Manin problem', is presented, so as its specific axioms. (...) At the end, it is shown how quantum statistics can be obtained within quasi-set thbeory. (shrink)

The axiom of reducibility plays an important role in the logic of Principia Mathematica, but has generally been condemned as an ad hoc non-logical axiom which was added simply because the ramified type theory without it would not yield all the required theorems. In this paper I examine the status of the axiom of reducibility. Whether the axiom can plausibly be included as a logical axiom will depend in no small part on the understanding of propositional functions. If we understand (...) propositional functions as constructions of the mind, it is clear that the axiom is clearly not a logical axiom and in fact makes an implausible claim. I look at two other ways of understanding propositional functions, a nominalist interpretation along the lines of Landini and a realist interpretation along the lines of Linsky and Mares. I argue that while on either of these interpretations it is not easy to see the axiom as a non-logical claim about the world, there are also appear to be difficulties in accepting it as a purely logical axiom. (shrink)

Bernard Linsky, The Evolution of Principia Mathematica; Bertrand Russell's Manuscripts and Notes for the Second Edition. Cambridge: Cambridge University Press. 2011. 407 pp. + two plates. $150.00/£...

I formulate the Zermelo-Russell paradox for naive set theory. A sketch is given of Zermelo’s solution to the paradox: the cumulative type structure. A careful analysis of the set formation process shows a missing component in this solution: the necessity of an assumed imaginary jump out of an infinite universe. Thus a set is formed by a suitable combination of concrete and imaginary operations all of which can be made or assumed by a Turing machine. Some consequences are drawn from (...) this improved analysis of the concept of set, for the theory of sets and for the philosophy and foundations of mathematics. (shrink)

Resumo: No presente artigo, discutiremos os aspectos filosóficos de teorias de conjuntos paraconsistentes. A fim de ilustrar nossas considerações de modo mais concreto, abordaremos uma nova teoria de conjuntos baseada em um sistema bem conhecido de Quine e em um cálculo paraconsistente.Palavras-chave: existência, contradição, lógica e paraconsistência.: In the present paper we deal with the philosophical aspects of paraconsistent set theories. In order to illustrate our points more concretely, we will discuss new paraconsistent set theory based both on Quine's well-known (...) system and on a paraconsistent calculus.Keywords: existence, contradiction, logic and paraconsistency. (shrink)