Timothy Smiley’s wonderful paper ‘Rejection’ (1996) is still perhaps not as well known or well understood as it should be. This note first gives a quick presentation of themes from that paper, though done in our own way, and then considers a putative line of objection – recently advanced by Julien Murzi and Ole Hjortland (2009) – to one of Smiley’s key claims. Along the way, we consider the prospects for an intuitionistic approach to some of the issues discussed in (...) Smiley’s paper. (shrink)

This paper discusses the philosophical and logical motivations for rejectivism, primarily by considering a dialogical approach to logic, which is formalized in a Question–Answer Semantics. We develop a generalized account of rejectivism through close consideration of Mark Textor's arguments against rejectivism that the negative expression ‘No’ is never used as an act of rejection and is equivalent with a negative sentence. In doing so, we also shed light upon well-known issues regarding the supposed non-embeddability and non-iterability of force indicators.

Stephen Read presented harmonious inference rules for identity in classical predicate logic. I demonstrate here how this approach can be generalised to a setting where predicate logic has been extended with epistemic modals. In such a setting, identity has two uses. A rigid one, where the identity of two referents is preserved under epistemic possibility, and a non-rigid one where two identical referents may differ under epistemic modality. I give rules for both uses. Formally, I extend Quantified Epistemic Multilateral Logic (...) with two identity signs. I argue that a uniform meaning for identity tout court can be given by adopting Maria Aloni’s account of reference using conceptual covers. We obtain a harmonious set of rules for identity that is sound and complete for Aloni’s model theory. (shrink)

Natural language does not express all connectives definable in classical logic as simple lexical items. Coordination in English is expressed by conjunction and, disjunction or, and negated disjunction nor. Other languages pattern similarly. Non-lexicalized connectives are typically expressed compositionally: in English, negated conjunction is typically expressed by combining negation and conjunction (not both). This is surprising: if $$\wedge $$ ∧ and $$\vee $$ ∨ are duals, and the negation of the latter can be expressed lexically (nor), why not the negation (...) of the former? I present a two-tiered model of the semantics of the binary connectives. The first tier captures the expressive power of the lexicon: it is a bilateral state-based semantics that, under a restriction, can express all and only the distinctions that can be expressed by the lexicon of natural language (and, or, nor). This first tier is characterized by rejection as non-assertion and a Neglect Zero assumption. The second tier is obtained by dropping the Neglect Zero assumption and enforcing a stronger notion of rejection, thereby recovering classical logic and thus definitions for all Boolean connectives. On the two-tiered model, we distinguish the limited expressive resources of the lexicon and the greater combinatorial expressive power of the language as a whole. This gives us a logic-based account of compositionality for the Boolean fragment of the language. (shrink)

Should we explicate truth in terms of meaning, or meaning in terms of truth? Ramsey, Prior and Strawson all favoured the former approach: a statement is true if and only if things are as the speaker, in making the statement, states them to be; similarly, a belief is true if and only if things are as a thinker with that belief thereby believes them to be. I defend this explication of truth against a range of objections.Ramsey formalized this account of (...) truth as follows: B is true =df ∃P; in §i, I defend this formula against the late Peter Geach's objection that its right‐hand side is ill‐formed. Davidson held that Ramsey and co. had the whole matter back to front: on his view, we should explicate meaning in terms of truth, not vice versa. In §ii, I argue that Ramsey's approach opens the way to a more promising approach to semantic theorizing than Davidson's. Ramsey presents his formula as a definition of truth, apparently contradicting Tarski's theorem that truth is indefinable. In §iii, I show that the contradiction is only apparent: Tarski assumes that the Liar‐like inscription he uses to prove his theorem has a content, but Ramsey can and should reject that assumption. As I explain in §iv, versions of the Liar Paradox may be generated without making any assumptions about truth: paradox arises when the impredicativity that is found when a statement's content depends on the contents of a collection of statements to which it belongs turns pathological. Since they do not succeed in saying anything, such pathological utterances or inscriptions pose no threat to the laws of logic, when these are understood as universal principles about the ways things may be said or thought to be. There is, though, a call for rules by following which we can be sure that any conclusion deduced from true premisses is true, and hence says something. Such rules cannot be purely formal, but in §v I propose a system of them: this opens the way to the construction of deductive theories even in circumstances where producing a well‐formed formula is no guarantee of saying anything. (shrink)

