Stewart Shapiro

The purpose of this article is to assess the prospects for a Scottish neo-logicist foundation for a set theory. We show how to reformulate a key aspect of our set theory as a neo-logicist abstraction principle. That puts the enterprise on the neo-logicist map, and allows us to assess its prospects, both as a mathematical theory in its own right and in terms of the foundational role that has been advertised for set theory. On the positive side, we show that our abstraction based theory can be modified to yield much of ordinary mathematics, indeed everything needed to recapture all branches of mathematics short of set theory itself. However, our conclusions are mostly negative. The theory will fall far short of the power of ordinary Zermelo-Fraenkel set theory. It is consistent that our set theory has models that are relatively small, smaller than the first cardinal with an uncountable index. More important, there is a strong tension between the idea that the iterative hierarchy is somehow ineffable, or indefinitely extensible, and the neo-logicist theme of capturing mathematical theories with abstraction principles.

Perhaps the most pressing challenge for singularism—the predominant view that definite plurals like ‘the students’ singularly refer to a collective entity, such as a mereological sum or set—is that it threatens paradox. Indeed, this serves as a primary motivation for pluralism—the opposing view that definite plurals refer to multiple individuals simultaneously through the primitive relation of plural reference. Groups represent one domain in which this threat is immediate. After all, groups resemble sets in having a kind of membership-relation and iterating: we can have groups of groups, groups of groups of groups, etc. Yet there cannot be a group of all non-self-membered groups. In response, we develop a potentialist theory of groups according to which we always can, but do not have to, form a group from any sum. Modalizing group-formation makes it a species of potential, as opposed to actual or completed, infinity. This allows for a consistent, plausible, and empirically adequate treatment of natural language plurals, one which is motivated by the iterative nature of syntactic and semantic processes more generally.

This paper focuses on two notions of effectiveness which are not treated in detail elsewhere. Unlike the standard computability notion, which is a property of functions themselves, both notions of effectiveness are properties of interpreted linguistic presentations of functions. It is shown that effectiveness is epistemically at least as basic as computability in the sense that decisions about computability normally involve judgments concerning effectiveness. There are many occurrences of the present notions in the writings of logicians; moreover, consideration of these notions can contribute to the clarification and, perhaps, solution of various philosophical problems, confusions and disputes

Saul Kripke once noted that there is a tight connection between computation and de re knowledge of whatever the computation acts upon. For example, the Euclidean algorithm can produce knowledge of _which number_ is the greatest common divisor of two numbers. Arguably, algorithms operate directly on syntactic items, such as strings, and on numbers and the like only via how the numbers are represented. So we broach matters of _notation_. The purpose of this article is to explore the relationship between the notations acceptable for computation, the usual idealizations involved in theories of computability, flowing from Alan Turing’s monumental work, and de re propositional attitudes toward numbers and other mathematical objects.

Graham Priest introduces an informal but presumably rigorous and sharp ‘provability predicate’. He argues that this predicate yields inconsistencies, along the lines of the paradox of the Knower. One long-standing claim of Priest’s is that a dialetheist can have a complete, decidable, and yet sufficiently rich mathematical theory. After all, the incompleteness theorem is, in effect, that for any recursive theory A, if A is consistent, then A is incomplete. If the antecedent fails, as it might for a dialetheist, then the consequent may also fail to hold. One somewhat friendly purpose of my ‘Incompleteness and inconsistency’ was to improve the technical situation for the dialetheist, eschewing reliance on an informal provability predicate. Another, less friendly purpose was to bring out what I took to be some untoward consequences of the situation. It seems that Priest accepted at least some of the improvements that I attempted. In the second edition of In contradiction, he responded to the alleged untoward consequences. One purpose of this note is to revisit the technical and philosophical situation. There were some errors in my original presentation, brought out by discussion with Priest and by Hartry Field’s analysis of the second incompleteness theorem in such contexts. A second task here is to present a sort of Curry version of the Gödel incompleteness situation. I tentatively conclude that even for a dialetheist, an interesting and complete theory is not as easy to come by as it may look—at least not for theories of arithmetic that are plausible for a dialetheist.

The primary argument against mereological singularism—the view that definite plural noun phrases like ‘the students’ refer to “set-like entities”—is that it is ultimately incoherent. The most forceful form of this charge is due to Barry Schein, who argues that singularists must accept a certain comprehension principle which entails the existence of things having the contradictory property of being both atomic and non-atomic. The purpose of this paper is to defuse Schein’s argument, by noting three necessary and independently motivated restrictions on the metalinguistic predicates ‘atom’ and ‘non-atom’: both are sort, property, and context-relative. With these restrictions in place, Schein’s problematic assumption becomes evident: his presumed singularist analysis of ‘non-atom’ conflates the metalanguage with the meta-metalanguage, i.e. the language used to talk about the metalanguage.