The actually-operator, understood as a rigidifier, has been employed for a range of purposes in natural language semantics. In this article I argue that the properties of the operator do not correspond to any feature of natural language or feature natural language users have access to. Nor is it needed to provide a formal representation of natural language sentences—the examples usually provided to illustrate the indispensability of the operator are much more plausibly interpreted using plural quantifiers. This lack of connection (...) to natural language is a serious worry for accounts that appeal to rigidifying operations to explain natural language phenomena, as well as a challenge to theories that appeal to the operator to capture the difference between different kinds of necessity expressed in natural language. (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)

In the substitutional framework, validity is truth under all substitutions of the nonlogical vocabulary. I develop a theory where □ is interpreted as substitutional validity. I show how to prove soundness and completeness for common modal calculi using this definition.

Plural Logic is an extension of First-Order Logic which has, as well as singular terms and quantifiers, their plural counterparts. Analogously, Higher-Level Plural Logic is an extension of Plural Logic which has, as well as plural terms and quantifiers, higher-level plural ones. Roughly speaking, higher-level plurals stand to plurals like plurals stand to singulars; they are pluralised plurals. Allegedly, Higher-Level Plural Logic enjoys the expressive power of a simple type theory while committing us to nothing more than the austere ontology (...) of First-Order Logic. Were this true, Higher-Level Plural Logic would be a useful tool, with various applications in philosophy and linguistics. However, while the notions of plural reference and quantification enjoy widespread acceptance today, their higher-level counterparts have been received with a lot of scepticism. In this paper, I argue for the legitimacy of Higher-Level Plural Logic by providing evidence to the effect that natural languages contain higher-level plural expressions and showing that it is likely that they do so in an indispensable manner. Since the arguments I put forward are of the same sort advocates of Plural Logic have employed to defend their position, I conclude that the commonly held view that Plural Logic is legitimate, but not so its higher-level plural extensions is untenable. (shrink)

The isomorphism invariance criterion of logical nature has much to commend it. It can be philosophically motivated by the thought that logic is distinctively general or topic neutral. It is capable of precise set-theoretic formulation. And it delivers an extension of ‘logical constant’ which respects the intuitively clear cases. Despite its attractions, the criterion has recently come under attack. Critics such as Feferman, MacFarlane and Bonnay argue that the criterion overgenerates by incorrectly judging mathematical notions as logical. We consider five (...) possible precisifications of the overgeneration argument and find them all unconvincing. (shrink)

I discuss Aristotle’s opening argument against Platonic Forms in _Metaphysics_ A.9, ‘the Razor’, which criticizes the introduction of Forms on the basis of an analogy with a hypothetical case of counting things. I argue for a new interpretation of this argument, and show that it involves two interesting objections against the introduction of Forms as formal causes: one concerns the completeness and the other the adequacy of such an explanatory project.

Recent technical developments in the logic of nominalism make it possible to improve and extend significantly the approach to mathematics developed in Mathematics without Numbers. After reviewing the intuitive ideas behind structuralism in general, the modal-structuralist approach as potentially class-free is contrasted broadly with other leading approaches. The machinery of nominalistic ordered pairing (Burgess-Hazen-Lewis) and plural quantification (Boolos) can then be utilized to extend the core systems of modal-structural arithmetic and analysis respectively to full, classical, polyadic third- and fourthorder number (...) theory. The mathenatics of many structures of central importance in functional analysis, measure theory, and topology can be recovered within essentially these frameworks. (shrink)

