Inferentialism is a theory in the philosophy of language which claims that the meanings of expressions are constituted by inferential roles or relations. Instead of a traditional model-theoretic semantics, it naturally lends itself to a proof-theoretic semantics, where meaning is understood in terms of inference rules with a proof system. Most work in proof-theoretic semantics has focused on logical constants, with comparatively little work on the semantics of non-logical vocabulary. Drawing on Robert Brandom’s notion of material inference and Greg Restall’s (...) bilateralist interpretation of the multiple conclusion sequent calculus, I present a proof-theoretic semantics for atomic sentences and their constituent names and predicates. The resulting system has several interesting features: (1) the rules are harmonious and stable; (2) the rules create a structure analogous to familiar model-theoretic semantics; and (3) the semantics is compositional, in that the rules for atomic sentences are determined by those for their constituent names and predicates. (shrink)

We present and defend the Australian Plan semantics for negation. This is a comprehensive account, suitable for a variety of different logics. It is based on two ideas. The first is that negation is an exclusion-expressing device: we utter negations to express incompatibilities. The second is that, because incompatibility is modal, negation is a modal operator as well. It can, then, be modelled as a quantifier over points in frames, restricted by accessibility relations representing compatibilities and incompatibilities between such points. (...) We defuse a number of objections to this Plan, raised by supporters of the American Plan for negation, in which negation is handled via a many-valued semantics. We show that the Australian Plan has substantial advantages over the American Plan. (shrink)

This paper consider Prior's connective Tonk from a particular bilateralist perspective. I show that there is a natural perspective from which we can see Tonk and its ilk as perfectly well-defined pieces of vocabulary; there is no need for restrictions to bar things like Tonk.

The starting point of this paper is a version of intra-theoretical pluralism that was recently proposed by Hjortland [2013]. In a first move, I use synonymy-relations to formulate an intuitively compelling objection against Hjortland's claim that, if one uses a single calculus to characterise the consequence relations of the paraconsistent logic LP and the paracomplete logic K3, one immediately obtains multiple consequence relations for a single language and hence a reply to the Quinean charge of meaning variance. In a second (...) move, I explain how a natural generalisation of the notion of synonymy can be used to counter this objection, but I also show how the solution can be turned into an equally devastating ‘one logic after all’ type of objection. Finally, I propose the general diagnosis that these problems could only arise in the presence of conceptual distinctions that are too coarse to accommodate coherent pluralist theses. T.. (shrink)

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)

This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends classical (...) logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered. (shrink)

Sellars [1960, ‘Grammar and existence: A preface to ontology’] argues that the truth of a second-order sentence does not incur commitment to there being any sort of abstract entity. This paper begins by exploring the arguments that Sellars offers for the above claim. It then develops those arguments by pointing out places where Sellars has been unclear or ought to have said more. In particular, Sellars's arguments rely on there being a means by which language users could come to understand (...) sentences of a second-order language wherein the truth of second-order existential sentences do not require there to be abstract entities. In addition to this, as Sellars [1979, Naturalism and Ontology] notes, a formal account of quantification is required that does not make use of the apparatus of sequences. Both such a translation of and a formal account of quantification are provided in this article. (shrink)

This paper considers a topos-theoretic structure for the interpretation of co-constructive logic for proofs and refutations following Trafford :22–40, 2015). It is notoriously tricky to define a proof-theoretic semantics for logics that adequately represent constructivity over proofs and refutations. By developing abstractions of elementary topoi, we consider an elementary topos as structure for proofs, and complement topos as structure for refutation. In doing so, it is possible to consider a dialogue structure between these topoi, and also control their relation such (...) that classical logic is simulated where proofs and refutations are conclusive. (shrink)

In bilateral systems for classical logic, assertion and denial occur as primitive signs on formulas. Such systems lend themselves to an inferentialist story about how truth-conditional content of connectives can be determined by inference rules. In particular, for classical logic there is a bilateral proof system which has a property that Carnap in 1943 called categoricity. We show that categorical systems can be given for any finite many-valued logic using $n$-sided sequent calculus. These systems are understood as a further development (...) of bilateralism—call it multilateralism. The overarching idea is that multilateral proof systems can incorporate the logic of a variety of denial speech acts. So against Frege we say that denial is not the negation of assertion and, with Mark Twain, that denial is more than a river in Egypt. (shrink)

Even though the strong relationship between proof-theoretic and model-theoretic notions in one’s logical theory can be shown by soundness and completeness proofs, whether we can define the model-theoretic notions by means of the inferences in a proof system is not at all trivial. For instance, provable inferences in a proof system of classical logic in the logical framework do not determine its intended models as shown by Carnap (Formalization of logic, Harvard University Press, Cambridge, 1943), i.e., there are non-Boolean models (...) that satisfy its provable inferences. In the literature, this is known as the Categoricity problem or Carnap’s problem. In this paper, we will discuss the Categoricity problem (or Carnap’s problem) for three-valued logics K3 and LP. We will provide three different restrictions on admissible models that will deliver us categoricity results, some of which draw from the solutions provided for the Categoricity problem for classical logic in Belnap and Massey (Stud Log 49(1):67–82, 1990) and Bonnay and Westerståhl (Erkenntis 81(4):721–739, 2016). We will then argue that two of those solutions are philosophically well-motivated: (1) restricting the admissible models where negation is interpreted as a Strong Kleene truth-function, and (2) restricting the admissible models where a complex formula is assigned the third value when its immediate subformulas are assigned the third value. (shrink)

