Here I defend dispositionalism about meaning and rule-following from Kripkenstein's infamous anti-dispositionalist arguments. The problems of finitude, error, and normativity are all addressed. The general lesson I draw is that Kripkenstein's arguments trade on an overly simplistic version of dispositionalism.

Logic has traditionally been construed as a normative discipline; it sets forth standards of correct reasoning. Explosion is a valid principle of classical logic. It states that an inconsistent set of propositions entails any proposition whatsoever. However, ordinary agents presumably do — occasionally, at least — have inconsistent belief sets. Yet it is false that such agents may, let alone ought to, believe any proposition they please. Therefore, our logic should not recognize explosion as a logical law. Call this the (...) ‘normative argument against explosion’. Arguments of this type play — implicitly or explicitly — a central role in motivating paraconsistent logics. Branden Fitelson, in a throwaway remark, has conjectured that there is no plausible ‘bridge principle’ articulating the normative link between logic and reasoning capable of supporting such arguments. This paper offers a critical evaluation of Fitelson’s conjecture, and hence of normative arguments for paraconsistency and the conceptions of logic’s normative status on which they repose. It is argued that Fitelson’s conjecture turns out to be correct: normative arguments for paraconsistency probably fail. (shrink)

This is a survey of the concept of continuity. Efforts to explicate continuity have produced a plurality of philosophical conceptions of continuity that have provably distinct expressions within contemporary mathematics. I claim that there is a divide between the conceptions that treat the whole continuum as prior to its parts, and those conceptions that treat the parts of the continuum as prior to the whole. Along this divide, a tension emerges between those conceptions that favor philosophical idealizations of continuity and (...) those that are more readily available for mathematico-scientific use. (shrink)

In the recent literature on proof-theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable (...) results and that it is ill-supported by the arguments brought in its favour. (shrink)

In virtue of Fitch-Church proof, also known as the knowability paradox, we are able to prove that if everything is knowable, then everything is known. I present two ‘onto-theological’ versions of the proof, one concerning collective omniscience and another concerning omnificence. I claim these arguments suggest new ways of exploring the intersection between logical and ontological givens that is a grounding theme of religious thought. What is more, they are good examples of what I call semi-paradoxes: apparently sound arguments whose (...) conclusion is not properly unacceptable, but simply arguable. (shrink)

Frederic Fitch’s celebrated reasoning to the conclusion that all truths are known can be interpreted as a reductio of the claim that all truths are knowable. Given this, nearly all of the proof’s reception has involved canvassing the prospects for some form of verificationism. Unfortunately, debates of this sort discount much of the philosophical import of the proof. In addition to its relevance for verificationism, Fitch’s proof is also an argument for the existence of God, one at least as strong (...) as the traditional demonstrations. Perhaps unlike other such proofs, Fitch’s also operates as a key lemma in a proof that establishes that God can’t exist. (shrink)

Harmony and conservative extension are two criteria proposed to discern between acceptable and unacceptable rules. Despite some interesting works in this field, the exact relation between them is still not clear. In this article, some standard counterexamples to the equivalence between them are summarized, and a recent formulation of the notion of stability is used to express a more refined conjecture about their relation. Then Prawitz's proposal of a counterexample based on the truth predicate to this refined conjecture is shown (...) to rest on dubious assumptions. As a consequence, two new counterexamples are proposed: one uses the extension of logic with a small amount of arithmetic, while the other uses the extension of a small fragment of arithmetic with a problematic operator defined by Peano. It is argued that both these new counterexamples work fine to reject the conjecture and that the last one works also as a rejection of harmony as a complete criterion of acceptability of rules. (shrink)

A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.