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)

In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...) involving semantic notions. In this article we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this article, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be nontrivially achieved if self-reference is expressed through identities. (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.

Inferentialism is the conviction that to be meaningful in the distinctively human way, or to have a 'conceptual content', is to be governed by a certain kind of inferential rules. The term was coined by Robert Brandom as a label for his theory of language; however, it is also naturally applicable (and is growing increasingly common) within the philosophy of logic.

In this paper, we evaluate Button’s claim that knot is a nasty connective. Knot’s nastiness is due to the fact that, when one extends the set \ with knot, the connective provides counterexamples to a number of classically valid operational rules in a sequent calculus proof system. We show that just as going non-transitive diminishes tonk’s nastiness, knot’s nastiness can also be reduced by dropping Reflexivity, a different structural rule. Since doing so restores all other rules in the system as (...) validity-preserving, we are inclined to conclude that there, knot is not that nasty. However, since motivating non-reflexivity is harder than motivating non-transitivity, we also acknowledge that disagreement with our conclusion is possible. (shrink)

ABSTRACTWe will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: or. We will show that it is possible to obtain a Tarskian logic with non-Tarskian inferential logics, but also a non-Tarskian logic with Tarskian inferential logics. Moreover, we will show how some of these metainferential logics work better than the corresponding inferential rivals. Finally, we will show how these logics prove that it is not enough to (...) work with inferences as pairs of sets of formulas to obtain a contractive logic. (shrink)

This paper aims to unite two seemingly disparate themes in the philosophy of mathematics and language respectively, namely ante rem structuralism and inferentialism. My analysis begins with describing both frameworks in accordance with their genesis in the work of Hilbert. I then draw comparisons between these philosophical views in terms of their similar motivations and similar objections to the referential orthodoxy. I specifically home in on two points of comparison, namely the role of norms and the relation of ontological dependence (...) in both accounts. Lastly, I show that insights from this purported connection can address certain objections to both theories respectively. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

A logical constant is weakly disharmonious if its elimination rules are weaker than its introduction rules. Substructural weak disharmony is the weak disharmony generated by structural restrictions on the eliminations. I argue that substructural weak disharmony is not a defect of the constants which exhibit it. To the extent that it is problematic, it calls into question the structural properties of the derivability relation. This prompts us to rethink the issue of controlling the structural properties of a logic by means (...) of harmony. I argue that such a control is possible and desirable. Moreover, it is best achieved by global tests of harmony. (shrink)

In philosophical logic and proof theory, we often find multiple-conclusion systems that induce a conjunctive reading of premises and a disjunctive reading of conclusions. In mathematical logic, in contrast, we often find multiple-conclusion systems that induce a conjunctive reading of both premises and conclusions. This paper studies some technical and philosophical aspects of this latter approach to multiple-conclusion consequence. The takeaway is that, while the importance of disjunctive multiple conclusions is beyond doubt, conjunctive multiple conclusions also have philosophical interest. First, (...) because there is some evidence that there are arguments with conjunctive multiple conclusions in natural language. Second, because conjunctive multiple conclusions are compatible with the reflexivity and transitivity of logical consequence, and this allows them to cohere better with some of our best accounts of what logical consequence is. (shrink)

Arguments, the story goes, have one or more premises and only one conclusion. A contentious generalisation allows arguments with several disjunctively connected conclusions. Contentious as this generalisation may be, I will argue nevertheless that it is justified. My main claim is that multiple conclusions are epiphenomena of the logical connectives: some connectives determine, in a certain sense, multiple-conclusion derivations. Therefore, such derivations are completely natural and can safely be used in proof-theoretic semantics.

I consider the phenomenon of conflation—treating distinct things as one—and develop logical tools for modeling it. These tools involve a purely consequence-theoretic treatment, independent of any proof or model theory, as well as a four-valued valuational treatment.

Is logic, feasibly, a product of natural selection? In this paper we treat this question as dependent upon the prior question of where logic is founded. After excluding other possibilities, we conclude that logic resides in our language, in the shape of inferential rules governing the logical vocabulary of the language. This means that knowledge of (the laws of) logic is inseparable from the possession of the logical constants they govern. In this sense, logic may be seen as a product (...) of natural selection: the emergence of logic requires the development of creatures who can wield structured languages of a specific complexity, and who are capable of putting the languages to use within specific discursive practices. (shrink)

According to Suszko’s Thesis, there are but two logical values, true and false. In this paper, R. Suszko’s, G. Malinowski’s, and M. Tsuji’s analyses of logical twovaluedness are critically discussed. Another analysis is presented, which favors a notion of a logical system as encompassing possibly more than one consequence relation. [A] fundamental problem concerning many-valuedness is to know what it really is. [13, p. 281].

Many logical systems are such that the addition of Prior's binary connective tonk to them leads to triviality, see [1, 8]. Since tonk is given by some introduction and elimination rules in natural deduction or sequent rules in Gentzen's sequent calculus, the unwanted effects of adding tonk show that some kind of restriction has to be imposed on the acceptable operational inferences rules, in particular if these rules are regarded as definitions of the operations concerned. In this paper, a number (...) of simple observations is made showing that the unwanted phenomenon exemplified by tonk in some logics also occurs in contexts in which tonk is acceptable. In fact, in any non-trivial context, the acceptance of arbitrary introduction rules for logical operations permits operations leading to triviality. Connectives that in all non-trivial contexts lead to triviality will be called non-trivially trivializing connectives. (shrink)

All through the literatura, the question about what is a logical constant has recieved many answers, from model-theoretic aproaches,, to answers that focus in the inferential practice as meaning,,. Detractors of the second tradition presented many ineludible incovenients, in particular, the logical constant named ‘tonk’. Inferentialist tryed many solutions, in particular they presented the concept of ‘harmony’. The goal of this paper is to show that the different criteria of ‘harmony’ used in the proof-theoretic semantics to determine what is and (...) what is not a logical constant fail to be necessary or sufficient. I will show the philosophical reasons that make this concept appear and then i will describe the different ways in wich the literatura understads the concept of ‘harmony’. Then I will show that they subgenerate or overgenerate connectives with some counterexamples. Finaly, I will explain some philosophical reasons that should delimitate where to go towards a satisfactory definition of ‘harmony’. (shrink)

Most literature on vagueness deals with the phenomenon as applied to predicates. On the contrary, even the idea of vague connectives seems to be taken as an oxymoron. The goal of this article is to propose an understanding of vague logical connectives based on vague quantifiers. The main idea is that the phenomenon of vagueness translates to connectives in terms of the property of Abnormality. I also argue that Prior’s Tonk can, according to this approach, be considered a vague connective. (...) In order to do so, I provide a sound and complete interpretation for it, based on Strict-Tolerant semantics, in which Tonk has a non-normal truth-table. (shrink)

There are still on-going debates on what exactly is wrong with Prior’s pathological “tonk.” In this article I argue, on the basis of categorical inferentialism, that two notions of inconsistency ought to be distinguished in an appropriate account of tonk; logic with tonk is inconsistent as the theory of propositions, and it is due to the fallacy of equivocation; in contrast to this diagnosis of the Prior’s tonk problem, nothing is actually wrong with tonk if logic is viewed as the (...) theory of proofs rather than propositions, and tonk perfectly makes sense in terms of the identity of proofs. Indeed, there is fully complete semantics of proofs for tonk, which allows us to link the Prior’s old philosophical idea with contemporary issues at the interface of categorical logic, computer science, and quantum physics, and thereby to expose commonalities between the laws of Reason and the laws of Nature, which are what logic and physics are respectively about. I conclude the article by articulating the ideas of categorical logical positivism and pluralistic unified science as its goal, including the unification of realist and antirealist conceptions of meaning by virtue of the categorical logical basis of metaphysics. (shrink)

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term (...) itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tübingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike. (shrink)

In this paper, I explore the possibility of applying the methods and results of Judgement Aggregation to the problem of logical disagreement. I develop and evaluate different ways in which individuals who logically disagree can generate a collective logic. I prove a version of the discursive paradox, where the majority voting of a group of structural logicians can give rise to a substructural logic; then I develop a more general impossibility result. After this, I analyze different ways to avoid the (...) paradox, in particular some methods which appeal to domain restrictions. Finally, I consider the application of these results to the discussion on semantic paradoxes. (shrink)