The aim of this paper is to provide a philosophical interpretation of bilateralism in terms of probabilism. In particular, to interpret the main concepts of bilateralism –acceptance, rejection and incoherence– in terms of the probabilistic notions of degree of belief and coherence. According to bilateralism, the meaning of logical connectives is determined by the acceptance and rejection conditions of the sentences in which they are involved, where acceptance and rejection cannot be reduced to one another. I will focus on a (...) variant of bilateralism that understands logical consequence as the statement that it is incoherent to accept all the premises of a valid argument while rejecting all its conclusions. On the other hand, probabilism states that it is possible to interpret our degrees of belief in terms of probabilities. The aim of this work is then to interpret the concept of incoherence in terms of probability functions and determine when it is coherent to accept or to reject a proposition according to some threshold defined in terms of degrees of belief. To achieve this goal, we need both an interpretation of the concept of incoherence coined by the bilateralists as well as an interpretation of acceptance and rejection. I will show that a good interpretation of coherence in probabilistic terms can already be found in the literature. Then, I will give an interpretation of acceptance and rejection in terms of degrees of belief. In particular, I will show that it is possible to interpret these concepts in accordance with Locke’s thesis, the thesis that states that there is some threshold r such that if you believe some sentence in degree equal or higher than r you should accept it, without falling into epistemic paradoxes. (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)

At least since [Frege, 1960] and [Geach, 1965], there has been some consensus about the relation between negation, the speech act of denial, and the attitude of rejection: a denial, the consensus has had it, is the assertion of a negation, and a rejection is a belief in a negation. Recently, though, there have been notable deviations from this orthodox view. Rejectivists have maintained that negation is to be explained in terms of denial or rejection, rather than vice versa. Some (...) other theorists have maintained that negation is a separate phenomenon from denial, and that neither is to be explained in terms of the other. In this paper, I present and consider these heterodox theories of the relation between negation, denial, and rejection. (shrink)

Natural deduction with alternatives extends Gentzen–Prawitz-style natural deduction with a single structural addition: negatively signed assumptions, called alternatives. It is a mildly bilateralist, single-conclusion natural deduction proof system in which the connective rules are unmodi_ed from the usual Prawitz introduction and elimination rules — the extension is purely structural. This framework is general: it can be used for (1) classical logic, (2) relevant logic without distribution, (3) affine logic, and (4) linear logic, keeping the connective rules fixed, and varying purely (...) structural rules. The key result of this paper is that the two principles that introduce kinds of irrelevance to natural deduction proofs: (a) the rule of explosion (from a contradiction, anything follows); and (b) the structural rule of vacuous discharge; are shown to be two sides of a single coin, in the same way that they correspond to the structural rule of weakening in the sequent calculus. The paper also includes a discussion of assumption classes, and how they can play a role in treating additive connectives in substructural natural deduction. (shrink)

In the theory of meaning, it is common to contrast truth-conditional theories of meaning with theories which identify the meaning of an expression with its use. One rather exact version of the somewhat vague use-theoretic picture is the view that the standard rules of inference determine the meanings of logical constants. Often this idea also functions as a paradigm for more general use-theoretic approaches to meaning. In particular, the idea plays a key role in the anti-realist program of Dummett and (...) his followers. In the theory of truth, a key distinction now is made between substantial theories and minimalist or deflationist views. According to the former, truth is a genuine substantial property of the truth-bearers, whereas according to the latter, truth does not have any deeper essence, but all that can be said about truth is contained in T-sentences (sentences having the form: ‘P’ is true if and only if P). There is no necessary analytic connection between the above theories of meaning and truth, but they have nevertheless some connections. Realists often favour some kind of truth-conditional theory of meaning and a substantial theory of truth (in particular, the correspondence theory). Minimalists and deflationists on truth characteristically advocate the use theory of meaning (e.g. Horwich). Semantical anti-realism (e.g. Dummett, Prawitz) forms an interesting middle case: its starting point is the use theory of meaning, but it usually accepts a substantial view on truth, namely that truth is to be equated with verifiability or warranted assertability. When truth is so understood, it is also possible to accept the idea that meaning is closely related to truth-conditions, and hence the conflict between use theories and truth-conditional theories in a sense disappears in this view. (shrink)

