What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

This essay aims to redress the contention that epistemic possibility cannot be a guide to the principles of modal metaphysics. I introduce a novel epistemic two-dimensional truthmaker semantics. I argue that the interaction between the two-dimensional framework and the mereological parthood relation, which is super-rigid, enables epistemic possibilities and truthmakers with regard to parthood to be a guide to its metaphysical profile. I specify, further, a two-dimensional formula encoding the relation between the epistemic possibility and verification of essential properties obtaining (...) and their metaphysical possibility or verification. I then generalize the approach to haecceitistic properties, and examine the Julius Caesar problem as a test case. (shrink)

This paper aims to provide hyperintensional foundations for mathematical platonism. I examine Hale and Wright's (2009) objections to the merits and need, in the defense of mathematical platonism and its epistemology, of the thesis of Necessitism. In response to Hale and Wright's objections to the role of epistemic and metaphysical modalities in providing justification for both the truth of abstraction principles and the success of mathematical predicate reference, I examine the Necessitist commitments of the abundant conception of properties endorsed by (...) Hale and Wright and examined in Hale (2013), and demonstrate how a two-dimensional approach to the epistemology of mathematics is consistent with Hale and Wright's notion of there being non-evidential epistemic entitlement rationally to trust that abstraction principles are true. A choice point that I flag is that between availing of intensional or hyperintensional semantics. The hyperintensional semantic approach that I advance is a topic-sensitive epistemic two-dimensional truthmaker semantics. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest that observational type theory can be applied to first-order abstraction principles in order to make abstraction principles recursively enumerable. Epistemic and metaphysical states and possibilities may thus be shown to play a constitutive role in vindicating the reality of mathematical objects and truth, and in providing a conceivability-based route to the truth of abstraction principles as well as other axioms and propositions in mathematics. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. I provide a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

Many philosophers believe that a deflationist theory of truth must conservatively extend any base theory to which it is added. But when applied to arithmetic, it's argued, the imposition of a conservativeness requirement leads to a serious objection to deflationism: for the Gödel sentence for Peano Arithmetic is not a theorem of PA, but becomes one when PA is extended by adding plausible principles governing truth. This paper argues that no such objection succeeds. The issue turns on how we understand (...) the notion of logical consequence implicit in any conservativeness requirement, and whether we possess a categorical conception of the natural numbers. I offer a disjunctive response: if we possess a categorical conception of arithmetic, then deflationists have principled reason to accept a rich notion of logical consequence according to which the Gödel sentence follows from PA. But if we do not, then the reasons for requiring the derivation of the Gödel sentence lapse, and deflationists are free to accept a conservativeness requirement stated proof-theoretically. Either way, deflationism is in the clear. (shrink)

This paper sets out a predicative response to the Russell-Myhill paradox of propositions within the framework of Church’s intensional logic. A predicative response places restrictions on the full comprehension schema, which asserts that every formula determines a higher-order entity. In addition to motivating the restriction on the comprehension schema from intuitions about the stability of reference, this paper contains a consistency proof for the predicative response to the Russell-Myhill paradox. The models used to establish this consistency also model other axioms (...) of Church’s intensional logic that have been criticized by Parsons and Klement: this, it turns out, is due to resources which also permit an interpretation of a fragment of Gallin’s intensional logic. Finally, the relation between the predicative response to the Russell-Myhill paradox of propositions and the Russell paradox of sets is discussed, and it is shown that the predicative conception of set induced by this predicative intensional logic allows one to respond to the Wehmeier problem of many non-extensions. (shrink)

I have two main objectives. The first is to get a better understanding of what is at issue between friends and foes of higher-order quantification, and of what it would mean to extend a Boolos-style treatment of second-order quantification to third- and higherorder quantification. The second objective is to argue that in the presence of absolutely general quantification, proper semantic theorizing is essentially unstable: it is impossible to provide a suitably general semantics for a given language in a language of (...) the same logical type. I claim that this leads to a trilemma: one must choose between giving up absolutely general quantification, settling for the view that adequate semantic theorizing about certain languages is essentially beyond our reach, and countenancing an open-ended hierarchy of languages of ever ascending logical type. I conclude by suggesting that the hierarchy may be the least unattractive of the options on the table. (shrink)

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like 'All the theorems are true', 'Everything Peter said is true', etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case (...) of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first-order logic, full second-order logic, and existential second-order (?11-) logic. (shrink)