In this paper we elaborate a conception of entailment based on what we call the Ackermann principle, which explicates valid entailment through a logical connection between sentences depending on their informational content. We reconstruct Dunn’s informational semantics for entailment on the basis of Restall’s approach, with assertion and denial as two independent speech acts, by introducing the notion of a ‘position description’. We show how the machinery of position descriptions can effectively be used to define the positive and the negative (...) information carried by sentences of a given language and to present a formalized version of the Ackermann principle as an inclusion relationship between the informational contents of the conclusions and the premises of a valid entailment. Being so interpreted, the entailment relation exhibits certain properties, including the property of transitivity. Whereas properties such as Anderson and Belnap’s variable sharing property or Parry’s proscriptive principle are normally presented as imposing a relevance requirement on valid entailment, the suggested formalization of the Ackermann principle supports all of Gentzen’s structural rules, including weakening, a rule that is normally given up in sequent-style proof systems for relevance logics. In this way we propose an Ackermann-inspired explication of the nature of entailment as a relation between the informational contents of sentences. (shrink)

The standard inferentialist approaches to modal logic tend to suffer from not being able to uniquely characterize the modal operators, require that introduction and elimination rules be interdefined, or rely on the introduction of possible-world like indexes into the object language itself. In this paper I introduce a hypersequent calculus that is flexible enough to capture many of the standard modal logics and does not suffer from the above problems. It is therefore an ideal candidate to underwrite an inferentialist theory (...) of meaning for modal operators. Here I treat specifically the modal logics K, D, T, S4, B, and S5. I show that the calculi are adequate for each set of models, and show that they meet a large set of criteria that are generally thought necessary for a calculus to underwrite a theory of meaning. (shrink)

This paper develops and motivates a paraconsistent approach to semantic paradox from within a modest inferentialist framework. I begin from the bilateralist theory developed by Greg Restall, which uses constraints on assertions and denials to motivate a multiple-conclusion sequent calculus for classical logic, and, via which, classical semantics can be determined. I then use the addition of a transparent truth-predicate to motivate an intermediate speech-act. On this approach, a liar-like sentence should be “weakly asserted”, involving a commitment to the sentence (...) and its negation, without rejecting the sentence. From this, I develop a proof-theory, which both determines a typical paraconsistent model theory, and also gives us a nice way to understand classical recapture. (shrink)

The two-dimensional modal logic of Davies and Humberstone [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2D modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how the use of our concepts motivates the inference rules of the sequent calculus, and then show that the completeness (...) of the calculus for Davies–Humberstone models explains why those concepts have the structure described by those models. The result is yet another application of the completeness theorem. (shrink)

Inferentialism is a theory in the philosophy of language which claims that the meanings of expressions are constituted by inferential roles or relations. Instead of a traditional model-theoretic semantics, it naturally lends itself to a proof-theoretic semantics, where meaning is understood in terms of inference rules with a proof system. Most work in proof-theoretic semantics has focused on logical constants, with comparatively little work on the semantics of non-logical vocabulary. Drawing on Robert Brandom’s notion of material inference and Greg Restall’s (...) bilateralist interpretation of the multiple conclusion sequent calculus, I present a proof-theoretic semantics for atomic sentences and their constituent names and predicates. The resulting system has several interesting features: (1) the rules are harmonious and stable; (2) the rules create a structure analogous to familiar model-theoretic semantics; and (3) the semantics is compositional, in that the rules for atomic sentences are determined by those for their constituent names and predicates. (shrink)

Beall and Restall’s Logical Pluralism (2006) characterises pluralism about logical consequence in terms of the different ways cases can be selected in the analysis of logical consequence as preservation of truth over a class of cases. This is not the only way to understand or to motivate pluralism about logical consequence. Here, I will examine pluralism about logical consequence in terms of different standards of proof. We will focus on sequent derivations for classical logic, imposing two different restrictions on classical (...) derivations to produce derivations for intuitionistic logic and for dual intuitionistic logic. The result is another way to understand the manner in which we can have different consequence relations in the same language. Furthermore, the proof-theoretic perspective gives us a different explanation of how the one concept of negation can have three different truth conditions, those in classical, intuitionistic and dual-intuitionistic models. (shrink)

We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as Lellman's linear nested sequents, but were developed independently by Restall for S5 and extended to other normal modal logics by Parisi. The resulting systems obey Došen's principle: the modal rules are the same across different modal logics. Different modal systems only differ in the presence or absence of external structural rules. (...) With the exception of S5, the systems are modular in the sense that different structural rules capture different properties of the accessibility relation. We provide the first direct semantical cut-free completeness proofs for K, T, and D, and show how this method fails in the case of B and S4. (shrink)

The aim of this article is to offer a method for determining the ontological commitments of a formalized theory. The second section shows that determining the consequence relation of a language model-theoretically entails that the ontology of a theory is tied very closely to the variables that feature in that theory. The third section develops an alternative way of determining the ontological commitments of a theory given a proof-theoretic account of the consequence relation for the language that theory is in. (...) It is shown that the proof-theoretic account of ontological commitment does not entail that the ontological commitments of a theory depend on the variables of that theory. The last section of the article discusses how this account of ontological commitment can be used in other philosophical projects such as Wright’s (Frege’s conception of numbers as objects, Aberdeen University Press, Aberdeen, 1983) abstractionism. The article concludes with a discussion of the upshots of adopting the proof-theoretic account of ontological commitment for ontology generally. (shrink)

Uncut is a book about two kinds of paradoxes: paradoxes involving truth and its relatives, like the liar paradox, and paradoxes involving vagueness. There are lots of ways to look at these paradoxes, and lots of puzzles generated by them, and Uncut ignores most of this variety to focus on a single issue. That issue: do our words mean what they seem to mean, and if so, how can this be? I claim that our words do mean what they seem (...) to, and yet our language is not undermined by paradox. By developing a distinctive theory of meaning, I show how this can be. (shrink)