The Geach‐Kaplan sentence is alleged to be an example of a non‐first‐orderizable sentence, and the proof of the alleged non‐first‐orderizability is credited to David Kaplan. However, there is also a widely shared intuition that the Geach‐Kaplan sentence is still first‐orderizable by invoking sets or other extra non‐logical resources. The plausibility of this intuition is particularly crucial for first‐orderism, namely, the thesis that all our scientific discourse and reasoning can be adequately formalized by first‐order logic. I first argue that the Geach‐Kaplan (...) sentence is, in fact, not first‐orderizable even by invoking extra non‐logical resources, in any sense that is acceptable for first‐orderism and adequately corresponds to the sense in which the Geach‐Kaplan sentence is deemed to be non‐first‐orderizable simpliciter via Kaplan's proof. To address this problem on behalf of first‐orderism, I then propose an alternative conception of first‐orderizability in the sense of which the Geach‐Kaplan sentence and any other second‐order sentences become first‐orderizable by invoking extra non‐logical resources; furthermore, in certain circumstances, they are first‐orderizable without incurring any extra ontological commitment. My analysis also turns out to yield (as a biproduct) a significant enhancement of the so‐called paradox of plurality. (shrink)

The logic of singular terms that refer to nothing, such as ‘Santa Claus,’ has been studied extensively under the heading of free logic. The present essay examines expressions whose reference is defective in a different way: they signify more than one entity. The bulk of the effort aims to develop an acceptable formal semantics based upon an intuitive idea introduced informally by Hartry Field and discussed by Joseph Camp; the basic strategy is to use supervaluations. This idea, as it stands, (...) encounters difficulties, but with suitable refinements it can be salvaged. Two other options for a formal semantics of multiply signifying terms are also presented, and I discuss the relative merits of the three semantics briefly. Finally, possible modifications to the standard logical regimentation of the notion of existence are considered. (shrink)

In the semantic debate about plurals, pluralism is the view that a plural term denotes some things in the domain of quantification and a plural predicate denotes a plural property, i.e. a property that can be instantiated by many things jointly. According to a particular version of this view, untyped pluralism, there is no type distinction between objects and properties. In this article, I argue against untyped pluralism by showing that it is subject to a variant of a Russell-style argument (...) put forth by Timothy Williamson and that it clashes with a plural version of Cantor’s theorem. I conclude that pluralists should postulate a type distinction between objects and properties. (shrink)

Semantic interpretations of both natural and formal languages are usually taken to involve the specification of a domain of entities with respect to which the sentences of the language are to be evaluated. A question that has received much attention of late is whether there is unrestricted quantification, quantification over a domain comprising absolutely everything there is. Is there a discourse or inquiry that has absolute generality? After framing the debate, this article provides an overview of the main arguments for (...) and against the possibility of unrestricted quantification, highlighting some of the broader implications of the debate. (shrink)

Quine maintained that philosophical and scientific theorizing should be conducted in an untyped language, which has just one style of variables and quantifiers. By contrast, typed languages, such as those advocated by Frege and Russell, include multiple styles of variables and matching kinds of quantification. Which form should our theories take? In this article, I argue that expressivity does not favour typed languages over untyped ones.

Plural logic is widely assumed to have two important virtues: ontological innocence and determinacy. It is claimed to be innocent in the sense that it incurs no ontological commitments beyond those already incurred by the first-order quantifiers. It is claimed to be determinate in the sense that it is immune to the threat of non-standard interpretations that confronts higher-order logics on their more traditional, set-based semantics. We challenge both claims. Our challenge is based on a Henkin-style semantics for plural logic (...) that does not resort to sets or set-like objects to interpret plural variables, but adopts the view that a plural variable has many objects as its values. Using this semantics, we also articulate a generalized notion of ontological commitment which enables us to develop some ideas of earlier critics of the alleged ontological innocence of plural logic. (shrink)

A prominent objection against the logicality of second-order logic is the so-called Overgeneration Argument. However, it is far from clear how this argument is to be understood. In the first part of the article, we examine the argument and locate its main source, namely, the alleged entanglement of second-order logic and mathematics. We then identify various reasons why the entanglement may be thought to be problematic. In the second part of the article, we take a metatheoretic perspective on the matter. (...) We prove a number of results establishing that the entanglement is sensitive to the kind of semantics used for second-order logic. These results provide evidence that by moving from the standard set-theoretic semantics for second-order logic to a semantics which makes use of higher-order resources, the entanglement either disappears or may no longer be in conflict with the logicality of second-order logic. (shrink)

