On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity theorem (...) for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

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)

I discuss Greg Restall’s attempt to generate an account of logical consequence from the incoherence of certain packages of assertions and denials. I take up his justification of the cut rule and argue that, in order to avoid counterexamples to cut, he needs, at least, to introduce a notion of logical form. I then suggest a few problems that will arise for his account if a notion of logical form is assumed. I close by sketching what I take to be (...) the most natural minimal way of distinguishing content and form and suggest further problems arising for this route. (shrink)

Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules for (...) the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement. (shrink)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...) problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (shrink)

According to logical inferentialists, the meanings of logical expressions are fully determined by the rules for their correct use. Two key proof-theoretic requirements on admissible logical rules, harmony and separability, directly stem from this thesis—requirements, however, that standard single-conclusion and assertion-based formalizations of classical logic provably fail to satisfy :1035–1051, 2011). On the plausible assumption that our logical practice is both single-conclusion and assertion-based, it seemingly follows that classical logic, unlike intuitionistic logic, can’t be accounted for in inferentialist terms. In (...) this paper, I challenge orthodoxy and introduce an assertion-based and single-conclusion formalization of classical propositional logic that is both harmonious and separable. In the framework I propose, classicality emerges as a structural feature of the logic. (shrink)

The standard relation of logical consequence allows for non-standard interpretations of logical constants, as was shown early on by Carnap. But then how can we learn the interpretations of logical constants, if not from the rules which govern their use? Answers in the literature have mostly consisted in devising clever rule formats going beyond the familiar what follows from what. A more conservative answer is possible. We may be able to learn the correct interpretations from the standard rules, because the (...) space of possible interpretations is a priori restricted by universal semantic principles. We show that this is indeed the case. The principles are familiar from modern formal semantics: compositionality, supplemented, for quantifiers, with topic-neutrality. (shrink)

Following a proposal of Humberstone, this paper studies a semantics for modal logic based on partial “possibilities” rather than total “worlds.” There are a number of reasons, philosophical and mathematical, to find this alternative semantics attractive. Here we focus on the construction of possibility models with a finitary flavor. Our main completeness result shows that for a number of standard modal logics, we can build a canonical possibility model, wherein every logically consistent formula is satisfied, by simply taking each individual (...) finite formula (modulo equivalence) to be a possibility, rather than each infinite maximally consistent set of formulas as in the usual canonical world models. Constructing these locally finite canonical models involves solving a problem in general modal logic of independent interest, related to the study of adjoint pairs of modal operators: for a given modal logic L, can we find for every formula phi a formula f(phi) such that for every formula psi, phi -> BOX psi is provable in L if and only if f(phi) -> psi is provable in L? We answer this question for a number of standard modal logics, using model-theoretic arguments with world semantics. This second main result allows us to build for each logic a canonical possibility model out of the lattice of formulas related by provable implication in the logic. (shrink)

This volume seeks to further the use of formal methods in clarifying one of the central problems of philosophy: that of our free human agency and its place in our indeterministic world. It celebrates the important contributions made in this area by Nuel Belnap, American logician and philosopher. Philosophically, indeterminism and free action can seem far apart, but in Belnap’s work, they are intimately linked. This book explores their philosophical interconnectedness through a selection of original research papers that build forth (...) on Belnap’s logical and philosophical work. Some contributions take the form of critical discussions of Belnap's published work, some develop points made in his publications in new directions, and others provide additional insights on the topics of indeterminism and free action. In Nuel Belnap’s work on indeterminism and free action, three formal frameworks figure prominently: the simple branching histories framework known as "branching time;" its relativistic spatio-temporal extension, branching space-times; and the “seeing to it that” logic of agency. As those frameworks provide the formal background for the contributed papers, the volume introduction gives an overview of the current state of their development. It also introduces case-intensional first order logic, a general intensional logic offering resources for a first-order extension of the mentioned frameworks and a recent research focus of Belnap’s. The volume also contains an extended biographical interview with Nuel Belnap. (shrink)