In a recent paper, Barrio, Pailos and Szmuc (BPS) show that there are logics that have exactly the validities of classical logic up to arbitrarily high levels of inference. They suggest that a logic therefore must be identified by its valid inferences at every inferential level. However, Scambler shows that there are logics with all the validities of classical logic at every inferential level, but with no antivalidities at any inferential level. Scambler concludes that in order to identify a logic, (...) we at least need to look at the validities and the antivalidities of every inferential level. In this paper, I argue that this is still not enough to identify a logic. I apply BPS’s techniques in a super/sub-valuationist setting to construct a logic that has exactly the validities and antivalidities of classical logic at every inferential level. I argue that the resulting logic is nevertheless distinct from classical logic. (shrink)

This paper is dedicated to extending and adapting to modal logic the approach of fractional semantics to classical logic. This is a multi-valued semantics governed by pure proof-theoretic considerations, whose truth-values are the rational numbers in the closed interval $[0,1]$. Focusing on the modal logic K, the proposed methodology relies on three key components: bilateral sequent calculus, invertibility of the logical rules, and stability (proof-invariance). We show that our semantic analysis of K affords an informational refinement with respect to the (...) standard Kripkean semantics (a new proof of Dugundji’s theorem is a case in point) and it raises the prospect of a proof-theoretic semantics for modal logic. (shrink)

In a recent paper, under the auspices of an unorthodox variety of bilateralism, we introduced a new kind of proof-theoretic semantics for the base modal logic \(\mathbf{K}\), whose values lie in the closed interval \([0,1]\) of rational numbers [14]. In this paper, after clarifying our conception of bilateralism – dubbed “soft bilateralism” – we generalize the fractional method to encompass extensions and weakenings of \(\mathbf{K}\). Specifically, we introduce well-behaved hypersequent calculi for the deontic logic \(\mathbf{D}\) and the non-normal modal logics (...) \(\mathbf{E}\) and \(\mathbf{M}\) and thoroughly investigate their structural properties. (shrink)

_T__S_ is a logic that has no valid inferences. But, could there be a logic without valid metainferences? We will introduce _T__S_ _ω_, a logic without metainferential validities. Notwithstanding, _T__S_ _ω_ is not as empty—i.e., uninformative—as it gets, because it has many antivalidities. We will later introduce the two-standard logic [_T__S_ _ω_, _S__T_ _ω_ ], a logic without validities and antivalidities. Nevertheless, [_T__S_ _ω_, _S__T_ _ω_ ] is still informative, because it has many contingencies. The three-standard logic [ \(\mathbf {TS}_{\omega (...) }, \mathbf {ST}_{\omega }, [{\overline {\emptyset }}{\emptyset }, {\emptyset } {\overline {\emptyset }}]\) ] that we will further introduce, has no validities, no antivalidities and also no contingencies whatsoever. We will also present two more validity-empty logics. The first one has no supersatisfiabilities, unsatisfabilities and antivalidities ∗. The second one has no invalidities nor non-valid-nor-invalid (meta)inferences. All these considerations justify thinking of logics as, at least, three-standard entities, corresponding, respectively, to what someone who takes that logic as correct, accepts, rejects and suspends judgement about, just because those things are, respectively, validities, antivalidities and contingencies of that logic. Finally, we will present some consequences of this setting for the monism/pluralism/nihilism debate, and show how nihilism and monism, on one hand, and nihilism and pluralism, on the other hand, may reconcile—at least according to how Gillian Russell understands nihilism, and provide some general reasons for adopting a multi-standard approach to logics. (shrink)

We seek to trace how the assertion–rejection dichotomy arose, as well as in what forms it was realized in logical discourse. From this viewpoint, we observe the approaches to the concept of rejection by Łukasiewicz, Carnap, and Słupecki. We also explore the controversy between rejection and negation. Our main observation is that for a correct understanding of this dichotomy, it is necessary to distinguish between the object language and metalanguages of different levels.