What is the relation between some things and the set of these things? Mathematical practice does not provide a univocal answer. On the one hand, it relies on ordinary plural talk, which is implicitly committed to a traditional form of plural logic. On the other hand, mathematical practice favors a liberal view of definitions which entails that traditional plural logic must be restricted. We explore this predicament and develop a “critical” alternative to traditional plural logic.

Fine's replies to critics, in a symposium on his book The Limits of Abstraction.

There are quite a few theses about logic that are in one way or another pluralist: they hold (i) that there is no uniquely correct logic, and (ii) that because of this, some or all debates about logic are illusory, or need to be somehow reconceived as not straightforwardly factual. Pluralist theses differ markedly over the reasons offered for there being no uniquely correct logic. Some such theses are more interesting than others, because they more radically affect how we are (...) initially inclined to understand debates about logic. Can one find a pluralist thesis that is high on the interest scale, and also true? (shrink)

The main aim of this work is to evaluate whether Boolos’ semantics for second-order languages is model-theoretically equivalent to standard model-theoretic semantics. Such an equivalence result is, actually, directly proved in the “Appendix”. I argue that Boolos’ intent in developing such a semantics is not to avoid set-theoretic notions in favor of pluralities. It is, rather, to prevent that predicates, in the sense of functions, refer to classes of classes. Boolos’ formal semantics differs from a semantics of pluralities for Boolos’ (...) plural reading of second-order quantifiers, for the notion of plurality is much more general, not only of that set, but also of class. In fact, by showing that a plurality is equivalent to sub-sets of a power set, the notion of plurality comes to suffer a loss of generality. Despite of this equivalence result, I maintain that Boolos’ formal semantics does not committ second-order languages to second-order entities, contrary to standard semantics. Further, such an equivalence result provides a rationale for many criticisms to Boolos’ formal semantics, in particular those by Resnik and Parsons against its alleged ontological innocence and on its Platonistic presupposition. The key set-theoretic notion involved in the equivalence proof is that of many-valued function. But, first, I will provide a clarification of the philosophical context and theoretical grounds of the genesis of Boolos’ formal semantics. (shrink)

The paper starts with an examination and critique of Tarski’s wellknown proposed explication of the notion of logical operation in the type structure over a given domain of individuals as one which is invariant with respect to arbitrary permutations of the domain. The class of such operations has been characterized by McGee as exactly those definable in the language L∞,∞. Also characterized similarly is a natural generalization of Tarski’s thesis, due to Sher, in terms of bijections between domains. My main (...) objections are that on the one hand, the Tarski-Sher thesis thus assimilates logic to mathematics, and on the other hand fails to explain the notion of same logical operation across domains of different sizes. A new notion of homomorphism invariant operation over functional type structures (with domains M0 of individuals and {T, F} at their base) is introduced to accomplish the latter. The main result is that an operation is definable from.. (shrink)

This paper raises and then discusses a puzzle concerning the ontological commitments of mathematical principles. The main focus here is Hume's Principle—a statement that, embedded in second-order logic, allows for a deduction of the second-order Peano axioms. The puzzle aims to put pressure on so-called epistemic rejectionism, a position that rejects the analytic status of Hume's Principle. The upshot will be to elicit a new and very basic disagreement between epistemic rejectionism and the neo-Fregeans, defenders of the analytic status of (...) Hume's Principle, which will provide a new angle from which properly to assess and re-evaluate the current debate. (shrink)