Remarks on the Foundations of Mathematics, Wittgenstein, despite his official 'mathematical nonrevisionism', slips into attempting to refute Gödel's theorem. Actually, Wittgenstein could have used Gödel's theorem to good effect, to support his view that proof, and even truth, are 'family resemblance' concepts. The reason that Wittgenstein did not see all this is that Gödel's theorem had become an icon of mathematical realism, and he was blinded by his own ideology. The essay is a reply to Juliet Floyd's work on Gödel: (...) what she says Wittgenstein said, I say he should have said, but didn't (couldn't). (shrink)

A common objection to hierarchical approaches to truth is that they fragment the concept of truth. This paper defends hierarchical approaches in general against the objection of fragmentation. It argues that the fragmentation required is familiar and unprob-lematic, via a comparison with mathematical proof. Furthermore, it offers an explanation of the source and nature of the fragmentation of truth. Fragmentation arises because the concept exhibits a kind of failure of closure under reflection. This paper offers a more precise characterization of (...) the reflection involved, first in the setting of formal theories of truth, and then in a more general setting. (shrink)

A survey of more philosophical applications of Gödel's incompleteness results.

In “Models and Reality” (1980), Putnam sketched a version of his internal realism as it might arise in the philosophy of mathematics. Here, I will develop that sketch. By combining Putnam’s model-theoretic arguments with Dummett’s reflections on Gödelian incompleteness, we arrive at (what I call) the Skolem-Gödel Antinomy. In brief: our mathematical concepts are perfectly precise; however, these perfectly precise mathematical concepts are manifested and acquired via a formal theory, which is understood in terms of a computable system of proof, (...) and hence is incomplete. Whilst this might initially seem strange, I show how internal categoricity results for arithmetic and set theory allow us to face up to this Antinomy. This also allows us to understand why “Models are not lost noumenal waifs looking for someone to name them,” but “constructions within our theory itself,” with “names from birth.”. (shrink)

ABSTRACTAccording to a famous argument by Dummett, the concept of set is indefinitely extensible, and the logic appropriate for reasoning about the instances of any such concept is intuitionistic, not classical. But Dummett's argument is widely regarded as obscure. This note explains how the final chapter of Rumfitt's important new book advances our understanding of Dummett's argument, but it also points out some problems and unanswered questions. Finally, Rumfitt's reconstruction of Dummett's argument is contrasted with my own preferred alternative.