It is sometimes held that rules of inference determine the meaning of the logical constants: the meaning of, say, conjunction is fully determined by either its introduction or its elimination rules, or both; similarly for the other connectives. In a recent paper, Panu Raatikainen (2008) argues that this view - call it logical inferentialism - is undermined by some "very little known" considerations by Carnap (1943) to the effect that "in a definite sense, it is not true that the standard (...) rules of inference" themselves suffice to "determine the meanings of [the] logical constants" (p. 2). In a nutshell, Carnap showed that the rules allow for non-normal interpretations of negation and disjunction. Raatikainen concludes that "no ordinary formalization of logic ... is sufficient to `fully formalize' all the essential properties of the logical constants" (ibid.). We suggest that this is a mistake. Pace Raatikainen, intuitionists like Dummett and Prawitz need not worry about Carnap's problem. And although bilateral solutions for classical inferentialists - as proposed by Timothy Smiley and Ian Rumfitt - seem inadequate, it is not excluded that classical inferentialists may be in a position to address the problem too. (shrink)

We cast doubts on the suggestion, recently made by Graham Priest, that glut theorists may express disagreement with the assertion of A by denying A. We show that, if denial is to serve as a means to express disagreement, it must be exclusive, in the sense of being correct only if what is denied is false only. Hence, it can’t be expressed in the glut theorist’s language, essentially for the same reasons why Boolean negation can’t be expressed in such a (...) language either. We then turn to an alternative proposal, recently defended by Beall (in Analysis 73(3):438–445, 2013; Rev Symb Log, 2014), for expressing truth and falsity only, and hence disagreement. According to this, the exclusive semantic status of A, that A is either true or false only, can be conveyed by adding to one’s theory a shrieking rule of the form A & ~A |- \bot, where \bot entails triviality. We argue, however, that the proposal doesn’t work either. The upshot is that glut theorists face a dilemma: they can either express denial, or disagreement, but not both. Along the way, we offer a bilateral logic of exclusive denial for glut theorists—an extension of the logic commonly called LP. (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)

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 PA and Zermelo’s quasi-categoricity (...) theorem for second-order ZFC—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 relation between the intentionality of states and attitudes which can miss their mark, such as belief and desire, and the intentionality of acts, states and attitudes which cannot miss their mark, such as the different types of knowledge and simple seeing? Two theories of the first type of intentionality, the theory of correctness conditions and the theory of satisfaction conditions, are compared. It is argued that knowledge always involves knowledge of formal objects such as facts and values, (...) that emotions are reactions to (apparently) known values and that beliefs are reactions to known or apparently known facts or to the objects of relational states. (shrink)

I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...) infinite, then the property of being a tautology is \Pi^1_1-complete. But third, it is only granted the assumption of countability that the class of tautologies is \Sigma_1-definable in set theory. -/- Wittgenstein famously urges that logical relationships must show themselves in the structure of signs. He also urges that the size of the universe cannot be prejudged. The results of this paper indicate that there is no single way in which logical relationships could be held to make themselves manifest in signs, which does not prejudge the number of objects. (shrink)

Rejectivism is one of the most influential embodiments of pragmatism within contemporary philosophy of logic, advancing an explanation of the meaning of a logical notion, negation, in terms of the speech act of denial. This paper offers a challenge to rejectivism by proposing that in virtue of explaining negation in terms of denial, the rejectivist ought to be able to explain the concept of contradiction partially in terms of denial. It is argued that any failure to achieve this constitutes an (...) explanatory failure on the part of rejectivism, and reasons are then provided to doubt that the challenge can be successfully met. (shrink)

Is linguistic understanding a form of knowledge? I clarify the question and then consider two natural forms a positive answer might take. I argue that, although some recent arguments fail to decide the issue, neither positive answer should be accepted. The aim is not yet to foreclose on the view that linguistic understanding is a form of knowledge, but to develop desiderata on a satisfactory successor to the two natural views rejected here.