Realists about possible worlds typically identify possible worlds with abstract objects, such as propositions or properties. However, they face a significant objection due to Lewis (1986), to the effect that there is no way to explain how possible worlds-as-abstract objects represent possibilities. In this paper, I describe a response to this objection on behalf of realists. The response is to identify possible worlds with propositions, but to deny that propositions are abstract objects, or indeed objects at all. Instead, I argue (...) that realists should follow Prior (1971) and others in treating higher-order quantification (e.g. quantification into predicate or sentence position) as a genuine form of quantification in its own right, and so in particular, not to be analysed in terms of first-order quantification over abstract objects. I argue that from this ‘higher-orderist’ perspective, there is a relatively straightforward answer to the question of how possible worlds-as-propositions succeed in representing possibilities. (shrink)

Prompted by Poincaré, Russell put forward his celebrated vicious-circle principle (vcp) as the solution to the modern paradoxes. Ramsey, Gödel, and Quine, among others, have raised two salient objections against Russell's vcp. First, Gödel has claimed that Russell's various renderings of the vcp really express distinct principles and thus, distinct solutions to the paradoxes, a claim that gainsays one of Russell's positions on the nature of the solution to the paradoxes, namely, that such a solution be uniform. Secondly, Ramsey, Gödel, (...) and Quine have protested that the vcp's proscription against impredicative specification is incompatible with a realistic conception of the domain of quantification, a conception that Russell certainly held. I examine Russell's vcp and defend it against these objections. (shrink)

In this paper, we offer a contribution to the discussion of one of the most important objections against a relativist position in the absolute generality debate. The inexpressibility objection accuses the generality-relativist of not being able to coherently express her own position. First, we examine Glanzberg’s attempt to reply to this objection and we show that it fails. Second, we study the prospects of generalizing the relativist position. In particular, we analyze Fine’s and Linnebo’s modal approaches and we argue that, (...) even though they are able to coherently express one of the core ideas of relativism while avoiding the inexpressibility objection, there is an important sense in which they are no longer relativist positions. Third, while strengthening the idea that the inexpressibility objection does succeed, we argue that this is no guarantee of the falsity of relativism. Relativism may be inexpressible but true. However, we stress that even if the inexpressibility objection does not supply a definitive, knock-down objection against relativism, if we want to discuss relativism in a rational way, the objection offers a compelling reason not to embrace generality-relativism. (shrink)

It is sometimes suggested that impure sets are spatially co-located with their members (and hence are located in space). Sets, however, are in important respects like numbers. In particular, sets are connected to concepts in much the same manner as numbers are connected to concepts—in both cases, they are fundamentally abstracts of (or corresponding to) concepts. This parallel between the structure of sets and the structure of numbers suggests that the metaphysics of sets and the metaphysics of numbers should parallel (...) each other in relevant ways. This entails, in turn, that impure sets are not co-located with their members (nor are they located in space). (shrink)

A number of formal constraints on acceptable abstraction principles have been proposed, including conservativeness and irenicity. Hume’s Principle, of course, satisfies these constraints. Here, variants of Hume’s Principle that allow us to count concepts instead of objects are examined. It is argued that, prima facie, these principles ought to be no more problematic than HP itself. But, as is shown here, these principles only enjoy the formal properties that have been suggested as indicative of acceptability if certain constraints on the (...) size of the continuum hold. As a result, whether or not these higher-order versions of Hume’s Principle are acceptable seems to be independent of standard (ZFC) set theory. This places the abstractionist in an uncomfortable dilemma: Either there is some inherent difference between counting objects and counting concepts, or new criteria for acceptability will need to be found. It is argued that neither horn looks promising. (shrink)

In Mathematics is megethology. Philosophia Mathematica, 1, 3–23) David K. Lewis proposes a structuralist reconstruction of classical set theory based on mereology. In order to formulate suitable hypotheses about the size of the universe of individuals without the help of set-theoretical notions, he uses the device of Boolos’ plural quantification for treating second order logic without commitment to set-theoretical entities. In this paper we show how, assuming the existence of a pairing function on atoms, as the unique assumption non expressed (...) in a mereological language, a mereological foundation of set theory is achievable within first order logic. Furthermore, we show how a mereological codification of ordered pairs is achievable with a very restricted use of the notion of plurality without plural quantification. (shrink)