This paper examines the philosophical significance of the consequence relation defined in the $\Omega$-logic for set-theoretic languages. I argue that, as with second-order logic, the hyperintensional profile of validity in $\Omega$-Logic enables the property to be epistemically tractable. Because of the duality between coalgebras and algebras, Boolean-valued models of set theory can be interpreted as coalgebras. In Section \textbf{2}, I demonstrate how the hyperintensional profile of $\Omega$-logical validity can be countenanced within a coalgebraic logic. Finally, in Section \textbf{3}, the philosophical (...) significance of the characterization of the hyperintensional profile of $\Omega$-logical validity for the philosophy of mathematics is examined. I argue (i) that $\Omega$-logical validity is genuinely logical, and (ii) that it provides a hyperintensional account of formal grasp of the concept of `set'. Section \textbf{4} provides concluding remarks. (shrink)

According to the iterative conception of set, each set is a collection of sets formed prior to it. The notion of priority here plays an essential role in explanations of why contradiction-inducing sets, such as the Russell set, do not exist. Consequently, these explanations are successful only to the extent that a satisfactory priority relation is made out. I argue that attempts to do this have fallen short: understanding priority in a straightforwardly constructivist sense threatens the coherence of the empty (...) set and raises serious epistemological concerns; but the leading realist interpretations---ontological and modal interpretations of priority---are deeply problematic as well. I conclude that the purported explanatory virtues of the iterative conception are, at present, unfounded. (shrink)

I argue that absolutism, the view that absolutely unrestricted quantification is possible, is to blame for both the paradoxes that arise in naive set theory and variants of these paradoxes that arise in plural logic and in semantics. The solution is restrictivism, the view that absolutely unrestricted quantification is not possible. -/- It is generally thought that absolutism is true and that restrictivism is not only false, but inexpressible. As a result, the paradoxes are blamed, not on illicit quantification, but (...) on the logical conception of set which motivates naive set theory. The accepted solution is to replace this with the iterative conception of set. -/- I show that this picture is doubly mistaken. After a close examination of the paradoxes in chapters 2--3, I argue in chapters 4 and 5 that it is possible to rescue naive set theory by restricting quantification over sets and that the resulting restrictivist set theory is expressible. In chapters 6 and 7, I argue that it is the iterative conception of set and the thesis of absolutism that should be rejected. (shrink)

This essay endeavors to define the concept of indefinite extensibility in the setting of category theory. I argue that the generative property of indefinite extensibility for set-theoretic truths in category theory is identifiable with the Grothendieck Universe Axiom and the elementary embeddings in Vopenka's principle. The interaction between the interpretational and objective modalities of indefinite extensibility is defined via the epistemic interpretation of two-dimensional semantics. The semantics can be defined intensionally or hyperintensionally. By characterizing the modal profile of $\Omega$-logical validity, (...) and thus the generic invariance of mathematical truth, modal coalgebras are further capable of capturing the notion of definiteness for set-theoretic truths, in order to yield a non-circular definition of indefinite extensibility. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. I provide a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

It can be shown by means of a paradox that, given the Principle of Sufficient Reason, there is no conjunction of all contingent truths. The question is, or ought to be, how to interpret that result: _Quid sibi velit?_ A celebrated argument against PSR due to Peter van Inwagen and Jonathan Bennett in effect interprets the result to mean that PSR entails that there are no contingent truths. But reflection on parallels in philosophy of mathematics shows it can equally be (...) interpreted either as a proof that there are "too many" contingent truths to combine in a single conjunction or as a proof that the concept _contingent truth_ is indefinitely extensible and there is no such thing as "all contingent truths." Either interpretation would reconcile PSR with contingent truth, but the natural rationales of those interpretations are at odds. This essay argues that the second interpretation is a more satisfactory explanation of why, if PSR is true, there should be no conjunction of all contingent truths. This sheds new light on the nature of the explanatory demand embedded in PSR and uncovers a number of surprising implications for the commitments of rationalism. (shrink)

In recent years, many people writing on set theory have invoked the notion of an indefinitely extensible concept. The notion, it is usually claimed, plays an important role in solving the paradoxes of absolute infinity. It is not clear, however, how the notion should be formulated in a coherent way, since it appears to run into a number of problems concerning, for example, unrestricted quantification. In fact, the notion makes perfectly good sense if one endorses a dialetheic solution to the (...) paradoxes. It then morphs from a supposed solution to the paradoxes into a diagnosis of their structure. In this paper I show how. (shrink)

We demonstrate that, in itself and in the absence of extra premises, the following argument scheme is fallacious: The sentence A says about itself that it has a property F, and A does in fact have the property F; therefore A is true. We then examine an argument of this form in the informal introduction of Gödel’s classic (1931) and examine some auxiliary premises which might have been at work in that context. Philosophically significant as it may be, that particular (...) informal argument plays no rôle in Gödel’s technical results. Going deeper into the issue and investigating truth conditions of Gödelian sentences (i.e., those sentences which are provably equivalent to their own unprovability) will provide us with insights regarding the philosophical debate on the truth of Gödelian sentences of systems—a debate which goes back to Dummett (1963). (shrink)

It is commonly held that the natural numbers sequence 0, 1, 2,... possesses a unique structure. Yet by a well known model theoretic argument, there exist non-standard models of the formal theory which is generally taken to axiomatize all of our practices and intentions pertaining to use of the term “natural number.” Despite the structural similarity of this argument to the influential set theoretic indeterminacy argument based on the downward L ̈owenheim-Skolem theorem, most theorists agree that the number theoretic version (...) does not have skeptical consequences about the reference of “natural number” analogous to the ‘relativity’ Skolem claimed pertains to notions such as “uncountable” and “cardinal.” In this paper I argue that recent proposals by Shapiro, Lavine, McGee and Field which aim to distinguish the number and set theoretic indeterminacy arguments by locating extra-mathematical constraints on the interpretation of our number theoretic vocabulary are inadequate. I then suggest that if we consider the manner in which the natural numbers figure in our computational practices – e.g. in characterizing how we compute sums and products or determine prime factorizations – it follows that our application of computational terms such as “computable function” and “tractable computational problem” indirectly uniquely determines their structure. (shrink)

This special issue collects together nine new essays on logical consequence :the relation obtaining between the premises and the conclusion of a logically valid argument. The present paper is a partial, and opinionated,introduction to the contemporary debate on the topic. We focus on two influential accounts of consequence, the model-theoretic and the proof-theoretic, and on the seeming platitude that valid arguments necessarilypreserve truth. We briefly discuss the main objections these accounts face, as well as Hartry Field’s contention that such objections (...) show consequenceto be a primitive, indefinable notion, and that we must reject the claim that valid arguments necessarily preserve truth. We suggest that the accountsin question have the resources to meet the objections standardly thought to herald their demise and make two main claims: (i) that consequence, as opposed to logical consequence, is the epistemologically significant relation philosophers should be mainly interested in; and (ii) that consequence is a paradoxical notion if truth is. (shrink)

On the Dummettian understanding, anti-realism regarding a particular discourse amounts to (or at the very least, involves) a refusal to accept the determinacy of the subject matter of that discourse and a corresponding refusal to assert at least some instances of excluded middle (which can be understood as expressing this determinacy of subject matter). In short: one is an anti-realist about a discourse if and only if one accepts intuitionistic logic as correct for that discourse. On careful examination, the strongest (...) Dummettian arguments for anti-realism of this sort fail to secure intuitionistic logic as the single, correct logic for anti-realist discourses. Instead, antirealists are placed in a situation where they fail to be justified in asserting monism (that intuitionistic logic is the unique correct logic). Thus, antirealists seem forced either to accept pluralism (i.e. one or more intermediate logic is at least as `correct’ as intuitionistic logic–an option I take to be unattractive from the anti-realist perspective), or they must be anti-realists about the realism/anti-realism debate (and, in particular, must refuse to assert the instance of excluded middle equivalent to logical monism or logical pluralism). (shrink)