Most dialectical models view argumentation as a process of critically testing a standpoint. Further, they assume that what we critically test can be analytically reduced to individual and bi-polar standpoints. I argue that these two assumptions lead to the dominant view of dialectics as a bi-partisan argumentative discussion in which the yes-side argues against the doubter or the no-side. I scrutinise this binary orientation in understanding argumentation by drawing on the main tenets of normative pragmatic and pragma-dialectical theories of argumentation. (...) I develop my argument by showing how argumentative practice challenges these assumptions. I then lay out theoretical reasons for this challenge. This paves the way for an enhanced conceptualisation of dialectical models and their standards of rationality in terms of multi-party discussions, or argumentative polylogues. (shrink)

Most dialectical models view argumentation as a process of critically testing a standpoint. Further, they assume that what we critically test can be analytically reduced to individual and bi-polar standpoints. I argue that these two assumptions lead to the dominant view of dialectics as a bi-partisan argumentative discussion in which the yes-side argues against the doubter or the no-side. I scrutinise this binary orientation in understanding argumentation by drawing on the main tenets of normative pragmatic and pragma-dialectical theories of argumentation. (...) I develop my argument by showing how argumentative practice challenges these assumptions. I then lay out theoretical reasons for this challenge. This paves the way for an enhanced conceptualisation of dialectical models and their standards of rationality in terms of multi-party discussions, or argumentative polylogues. (shrink)

The focus of this paper are Dummett's meaning-theoretical arguments against classical logic based on consideration about the meaning of negation. Using Dummettian principles, I shall outline three such arguments, of increasing strength, and show that they are unsuccessful by giving responses to each argument on behalf of the classical logician. What is crucial is that in responding to these arguments a classicist need not challenge any of the basic assumptions of Dummett's outlook on the theory of meaning. In particular, I (...) shall grant Dummett his general bias towards verificationism, encapsulated in the slogan 'meaning is use'. The second general assumption I see no need to question is Dummett's particular breed of molecularism. Some of Dummett's assumptions will have to be given up, if classical logic is to be vindicated in his meaning-theoretical framework. A major result of this paper will be that the meaning of negation cannot be defined by rules of inference in the Dummettian framework. (shrink)

The paper argues that the theory of Implicit Definition cannot give an account of knowledge of logical principles. According to this theory, the meanings of certain expressions are determined such that they make certain principles containing them true; this is supposed to explain our knowledge of the principles as derived from our knowledge of what the expressions mean. The paper argues that this explanation succeeds only if Implicit Definition can account for our understanding of the logical constants, and that fully (...) understanding a logical constant in turn requires the ability to apply it correctly in particular cases. It is shown, however, that Implicit Definition cannot account for this ability, even if it draws on introduction rules for the logical constants. In particular, Implicit Definition cannot account for our ability to apply negation in particular cases. Owing to constraints relating to the unique characterisation of logical constants, invoking the notion of rejection does not remedy the situation. Given its failure to explain knowledge of logic, the prospects of Implicit Definition to explain other kinds of a priori knowledge are even worse. (shrink)

This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett’s and Dag Prawitz’ philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural deduction. I point out a problem for defining the meaning of negation in this framework and prospects for an account of the meanings of (...) modal operators in terms of rules of inference. (shrink)

In bilateral logic formulas are signed by + and –, indicating the speech acts assertion and denial. I argue that making an assumption is also speech act. Speech acts cannot be embedded within other speech acts. Hence we cannot make sense of the notion of making an assumption in bilateral logic. Attempts to solve this problem are considered and rejected.

Ian Rumfitt has proposed systems of bilateral logic for primitive speech acts of assertion and denial, with the purpose of ‘exploring the possibility of specifying the classically intended senses for the connectives in terms of their deductive use’ : 810f). Rumfitt formalises two systems of bilateral logic and gives two arguments for their classical nature. I assess both arguments and conclude that only one system satisfies the meaning-theoretical requirements Rumfitt imposes in his arguments. I then formalise an intuitionist system of (...) bilateral logic which also meets those requirements. Thus Rumfitt cannot claim that only classical bilateral rules of inference succeed in imparting a coherent sense onto the connectives. My system can be extended to classical logic by adding the intuitionistically unacceptable half of a structural rule Rumfitt uses to codify the relation between assertion and denial. Thus there is a clear sense in which, in the bilateral framework, the difference between classicism and intuitionism is not one of the rules of inference governing negation, but rather one of the relation between assertion and denial. (shrink)