Classical mereology seems unable to characterise the identity conditions of word types. For example, the same letter types ordered differently result in different word types; but mereological fusions of the same letters are identical, regardless of the order of the letters. We show, however, that by combining classical mereology with plural logic one can give a definition of word types that satisfies the identity criteria of word types. This means that it is not necessary to abandon classical mereology in order (...) to give an analysis of the mereological structure of word types. (shrink)

Aim of the paper is to revise Boolos’ reinterpretation of second-order monadic logic in terms of plural quantification ([4], [5]) and expand it to full second order logic. Introducing the idealization of plural acts of choice, performed by a suitable team of agents, we will develop a notion of plural reference . Plural quantification will be then explained in terms of plural reference. As an application, we will sketch a structuralist reconstruction of second-order arithmetic based on the axiom of infinite (...) à la Dedekind, as the unique non-logical axiom. We will also sketch a virtual interpretation of the classical continuum involving no other infinite than a countable plurality of individuals. (shrink)

In Lewis reconstructs set theory using mereology and plural quantification (MPQ). In his recontruction he assumes from the beginning that there is an infinite plurality of atoms, whose size is equivalent to that of the set theoretical universe. Since this assumption is far beyond the basic axioms of mereology, it might seem that MPQ do not play any role in order to guarantee the existence of a large infinity of objects. However, we intend to demonstrate that mereology and plural quantification (...) are, in some ways, particularly relevant to a certain conception of the infinite. More precisely, though the principles of mereology and plural quantification do not guarantee the existence of an infinite number of objects, nevertheless, once the existence of any infinite object is admitted, they are able to assure the existence of an uncountable infinity of objects. So, ifMPQ were parts of logic, the implausible consequence would follow that, given a countable infinity of individuals, logic would be able to guarantee an uncountable infinity of objects. (shrink)

In Parts of Classes (1991) and Mathematics Is Megethology (1993) David Lewis defends both the innocence of plural quantification and of mereology. However, he himself claims that the innocence of mereology is different from that of plural reference, where reference to some objects does not require the existence of a single entity picking them out as a whole. In the case of plural quantification . Instead, in the mereological case: (Lewis, 1991, p. 87). The aim of the paper is to (...) argue that one—an innocence thesis similar to that of plural reference is defensible. To give a precise account of plural reference, we use the idea of plural choice. We then propose a virtual theory of mereology in which the role of individuals is played by plural choices of atoms. (shrink)

The view that plural reference is reference to a set is examined in light of George Boolos's treatment of second-order quantification as plural quantification in English. I argue that monadic second-order logic does not, in Boolos's treatment, reflect the behavior of plural quantifiers under negation and claim that any sentence that properly translates a second-order formula, in accordance with his treatment, has a first-order formulation. Support for this turns on the use of certain partitive constructions to assign values to variables (...) in a way that makes Boolos's reading of second-order variables available for a first-order language and, with it, the possibility of interpreting quantification in an unrestricted domain.A first-order theory, T(D), is developed on the basis of Boolos's treatment of simple plural definite descriptions extended to Richard Sharvy's general theory of definite plural and mass descriptions. I introduce a primitive predicate, o, for the relation of the referent of a singular description to that of its plural. If o is simply added to T(D), is definable in T(D), and the result is inconsistent. If o is added to a theory with axioms for the fragment of T(D) I call D-mereology, the result is a natural basis for the development of a pluralized Zermelo set theory. This theory, however, is inconsistent in an unrestricted domain, unless it is recast as a second-order theory of sets interpreted in Boolos's way. (shrink)