Some earlier remarks Michael Dummett made on Gödel’s theorem have recently inspired attempts to formulate an alternative to the standard demonstration of the truth of the Gödel sentence. The idea underlying the non-standard approach is to treat the Gödel sentence as an ordinary arithmetical one. But the Gödel sentence is of a very specific nature. Consequently, the non-standard arguments are conceptually mistaken. In this paper, both the faulty arguments themselves and the general reasons underlying their failure are analysed. The analysis (...) reveals the true nature of the epistemological relation between the Gödel sentence and its numerical instances. (shrink)

In this paper I would like to indicate that this interpretation of Gödel goes far beyond what he really proved. I would like to show that to get from his result to a conclusion of the above kind requires a train of thought which is fuelled by much more than Gödel's result itself, and that a great deal of the excessive fuel should be utilized with an extra care.

This dissertation is centered around a set of apparently conflicting intuitions that we may have about mathematics. On the one hand, we are inclined to believe that the theorems of mathematics are true. Since many of these theorems are existence assertions, it seems that if we accept them as true, we also commit ourselves to the existence of mathematical objects. On the other hand, mathematical objects are usually thought of as abstract objects that are non-spatiotemporal and causally inert. This makes (...) it difficult to understand how we can have knowledge of them and how they can have any relevance for our mathematical theories. I begin by characterizing a realist position in the philosophy of mathematics and discussing two of the most influential arguments for that kind of view. Next, after highlighting some of the difficulties that realism faces, I look at a few alternative approaches that attempt to account for our mathematical practice without making the assumption that there exist abstract mathematical entities. More specifically, I examine the fictionalist views developed by Hartry Field, Mark Balaguer, and Stephen Yablo, respectively. A common feature of these views is that they accept that mathematics interpreted at face value is committed to the existence of abstract objects. In order to avoid this commitment, they claim that mathematics, when taken at face value, is false. I argue that the fictionalist idea of mathematics as consisting of falsehoods is counter-intuitive and that we should aim for an account that can accommodate both the intuition that mathematics is true and the intuition that the causal inertness of abstract mathematical objects makes them irrelevant to mathematical practice and mathematical knowledge. The solution that I propose is based on Rudolf Carnap's distinction between an internal and an external perspective on existence. I argue that the most reasonable interpretation of the notions of mathematical truth and existence is that they are internal to mathematics and, hence, that mathematical truth cannot be used to draw the conclusion that mathematical objects exist in an external/ontological sense. (shrink)