A good argument is one whose conclusions follow from its premises; its conclusions are consequences of its premises. But in what sense do conclusions follow from premises? What is it for a conclusion to be a consequence of premises? Those questions, in many respects, are at the heart of logic (as a philosophical discipline). Consider the following argument: 1. If we charge high fees for university, only the rich will enroll. We charge high fees for university. Therefore, only the rich (...) will enroll. There are many different things one can say about this argument, but many agree that if we do not equivocate (if the terms mean the same thing in the premises and the conclusion) then the argument is valid, that is, the conclusion follows deductively from the premises. This does not mean that the conclusion is true. Perhaps the premises are not true. However, if the premises are true, then the conclusion is also true, as a matter of logic. This entry is about the relation between premises and conclusions in valid arguments. (shrink)

Intuitively, vagueness involves some sort of indeterminacy: if Plato is a borderline case of baldness, then there is no fact of the matter about whether or not he’s bald—he’s neither bald nor not bald. The leading formal treatments of such indeterminacy—three valued logic, supervaluationism, etc.—either fail to validate the classical theorems, or require that various classically valid inference rules be restricted. Here we show how a fully classical, yet indeterminist account of vagueness can be given within natural semantics, an alternative (...) semantics for classical proof theory. The key features of the account are: there is a single notion of truth—definite truth—and a single notion of validity; sentences can be true, false, or undetermined; all classical theorems and all classical inference rule are valid; the sorites argument is unsound; ‘definitely’ is treated as a meta-language predicate; higher-order vagueness is handled via semantic ascent. (shrink)

Accounts of logical independence which coincide when applied in the case of classical logic diverge elsewhere, raising the question of what a satisfactory all-purpose account of logical independence might look like. ‘All-purpose’ here means: working satisfactorily as applied across different logics, taken as consequence relations. Principal candidate characterizations of independence relative to a consequence relation are that there the consequence relation concerned is determined by only by classes of valuations providing for all possible truth-value combinations for the formulas whose independence (...) is at issue, and that the consequence relation ‘says’ nothing special about how those formulas are related that it does not say about arbitrary formulas. Each of these proposals returns counterintuitive verdicts in certain cases—the truth-value inspired approach classifying certain cases one would like to describe as involving failures of independence as being cases of independence, and the de Jongh approach counting some intuitively independent pairs of formulas as not being independent after all. In final section, a modification of the latter approach is tentatively sketched to correct for these misclassifications. The attention is on conceptual clarification throughout, rather than the provision of technical results. Proofs, as well as further elaborations, are lodged in the ‘longer notes’ in a final Appendix. (shrink)

The following books have been received and many of them are still available for review. Interested reviewers please contact the reviews editor: [email protected], M., The Figure of This World:...

What is a minimal proof-theoretical foundation of logic? Two different ways to answer this question may appear to offer themselves: reduce the whole of logic either to the relation of inference, or else to the property of incompatibility. The first way would involve defining logical operators in terms of the algebraic properties of the relation of inference—with conjunction $$\hbox {A}\wedge \hbox {B}$$ A ∧ B as the infimum of A and B, negation $$\lnot \hbox {A}$$ ¬ A as the minimal (...) incompatible of A, etc. The second way involves introducing logical operators in terms of the relation of incompatibility, such that X is incompatible with $$\{\lnot \hbox {A}\}$$ { ¬ A } iff every Y incompatible with X is incompatible with {A}; and X is incompatible with $$\{\hbox {A}\!\wedge \!\hbox {B}\}$$ { A ∧ B } iff X is incompatible with {A,B}; etc. Whereas the first route leads us naturally to intuitionistic logic, the second leads us to classical logic. The aim of this paper is threefold: to investigate the relationship of the two approaches within a very general framework, to discuss the viability of erecting logic on such austere foundations, and to find out whether choosing one of the ways we are inevitably led to a specific logical system. (shrink)