In Mathematics is megethology Lewis reconstructs set theory combining mereology with plural quantification. He introduces megethology, a powerful framework in which one can formulate strong assumptions about the size of the universe of individuals. Within this framework, Lewis develops a structuralist class theory, in which the role of classes is played by individuals. Thus, if mereology and plural quantification are ontologically innocent, as Lewis maintains, he achieves an ontological reduction of classes to individuals. Lewis’work is very attractive. However, the alleged (...) innocence of mereology and plural quantification is highly controversial and has been criticized by several authors. In the present paper we propose a new approach to megethology based on the theory of plural reference developed in To be is to be the object of a possible act of choice. Our approach shows how megethology can be grounded on plural reference without the help of mereology. (shrink)

In To be is to be the object of a possible act of choice the authors defended Boolos’ thesis that plural quantification is part of logic. To this purpose, plural quantification was explained in terms of plural reference, and a semantics of plural acts of choice, performed by an ideal team of agents, was introduced. In this paper, following that approach, we develop a theory of concepts that—in a sense to be explained—can be labeled as a theory of logical concepts. (...) Within this theory, we propose a new logicist approach to natural numbers. Then, we compare our logicism with Frege’s traditional logicism. (shrink)

Gareth Evans'' proposal, as amended by Steven Neale –that a definite pronoun with a quantifiedantecedent that does not bind it has the sense ofa definite description – has been challenged inthe singular case by appeal to counter-examplesinvolving failure of the uniqueness condition forthe legitimacy of a singular description. Thischallenge is here extended to the plural.Counter-examples are provided by cases in which aplural description `the Fs'' does not denote,despite the propriety of the use of `they'' or`them'' it is to replace, because (...) of failure ofcumulativeness. A noncumulative predicate isnot distributive, and conditions for thelegitimacy of `the Fs'' designed to accommodatenondistributive `Fs'' are given in the context ofa two sorted theory with generalized quantifiers.Failure of cumulativeness is not to be confusedwith failure of maximality as Neale and othersdefine it. If not all Fs are Gs, `The Fs are Gs''is false; but it does not follow that `the Fs'' isillegitimate; and if `Fs'' is distributive. it isso only if there are no Fs. These differencesgranted, I give a partial defense of theEvans–Neale proposal from deficiencies in analternative based on the views of P. T.Geach. (shrink)

Standard Type Theory, STT, tells us that b^n(a^m) is well-formed iff n=m+1. However, Linnebo and Rayo have advocated the use of Cumulative Type Theory, CTT, has more relaxed type-restrictions: according to CTT, b^β(a^α) is well-formed iff β > α. In this paper, we set ourselves against CTT. We begin our case by arguing against Linnebo and Rayo’s claim that CTT sheds new philosophical light on set theory. We then argue that, while CTT ’s type-restrictions are unjustifiable, the type-restrictions imposed by (...) STT are justified by a Fregean semantics. What is more, this Fregean semantics provides us with a principled way to resist Linnebo and Rayo’s Semantic Argument for CTT. We end by examining an alternative approach to cumulative types due to Florio and Jones; we argue that their theory is best seen as a misleadingly formulated version of STT. (shrink)

Second-order logic has a number of attractive features, in particular the strong expressive resources it offers, and the possibility of articulating categorical mathematical theories (such as arithmetic and analysis). But it also has its costs. Five major charges have been launched against second-order logic: (1) It is not axiomatizable; as opposed to first-order logic, it is inherently incomplete. (2) It also has several semantics, and there is no criterion to choose between them (Putnam, J Symbol Logic 45:464–482, 1980 ). Therefore, (...) it is not clear how this logic should be interpreted. (3) Second-order logic also has strong ontological commitments: (a) it is ontologically committed to classes (Resnik, J Phil 85:75–87, 1988 ), and (b) according to Quine (Philosophy of logic, Prentice-Hall: Englewood Cliffs, 1970 ), it is nothing more than “set theory in sheep’s clothing”. (4) It is also not better than its first-order counterpart, in the following sense: if first-order logic does not characterize adequately mathematical systems, given the existence of non - isomorphic first-order interpretations, second-order logic does not characterize them either, given the existence of different interpretations of second-order theories (Melia, Analysis 55:127–134, 1995 ). (5) Finally, as opposed to what is claimed by defenders of second-order logic [such as Shapiro (J Symbol Logic 50:714–742, 1985 )], this logic does not solve the problem of referential access to mathematical objects (Azzouni, Metaphysical myths, mathematical practice: the logic and epistemology of the exact sciences, Cambridge University Press, Cambridge, 1994 ). In this paper, I argue that the second-order theorist can solve each of these difficulties. As a result, second-order logic provides the benefits of a rich framework without the associated costs. (shrink)