Dialetheism is the view that there exists a true contradiction. This paper ventures to suggest that Priest’s argument for Dialetheism from Gödel’s theorem is unconvincing as the lesson of Gödel’s proof (or Rosser’s proof) is that any sufficiently strong theories of arithmetic cannot be both complete and consistent. In addition, a contradiction is derivable in Priest’s inconsistent and complete arithmetic. An alternative argument for Dialetheism is given by applying Gödel sentence to the inconsistent and complete theory of arithmetic. We argue, (...) however, that the alternative argument raises a circularity problem. In sum, Gödel’s and its related theorem merely show the relation between a complete and a consistent theory. A contradiction derived by the application of Gödel sentence has the value of true sentences, i.e. the both-value, only under the inconsistent models for arithmetic. Without having the assumption of inconsistency or completeness, a true contradiction is not derivable from the application of Gödel sentence. Hence, Gödel’s and its related theorem never can be a ground for Dialetheism. (shrink)

This volume covers a wide range of topics in the most recent debates in the philosophy of mathematics, and is dedicated to how semantic, epistemological, ontological and logical issues interact in the attempt to give a satisfactory picture of mathematical knowledge. The essays collected here explore the semantic and epistemic problems raised by different kinds of mathematical objects, by their characterization in terms of axiomatic theories, and by the objectivity of both pure and applied mathematics. They investigate controversial aspects of (...) contemporary theories such as neo-logicist abstractionism, structuralism, or multiversism about sets, by discussing different conceptions of mathematical realism and rival relativistic views on the mathematical universe. They consider fundamental philosophical notions such as set, cardinal number, truth, ground, finiteness and infinity, examining how their informal conceptions can best be captured in formal theories. The philosophy of mathematics is an extremely lively field of inquiry, with extensive reaches in disciplines such as logic and philosophy of logic, semantics, ontology, epistemology, cognitive sciences, as well as history and philosophy of mathematics and science. By bringing together well-known scholars and younger researchers, the essays in this collection – prompted by the meetings of the Italian Network for the Philosophy of Mathematics (FilMat) – show how much valuable research is currently being pursued in this area, and how many roads ahead are still open for promising solutions to long-standing philosophical concerns. Promoted by the Italian Network for the Philosophy of Mathematics – FilMat. (shrink)

This essay examines the philosophical significance of Ω-logic in Zermelo-Fraenkel set theory with choice (ZFC). The dual isomorphism between algebra and coalgebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The modal profile of Ω-logical validity can then be countenanced within a coalgebraic logic, and Ω-logical validity can be defined via deterministic automata. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal profiles of Ω-logical validity correspond to those of (...) second-order logical consequence, Ω-logical validity is genuinely logical, and thus vindicates a neo-logicist conception of mathematical truth in the set-theoretic multiverse. Second, the foregoing provides a modal-computational account of the interpretation of mathematical vocabulary, adducing in favor of a realist conception of the cumulative hierarchy of sets. (shrink)

Can we quantify over everything: absolutely, positively, definitely, totally, every thing? Some philosophers have claimed that we must be able to do so, since the doctrine that we cannot is self-stultifying. But this treats restrictivism as a positive doctrine. Restrictivism is much better viewed as a kind of militant quietism, which I call dadaism. Dadaists advance a hostile challenge, with the aim of silencing everyone who holds a positive position about ‘absolute generality’.