This paper considers whether incompatibilism, the view that negation is to be explained in terms of a primitive notion of incompatibility, and Fregeanism, the view that arithmetical truths are analytic according to Frege’s definition of that term in §3 of Foundations of Arithmetic, can both be upheld simultaneously. Both views are attractive on their own right, in particular for a certain empiricist mind-set. They promise to account for two philosophical puzzling phenomena: the problem of negative truth and the problem of (...) epistemic access to numbers. For an incompatibilist, proofs of numerical non-identities must appeal to primitive incompatibilities. I argue that no analytic primitive incompatibilities are forthcoming. Hence incompatibilists cannot be Fregeans. (shrink)

Lecture notes from Husserl's logic lectures published during the last 20 years offer a much better insight into his doctrine of the forms of meaning than does the fourth Logical Investigation or any other work published during Husserl's lifetime. This paper provides a detailed reconstruction, based on all the sources now available, of Husserl's system of logical grammar. After having explained the notion of meaning that Husserl assumes in his later logic lectures as well as the notion of form of (...) meaning as it features in ‘doctrine of the forms of meaning’, I present a system of rules that describes all the various forms of meaning that Husserl singles out in his lectures. (shrink)

Our linguistic communication is, in part, the exchange of truths. It is an empirical fact that in daily conversation we aim at truths, not falsehoods. This fact may lead us to assume that ordinary, assertion-based communication is the only possible communicative system for truth-apt information exchange, or at least has priority over any alternatives. This assumption is underwritten in three traditional doctrines: that assertion is a basic notion, in terms of which we define denial; that to predicate truth of a (...) sentence is to assert the content it expresses; and that one should, in the context of radical interpretation, try to maximize the truth of what foreigners believe or utter. However, I challenge this assumption via a thought experiment: imagine a language game in which everyone aims to exchange only falsehoods. I argue that information exchange is possible in this game, and so truth-guided communication and falsity-guided communication are conceptually on a par. As a consequence, we should reject the three doctrines, based as they are on the conceptual priority of assertion-based communication. (shrink)

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible operators, only few appear in the lexicon of natural languages: the connectives in English, for example, are conjunction _and_, disjunction _or_, and negated disjunction _nor_; the lexical quantifiers are _all, some_ and _no_. The logically possible nand (negated conjunction) and Nall (negated universal) are not expressed by lexical entries in English, nor in any natural language. Moreover, (...) the lexicalized operators are all upward or downward monotone, an observation known as the Monotonicity Universal. We propose a logical explanation of lexical gaps and of the Monotonicity Universal, based on the dynamic behaviour of connectives and quantifiers. We define update potentials for logical operators as procedures to modify the context, under the assumption that an update by \( \phi \) depends on the logical form of \( \phi \) and on the speech act performed: assertion or rejection. We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. Finally, we show that on this framework the Monotonicity Universal follows from the logical properties of the updates that correspond to each operator. (shrink)

We present an inferentialist account of the epistemic modal operator might. Our starting point is the bilateralist programme. A bilateralist explains the operator not in terms of the speech act of rejection ; we explain the operator might in terms of weak assertion, a speech act whose existence we argue for on the basis of linguistic evidence. We show that our account of might provides a solution to certain well-known puzzles about the semantics of modal vocabulary whilst retaining classical logic. (...) This demonstrates that an inferentialist approach to meaning can be successfully extended beyond the core logical constants. (shrink)

ABSTRACTLinguistic evidence supports the claim that certain, weak rejections are less specific than assertions. On the basis of this evidence, it has been argued that rejected sentences cannot be premisses and conclusions in inferences. We give examples of inferences with weakly rejected sentences as premisses and conclusions. We then propose a logic of weak rejection which accounts for the relevant phenomena and is motivated by principles of coherence in dialogue. We give a semantics for which this logic is sound and (...) complete, show that it axiomatizes the modal logic KD45 and prove that it still derives classical logic on its asserted fragment. Finally, we defend previous logics of strong rejection as being about the linguistically preferred interpretations of weak rejections. (shrink)