Ignacio Jane has argued that second-order logic presupposes some amount of set theory and hence cannot legitimately be used in axiomatizing set theory. I focus here on his claim that the second-order formulation of the Axiom of Separation presupposes the character of the power set operation, thereby preventing a thorough study of the power set of infinite sets, a central part of set theory. In reply I argue that substantive issues often cannot be separated from a logic, but rather must (...) be presupposed. I call this the logic-metalogic link. There are two facets to the logic-metalogic link. First, when a logic is entangled with a substantive issue, the same position on that issue should be taken at the meta- level as at the object level; and second, if an expression has a clear meaning in natural language, then the corresponding concept can equally well be deployed in a formal language. The determinate nature of the power set operation is one such substantive issue in set theory. Whether there is a determinate power set of an infinite set can only be presupposed in set theory, not proved, so the use of second-order logic cannot be ruled out by virtue of presupposing one answer to this question. Moreover, the legitimacy of presupposing in the background logic that the power set of an infinite set is determinate is guaranteed by the clarity and definiteness of the notions of all and of subset. This is also exactly what is required for the same presupposition to be legitimately made in an axiomatic set theory, so the use of second-order logic in set theory rather than first-order logic does not require any new metatheoretic commitments. (shrink)

PG (Plural Grundgesetze) is a predicative monadic second-order system which is aimed to derive second-order Peano arithmetic. It exploits the notion of plural quantification and a few Fregean devices, among which the infamous Basic Law V. In this paper, a model-theoretical consistency proof for the system PG is provided.

PG (Plural Grundgesetze) is a predicative monadic second-order system which exploits the notion of plural quantification and a few Fregean devices, among which a formulation of the infamous Basic Law V. It is shown that second-order Peano arithmetic can be derived in PG. I also investigate the philosophical issue of predicativism connected to PG. In particular, as predicativism about concepts seems rather un-Fregean, I analyse whether there is a way to make predicativism compatible with Frege’s logicism.

This paper examines the connection between model-theoretic truth and necessary truth. It is argued that though the model-theoretic truths of some standard languages are demonstrably ''''necessary'''' (in a precise sense), the widespread view of model-theoretic truth as providing a general guarantee of necessity is mistaken. Several arguments to the contrary are criticized.

This paper examines the ontological commitments of the second-order language of arithmetic and argues that they do not extend beyond the first-order language. Then, building on an argument by George Boolos, we develop a Tarski-style definition of a truth predicate for the second-order language of arithmetic that does not involve the assignment of sets to second-order variables but rather uses the same class of assignments standardly used in a definition for the first-order language.

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

Some Presentists—according to whom everything is present—identify instants of time with propositions of a certain kind. However, the view that times are propositions seems to be at odds with Presentism: if there are times then there are past times, and therefore things that are past; but how could there be things that are past if everything is present? In this paper, we describe the Presentist view that times are propositions ; we set out the argument that Presentism is incompatible with (...) the view that times are propositions ; and then we describe three possible responses to that argument on behalf of Presentists who identify times with propositions. We argue that each of these responses comes with significant costs. Finally, we describe a fourth possible response—according to which times are irreducibly higher-order entities—which appears to avoid the costs of the other three. We also describe and respond to two objections to the higher-order strategy. (shrink)