Whether or not we achieve absolute generality in philosophical inquiry, most philosophers would agree that ordinary inquiry is rarely, if ever, absolutely general. Even if the quantifiers involved in an ordinary assertion are not explicitly restricted, we generally take the assertion’s domain of discourse to be implicitly restricted by context.1 Suppose someone asserts (2) while waiting for a plane to take off.

forthcoming in S. Lindström, E. Palmgren, K. Segerberg, and V. Stoltenberg-Hansen (eds) Logicism, Intuitionism, and Formalism — What has Become of Them?, Synthese Library, Springer. Pdf file.

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)

In this paper I examine the prospects for a successful neo–logicist reconstruction of the real numbers, focusing on Bob Hale's use of a cut-abstraction principle. There is a serious problem plaguing Hale's project. Natural generalizations of this principle imply that there are far more objects than one would expect from a position that stresses its epistemological conservativeness. In other words, the sort of abstraction needed to obtain a theory of the reals is rampantly inflationary. I also indicate briefly why this (...) problem is likely to reappear in any neo–logicist reconstruction of real analysis. (shrink)

The purpose of this paper is to apply Crispin Wright’s criteria and various axes of objectivity to mathematics. I test the criteria and the objectivity of mathematics against each other. Along the way, various issues concerning general logic and epistemology are encountered.

Modal logic provides an elegant way to understand the notion of potential infinity. This raises the question of what the right modal logic is for reasoning about potential infinity. In this article I identify a choice point in determining the right modal logic: Can a potentially infinite collection ever be expanded in two mutually incompatible ways? If not, then the possible expansions are convergent; if so, then the possible expansions are branching. When possible expansions are convergent, the right modal logic (...) is S4.2, and a mirroring theorem due to Linnebo allows for a natural potentialist interpretation of mathematical discourse. When the possible expansions are branching, the right modal logic is S4. However, the usual box and diamond do not suffice to express everything the potentialist wants to express. I argue that the potentialist also needs an operator expressing that something will eventually happen in every possible expansion. I prove that the result of adding this operator to S4 makes the set of validities Pi-1-1 hard. This result makes it unlikely that there is any natural translation of ordinary mathematical discourse into the potentialist framework in the context of branching possibilities. (shrink)

We consider two versions of truth as grounded in verification procedures: Dummett's notion of proof as an effective way to establish the truth of a statement and Hintikka's GTS notion of truth as given by the existence of a winning strategy for the game associated with a statement. Hintikka has argued that the two notions should be effective and that one should thus restrict one's attention to recursive winning strategies. In the context of arithmetic, we show that the two notions (...) do not coincide: on the one hand, proofs in PA do not yield recursive winning strategies for the associated game; on the other hand, there is no sound and effective proof procedure that captures recursive GTS truths. We then consider a generalized version of Game Theoretical Semantics by introducing games with backward moves. In this setting, a connection is made between proofs and recursive winning strategies. We then apply this distinction between two kinds of verificationist procedures to a recent debate about how we recognize the truth of Gödelian sentences. (shrink)

In Chapter 7 of The Taming of the True, Neil Tennant provides a new argument from Michael Dummett's ``manifestation requirement'' to the incorrectness of classical logic and the correctness of intuitionistic logic. I show that Tennant's new argument is only valid if one interprets crucial existence claims occurring in the proof in the manner of intuitionists. If one interprets the existence claims as a classical logician would, then one can accept Tennant's premises while rejecting his conclusion of logical revision. Thus, (...) Tennant has provided no evidence that should convince anyone who is not already an intuitionist. Since his proof is a proof for the correctness of intuitionism, it begs the question. (shrink)

This essay aims to redress the contention that epistemic possibility cannot be a guide to the principles of modal metaphysics. I argue that the interaction between the multi-dimensional intensional framework and intensional plural quantification enables epistemic possibilities to target the haecceitistic properties of individuals. I outline the elements of plural logic, and I specify, then, a multi-dimensional intensional formula encoding the relation between the epistemic possibility of haecceity comprehension and its metaphysical possibility. I conclude by addressing objections from the indeterminacy (...) of ontological principles relative to the space of epistemic possibilities, and from the consistency of epistemic modal space. (shrink)