Many classically valid meta-inferences fail in a standard supervaluationist framework. This allegedly prevents supervaluationism from offering an account of good deductive reasoning. We provide a proof system for supervaluationist logic which includes supervaluationistically acceptable versions of the classical meta-inferences. The proof system emerges naturally by thinking of truth as licensing assertion, falsity as licensing negative assertion and lack of truth-value as licensing rejection and weak assertion. Moreover, the proof system respects well-known criteria for the admissibility of inference rules. Thus, supervaluationists (...) can provide an account of good deductive reasoning. Our proof system moreover brings to light how one can revise the standard supervaluationist framework to make room for higher-order vagueness. We prove that the resulting logic is sound and complete with respect to the consequence relation that preserves truth in a model of the non-normal modal logic _NT_. Finally, we extend our approach to a first-order setting and show that supervaluationism can treat vagueness in the same way at every order. The failure of conditional proof and other meta-inferences is a crucial ingredient in this treatment and hence should be embraced, not lamented. (shrink)

We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework developed provides the (...) basis for a novel, proof-theoretic approach to the study of epistemic modality. To demonstrate the fruitfulness of the approach, we show how the framework allows us to reconcile classical logic with the contradictoriness of so-called Yalcin sentences and to distinguish between various inference patterns on the basis of the epistemic properties they preserve. (shrink)

Some bilateralists have suggested that some of our negative answers to yes-or-no questions are cases of rejection. Mark Textor (2011. Is ‘no’ a force-indicator? No! Analysis 71: 448–56) has recently argued that this suggestion falls prey to a version of the Frege-Geach problem. This note reviews Textor's objection and shows why it fails. We conclude with some brief remarks concerning where we think that future attacks on bilateralism should be directed.

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)

P.F. Strawson contributed to many philosophical domains, including the philosophy of language, the history of philosophy, metaphysics, moral philosophy and philosophical methodology. Most of his contributions in these areas have influenced contemporary debates, either because his views are still defended or because they are still considered worthy of detailed responses. His views on the philosophy of logic have been only rarely discussed, however. My aim in this paper is threefold. First, I provide a systematic account of Strawson’s philosophy of logic. (...) I argue that Strawson is an important predecessor of logical expressivism, a contemporary position in the philosophy of logic most notably defended by Robert Brandom. My main focus is on Strawson’s largely-neglected 1982 paper ‘Logical Form and Logical Constants’, which contains his most mature ideas on the topic. Second, while Strawson’s position is of historical and independent philosophical interest, I argue that he leaves many points unclear. Finally, I propose several clarifications of Strawson’s position. (shrink)

Negation, denial and falsity lie at the heart of debates about logic. We set out the classical account of the relationship between negation and denial, owing to Frege and Geach. We then challenge this on the basis that it does not permit an adequate account of falsity. A dialetheic alternative is minuted and criticised before a novel rejectivist account is proposed according to which falsity is the aim of the speech‐act of denial, whilst negation embeds deniability into assertoric contexts.

In this paper I defend an account of the nature of propositional content according to which the proposition expressed by a declarative sentence is a certain type of action a speaker performs in uttering that sentence. On this view, the semantic contents of proper names turn out to be types of reference acts. By carefully individuating these types, it is possible to provide new solutions to Frege’s puzzles about names in identity- and belief-sentences.

Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics (B-eS). This semantics is given by a relation called support, explaining the meaning of the logical constants, which is parameterized by systems of rules called bases that provide the semantics of atomic propositions. In this paper, we interpret bases as collections of definite formulae and use (...) the operational view of them as provided by uniform proof-search—the proof-theoretic foundation of logic programming (LP)—to establish the completeness of IPL for the B-eS. This perspective allows negation, a subtle issue in P-tS, to be understood in terms of the negation-as-failure protocol in LP. Specifically, while the denial of a proposition is traditionally understood as the assertion of its negation, in B-eS we may understand the denial of a proposition as the failure to find a proof of it. In this way, assertion and denial are both prime concepts in P-tS. (shrink)

Philosophy and Phenomenological Research, EarlyView.