According to Jago (2014a), logical omniscience is really part of a deeper paradox. Jago develops an epistemic logic with principles of indeterminate closure to solve this paradox, but his official semantics is difficult to navigate, it is motivated in part by substantive metaphysics, and the logic is not axiomatized. In this paper, I simplify this epistemic logic by adapting the hyperintensional semantic framework of Sedlár (2021). My first goal is metaphysical neutrality. The solution to the epistemic paradox should not require (...) appeal to a metaphysics of truth-makers, situations, or impossible worlds, by contrast with Jago’s official semantics. My second goal is to elaborate on the proof theory. I show how to axiomatize a family of logics with principles of indeterminate epistemic closure. (shrink)

Neutralism is the broad view that philosophical progress can take place when (and sometimes only when) a thoroughly neutral, non-specific theory, treatment, or methodology is adopted. The broad goal here is to articulate a distinct, specific kind of sorites paradox (The Observational Sorites Paradox) and show that it can be effectively treated via Neutralism.

This article is a preliminary presentation of conjunctive paraconsistency, the claim that there might be non-explosive true contradictions, but contradictory propositions cannot be considered separately true. In case of true ‘p and not p’, the conjuncts must be held untrue, Simplification fails. The conjunctive approach is dual to non-adjunctive conceptions of inconsistency, informed by the idea that there might be cases in which a proposition is true and its negation is true too, but the conjunction is untrue, Adjunction fails. While (...) non-adjunctivism is a well-known option, the other view is not so much studied nowadays, but it was not unknown in the tradition, and there are some positive suggestions, in recent literature, that the position is plausible and deserves to be developed. The article compares conjunctivism, non-adjunctivism and dialetheism, then focuses on some possible justifications, costs and benefits of the conjunctive view. (shrink)

Acceptable analyticities, i.e. contradictions or tautologies, constitute problematic evidence for the idea that language includes a deductive system. In recent discussion, two accounts have been presented in the literature to explain the available evidence. According to one of the accounts, grammatical analyticities are accessible to the system but a pragmatic strengthening repair mechanism can apply and prevent the structures from being actually interpreted as contradictions or tautologies. The proposed data, however, leaves it open whether other versions of the meaning modulation (...) operation are required. Novel evidence we present argues that a loosening version of the repair mechanism must be available. Our observation concerns acceptable lexical contradictions that cannot be rescued if only a strengthening version of the pragmatic strategy is available. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, in which (...) the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)

We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this logic. The semantics is defined (...) in terms of a \-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints. (shrink)

Philosophical arguments usually are and nearly always should be abductive. Across many areas, philosophers are starting to recognize that often the best we can do in theorizing some phenomena is put forward our best overall account of it, warts and all. This is especially true in esoteric areas like logic, aesthetics, mathematics, and morality where the data to be explained is often based in our stubborn intuitions. -/- While this methodological shift is welcome, it's not without problems. Abductive arguments involve (...) significant theoretical resources which themselves can be part of what's being disputed. This means that we will sometimes find otherwise good arguments which suggest their own grounds are problematic. In particular, sometimes revising our beliefs on the basis of such an argument can undermine the very justification we used in that argument. -/- This feature, which I'll call self-effacingness, occurs most dramatically in arguments against our standing views on the esoteric subject matters mentioned above: logic, mathematics, aesthetics, and morality. This is because these subject matters all play a role in how we reason abductively. This isn't an idle fact; we can resist some challenges to our standing beliefs about these subject matters exactly because the challenges are self-effacing. The self-effacing character of certain arguments is thus both a benefit and limitation of the abductive turn and deserves serious attention. I aim to give it the attention it deserves. (shrink)

The paper presents an exhaustive menu of nonmonotonic logics. The options are individuated in terms of the principles they reject. I locate, e.g., cumulative logics and relevance logics on this menu. I highlight some frequently neglected options, and I argue that these neglected options are particularly attractive for inferentialists.

In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

Recently, several authors have pointed out that substructural logics are adequate for developing naive theories that represent semantic concepts such as truth. Among them, three proposals have been explored: dropping cut, dropping contraction and dropping reflexivity. However, nowhere in the substructural literature has anyone proposed rejecting the structural rule of weakening, while accepting the other rules. Some theorists have even argued that this task was not possible, since weakening plays no role in the derivation of semantic paradoxes. In this article, (...) I introduce a theory for naive truth based on the logic resulting from dropping the rule of weakening from classical logic, and maintaining the other structural rules. (shrink)

In recent years, some theorists have argued that the clogics are not only defined by their inferences, but also by their metainferences. In this sense, logics that coincide in their inferences, but not in their metainferences were considered to be different. In this vein, some metainferential logics have been developed, as logics with metainferences of any level, built as hierarchies over known logics, such as \, and \. What is distinctive of these metainferential logics is that they are mixed, i.e. (...) the standard for the premises and the conclusion is not necessarily the same. However, so far, all of these systems have been presented following a semantical standpoint, in terms of valuations based on the Strong Kleene truth-tables. In this article, we provide sound and complete sequent-calculi for the valid inferences and the invalid inferences of the logics \ and \, and introduce an algorithm that allows obtaining sound and complete sequent-calculi for the global validities and the global invalidities of any metainferential logic of any level. (shrink)

Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...) that it is hybrid, insofar as it includes both left and right operational introduction as well as elimination rules. (shrink)

The aim of this article is to discuss the extent to which certain substructural logics are related through the phenomenon of duality. Roughly speaking, metainferences are inferences between collect...

This article is concerned with an exploration of a family of systems—called immune logics—that arise from certain dualizations of the well-known family of infectious logics. The distinctive feature of the semantic of infectious logics is the presence of a certain “infectious” semantic value, by which two different though equivalent things are meant. On the one hand, it is meant that these values are zero elements for all the operations in the underlying algebraic structure. On the other hand, it is meant (...) that these values behave in a value-in-value-out fashion for all the operations in the underlying algebraic structure. Thus, in a rather informal manner, we will refer to immune logics as those systems whose underlying semantics count with a certain “immune” semantic value behaving in a way that is somewhat dual to that of the infectious values. In a more formal manner, carrying out this dualization will prove to be not as straightforward as one could imagine, since the two characterizations of infectiousness discussed above lead to two different outcomes when one tries to conduct them. We explore these alternatives and provide technical results regarding them, and the various logical systems defined using such semantics. (shrink)

The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive substructural logics. For this purpose we focus on the study cases of the logics _S__T_ and _T__S_. In this respect, we show that this notion doesn’t coincide, in general, with a nowadays broadly used semantic approach towards metainferential validity: the notion of local validity. Following this, and building on some previous work by Humberstone, we prove that in (...) these systems derivability can be characterized in terms of a notion we call absolute global validity. However, arriving at these results doesn’t lead us to disregard local validity. First, because we discuss the conditions under which local, and also global validity, can be expected to coincide with derivability. Secondly, because we show how taking into account certain families of valuations can be useful to describe derivability for different calculi used to present _S__T_ and _T__S_. (shrink)

Multidimensional adjectives are ubiquitous in natural language. An adjective F is multidimensional just in case whether F applies to an object or pair of objects depends on how those objects stand with respect to multiple underlying dimensions of F-ness. Developing a semantics for multidimensional adjectives requires us to address the problem of dimensional aggregation: how do the application conditions of an adjective F in its positive and comparative forms depend on its underlying dimensions? Here we develop a semantics for multidimensional (...) adjectives that incorporates aggregation functions. We then explore an analogy between dimensional aggregation and preference aggregation, bringing results from social choice theory to bear on the number and kind of aggregation functions that are admissible in a context. These results suggest that, for any given adjective, there will often be multiple aggregation functions admissible, meaning that multidimensional comparatives are often vague. (shrink)

The central thesis of JC Beall’s paraconsistent Christology is that Christ, being human and divine, is a contradictory being, and a rational Christology can accept it, since logic nowadays does not exclude the possibility of true contradictions. In this paper, I move from Beall’s theory and I present an alternative view. I quote seven statements of the so-called ‘Athanasian Creed’ which synthesizes the results of conciliar Christology. The aim of the Creed is to combat monophysitism by stressing the duplicity and (...) unity of Christ: two (incompatible) natures inseparably joined in only one person. I note that the two-in-one principle, so intended, may be seen as an ancestor of what has been called ‘conjunctive paraconsistency’, whereby there could be true contradictions but contradictories cannot be separately true. I specifically oppose this view to Beall’s idea of Christ’s human divinity (or divine humanity) as a glut, showing that in the conjunctive account, true contradictions do not require any overlapping or joint ascription of truth and falsity. (shrink)

Stratified properties such as ‘happy unhappiness’, ‘ungrounded ground’, ‘fortunate misfortune’, and evidently ‘true falsity’ may generate dialetheias (true contradictions). The aim of the article is to show that if this is the case, then we will have a special, conjunctive, kind of dialetheia: a true state description of the form ‘Fa and not Fa’ (for some property F and object a), wherein the two conjuncts, separately taken, are to be held untrue. The particular focus of the article is on happy (...) unhappiness: people suffering from (or enjoying) happy unhappiness (if there is some situation or state of mind of this kind) cannot be truly said ‘happy’ or ‘unhappy’, but we can say they are both. In the first section three cases of conjunctive stratification are presented; in the second section the logic of stratified contradictions is explored. The last section focuses on eudemonistic ascriptions: stated that a is happy to be unhappy (or unhappy to be happy), should we say a is happy? unhappy? both? neither? (shrink)

This essay introduces a novel framework to studying many-valued logics – the movable truth value (or MTV ) approach. After setting up the framework, we will show that a vast number of many-valued logics, and in particular many-valued logics that have previously been given very different kinds of semantics, including C, K3, LP, ST, TS, RM fde, and FDE, can all be unified within the MTV -logic approach. This alone is notable, since until now RM fde in particular has resisted (...) attempts to provide it with the _same kind_ of many-valued semantics as the other logics in this list. New proofs of the duality between LP and K3, and of the self-duality of C, ST, TS, and RM fde, are presented. The essay will conclude with a discussion of directions that further research might take. (shrink)

We extend the Embracing Revenge account of the semantic paradoxes by constructing two distinct consequence relations that reflect, in different ways, the transfinitely-many-valued semantics developed in earlier work. In particular, we adapt the underlying ideas of “gappy” approaches based on K3, and “glutty” approaches based on LP, to the Embracing Revenge framework, by treating the infinitely many non-classical truth values as infinitely many ways that a sentence might fail to receive a classical truth value in the former case, and as (...) infinitely many ways that a sentence might receive both classical truth values in the latter. In order to obtain deductive systems that are very nearly classical, we need to utilize different conditionals (and different negations) in each logic. (shrink)

The principle of tolerance characteristic of vague predicates is sometimes presented as a soft rule, namely as a default which we can use in ordinary reasoning, but which requires care in order to avoid paradoxes. We focus on two ways in which the tolerance principle can be modeled in that spirit, using special consequence relations. The first approach relates tolerant reasoning to nontransitive reasoning; the second relates tolerant reasoning to nonmonotonic reasoning. We compare the two approaches and examine three specific (...) consequence relations in relation to those, which we call: strict-to-tolerant entailment, pragmatic-to-tolerant entailment, and pragmatic-to-pragmatic entailment. The first two are nontransitive, whereas the latter two are nonmonotonic. (shrink)

In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a tolerant extension depending on an indifference relation associated to that predicate. Second, we can use (...) these notions of satisfaction to define mixed consequence relations that capture non-transitive tolerant reasoning. Although we gave some empirical motivation for the use of strict and tolerant extensions, making use of them commits us to the view that sentences of the form ‘ p∨¬p ’ and ‘ p∧¬p ’ are not automatically valid or unsatisfiable, respectively. Some philosophers might take this commitment as a negative outcome of our previous proposal. We think, however, that the general ideas underlying our previous approach to vagueness can be implemented in a variety of ways. This paper explores the possibility of defining mixed notions of consequence in the more classical super/sub-valuationist setting and examines to what extent any of these notions captures non-transitive tolerant reasoning. (shrink)

This paper presents and defends a way to add a transparent truth predicate to classical logic, such that and A are everywhere intersubstitutable, where all T-biconditionals hold, and where truth can be made compositional. A key feature of our framework, called STTT (for Strict-Tolerant Transparent Truth), is that it supports a non-transitive relation of consequence. At the same time, it can be seen that the only failures of transitivity STTT allows for arise in paradoxical cases.

Recent experiments have shown that naive speakers find borderline contradictions involving vague predicates acceptable. In Cobreros et al. we proposed a pragmatic explanation of the acceptability of borderline contradictions, building on a three-valued semantics. In a reply, Alxatib et al. show, however, that the pragmatic account predicts the wrong interpretations for some examples involving disjunction, and propose as a remedy a semantic analysis instead, based on fuzzy logic. In this paper we provide an explicit global pragmatic interpretation rule, based on (...) a somewhat richer semantics, and show that with its help the problem can be overcome in pragmatics after all. Furthermore, we use this pragmatic interpretation rule to define a new consequence-relation and discuss some of its properties. (shrink)

Arguments based on Leibniz's Law seem to show that there is no room for either indefinite or contingent identity. The arguments seem to prove too much, but their conclusion is hard to resist if we want to keep Leibniz's Law. We present a novel approach to this issue, based on an appropriate modification of the notion of logical consequence.

In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and (...) argue that while ST+’s nonclassicality can be granted, its self-dual character does not tie it to LP+ more closely than to K3+. (shrink)

Arguments based on Leibniz's Law seem to show that there is no room for either indefinite or contingent identity. The arguments seem to prove too much, but their conclusion is hard to resist if we want to keep Leibniz's Law. We present a novel approach to this issue, based on an appropriate modification of the notion of logical consequence.

Building on early work by Girard ( 1987 ) and using closely related techniques from the proof theory of many-valued logics, we propose a sequent calculus capturing a hierarchy of notions of satisfaction based on the Strong Kleene matrices introduced by Barrio et al. (Journal of Philosophical Logic 49:93–120, 2020 ) and others. The calculus allows one to establish and generalize in a very natural manner several recent results, such as the coincidence of some of these notions with their classical (...) counterparts, and the possibility of expressing some notions of satisfaction for higher-level inferences using notions of satisfaction for inferences of lower level. We also show that at each level all notions of satisfaction considered are pairwise distinct and we address some remarks on the possible significance of this (huge) number of notions of consequence. (shrink)

Substructural approaches to paradoxes have attracted much attention from the philosophical community in the last decade. In this paper we focus on two substructural logics, named ST and TS, along with two structural cousins, LP and K3. It is well known that LP and K3 are duals in the sense that an inference is valid in one logic just in case the contrapositive is valid in the other logic. As a consequence of this duality, theories based on either logic are (...) tightly connected since many of the arguments for and objections against one theory reappear in the other theory in dual form. The target of the paper is making explicit in exactly what way, if any, ST and TS are dual to one another. The connection will allow us to gain a more fine-grained understanding of these logics and of the theories based on them. In particular, we will obtain new insights on two questions concerning ST which are being intensively discussed in the current literature: whether ST preserves classical logic and whether it is LP in sheep’s clothing. Explaining in what way ST and TS are duals requires comparing these logics at a metainferential level. We provide to this end a uniform proof theory to decide on valid metainferences for each of the four logics. This proof procedure allows us to show in a very simple way how different properties of inferences (unsatisfiability, supersatisfiability and antivalidity) that behave in very different ways for each logic can be captured in terms of the validity of a metainference. (shrink)

This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.

Suszko’s problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski’s structural constraints are relaxed. By so doing, Malinowski introduced a case of so-called mixed consequence, allowing the notion of a designated value to vary between the premises and the conclusions of an argument. (...) In this article we give a more systematic perspective on Suszko’s problem and on mixed consequence. First, we prove general representation theorems relating structural properties of a consequence relation to their semantic interpretation, uncovering the semantic counterpart of substitution-invariance, and establishing that mixed consequence is fundamentally the semantic counterpart of the structural property of monotonicity. We use those theorems to derive maximum-rank results proved recently in a different setting by French and Ripley, as well as by Blasio, Marcos, and Wansing, for logics with various structural properties. We strengthen these results into exact rank results for nonpermeable logics. We discuss the underlying notion of rank, and the associated reduction proposed independently by Scott and Suszko. As emphasized by Suszko, that reduction fails to preserve compositionality in general, meaning that the resulting semantics is no longer truth-functional. We propose a modification of that notion of reduction, allowing us to prove that over compact logics with what we call regular connectives, rank results are maintained even if we request the preservation of truth-functionality and additional semantic properties. (shrink)

We generalize Ripley’s results on the transitivity of consequence relation, without assuming a logic to be monotonic. Following Gabbay, we assume nonmonotonic consequence relation to be inclusive and cautious monotonic, and figure out the implications between different forms of transitivity of logical consequence. Weaker frameworks without inclusiveness or cautious monotonicity are also discussed. The paper may provide basis for the study of both non-transitive logics and nonmonotonic ones.

Given a consequence relation in many-valued logic, what connectives can be defined? For instance, does there always exist a conditional operator internalizing the consequence relation, and which form should it take? In this paper, we pose this question in a multi-premise multi-conclusion setting for the class of so-called intersective mixed consequence relations, which extends the class of Tarskian relations. Using computer-aided methods, we answer extensively for 3-valued and 4-valued logics, focusing not only on conditional operators, but also on what we (...) call Gentzen-regular connectives. For arbitrary N-valued logics, we state necessary and sufficient conditions for the existence of such connectives in a multi-premise multi-conclusion setting. The results show that mixed consequence relations admit all classical connectives, and among them pure consequence relations are those that admit no other Gentzen-regular connectives. Conditionals can also be found for a broader class of intersective mixed consequence relations, but with the exclusion of order-theoretic consequence relations. (shrink)

Philosophy and Phenomenological Research, EarlyView.

This paper gives a novel analysis of the logical structure underlying three classes of vague adjectival predicates (relative adjectives, i.e., tall; total adjectives, i.e., straight; and partial adjectives, i.e., wet) and the realisation of this structure in arguments formed with comparative constructions (i.e., John is taller than Mary). I analyse three classes of valid arguments that can be formed with different types of gradable predicates in comparative constructions: scalarity arguments (i.e., Mary is taller than John and John is tall Mary (...) is tall), maximality arguments (i.e., Stick A is straighter than Stick B Stick B is not straight), and evaluativity arguments (i.e., This towel is wetter than that towel this towel is wet) I show how a previously proposed multi-valued logical system (called Delineation TCS; see Burnett, 2012b; Burnett, 2013) based on the trivalent framework of (Cobreros et al., 2012) can be used to model the reasoning patterns described in the paper. In this system, we derive the scalarity, maximality and evaluativity properties of different classes of adjectives from statements about the properties of cognitive indifference relations associated with these predicates. I therefore conclude that systems such as DelTCS give us valuable insight into the relationship between cognitive judgements of indifference and reasoning patterns with scalar terms. (shrink)

The paper presents both new data and a new analysis of the semantic and pragmatic properties of the class of absolute scalar adjectives within an extension of a well-known logical framework for the analysis of gradable predicates: the delineation semantics framework . It has been long observed that the context-sensitivity, vagueness and gradability features of absolute scalar predicates give rise to certain puzzles for their analysis within most, if not all, modern formal semantic frameworks. While there exist proposals for solving (...) these puzzles within other major frameworks , it has been argued that some of their aspects are particularly challenging for the analysis of absolute scalar predicates within the delineation approach. By combining insights into the relationship between context-sensitivity and scalarity from the DelS framework with insights into the relationship between tolerance/similarity relations and the Sorites paradox from Cobreros et al.’s Tolerant, Classical, Strict framework, I propose a new logical system, called Delineation TCS , in which to set analyses of four classes of adjectival predicates. I argue that this new framework allows for an analysis of absolute scalar adjectives that answers these challenges for delineation-based frameworks, while still preserving the heart of the Klein-ian approach. (shrink)

Semantic and soritical paradoxes display remarkable family resemblances. For one thing, several non-classical logics have been independently applied to both kinds of paradoxes. For another, revenge paradoxes and higher-order vagueness—among the most serious problems targeting solutions to semantic and soritical paradoxes—exhibit a rather similar dynamics. Some authors have taken these facts to suggest that truth and vagueness require a unified logical framework, or perhaps that the truth predicate is itself vague. However, a common core of semantic and soritical paradoxes has (...) not been identified yet, and no explanation of their relationships has been provided. Here we aim at filling this lacuna, in the framework of many-valued logics. We provide a unified diagnosis of semantic and soritical paradoxes, identifying their source in a general form of indiscernibility. We then develop our diagnosis into a theory of paradoxicality, which formalizes both semantic and soritical paradoxes as arguments involving specific instances of our generalized indiscernibility principle, and correctly predicts which logics can non-trivially solve them. (shrink)

Intuitionistic logic provides an elegant solution to the Sorites Paradox. Its acceptance has been hampered by two factors. First, the lack of an accepted semantics for languages containing vague terms has led even philosophers sympathetic to intuitionism to complain that no explanation has been given of why intuitionistic logic is the correct logic for such languages. Second, switching from classical to intuitionistic logic, while it may help with the Sorites, does not appear to offer any advantages when dealing with the (...) so-called paradoxes of higher-order vagueness. We offer a proposal that makes strides on both issues. We argue that the intuitionist’s characteristic rejection of any third alethic value alongside true and false is best elaborated by taking the normal modal system S4M to be the sentential logic of the operator ‘it is clearly the case that’. S4M opens the way to an account of higher-order vagueness which avoids the paradoxes that have been thought to infect the notion. S4M is one of the modal counterparts of the intuitionistic sentential calculus and we use this fact to explain why IPC is the correct sentential logic to use when reasoning with vague statements. We also show that our key results go through in an intuitionistic version of S4M. Finally, we deploy our analysis to reply to Timothy Williamson’s objections to intuitionistic treatments of vagueness. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

When used next to a predicate at the extreme of a scale such as perfect, the exclusive modifiers just and simply convey a distinctive intensifying effect, presenting a puzzle for theories of exclusivity and alternative-based meanings more broadly. In this article, I develop an analysis of these modifiers as a special kind of alternative-targeting operator, whereby the speaker signals that more specific descriptions than the one they just asserted—modeled here as granularity-based alternatives—are not assertion-worthy in the context—i.e., they need not (...) be asserted in order for a complete representation of the facts to be provided. On this analysis, the intensifying effect of these modifiers are derived from the interaction of exclusivity, granularity, and the distinctive semantic properties of predicates denoting the extreme of a scalar extreme. More broadly, the proposal affords a jumping-off point for further work exploring the interaction between scalarity and exclusive operators, highlighting a number of intriguing lines of future research across semantics and pragmatics. (shrink)

Weber, Colyvan, and Priest have advanced glutty approaches to the sorites, on which the truth about the penumbral region of a soritical series is inconsistent. The major benefit of a glut-based approach is maintaining the truth of all sorites premisses while none the less avoiding, in a principled fashion, the absurdity of the sorites conclusion. I agree that this is a major virtue of the target glutty approach; however, I think that it can be had without gluts. If correct, this (...) result weighs heavily against the proposed glutty approach, at least given the default-consistency principle that all target glutty philosophers accept: posit gluts only if there is no consistent theory that enjoys the same virtues as the would-be glutty solution. (shrink)

It is widely accepted that classical logic is trivialized in the presence of a transparent truth-predicate. In this paper, we will explain why this point of view must be given up. The hierarchy of metainferential logics defined in Barrio et al. and Pailos recovers classical logic, either in the sense that every classical inferential validity is valid at some point in the hierarchy ), or because a logic of a transfinite level defined in terms of the hierarchy shares its validities (...) with classical logic. Each of these logics is consistent with transparent truth—as is shown in Pailos —, and this suggests that, contrary to standard opinions, transparent truth is after all consistent with classical logic. However, Scambler presents a major challenge to this approach. He argues that this hierarchy cannot be identified with classical logic in any way, because it recovers no classical antivalidities. We embrace Scambler’s challenge and develop a new logic based on these hierarchies. This logic recovers both every classical validity and every classical antivalidity. Moreover, we will follow the same strategy and show that contingencies need also be taken into account, and that none of the logics so far presented is enough to capture classical contingencies. Then, we will develop a multi-standard approach to elaborate a new logic that captures not only every classical validity, but also every classical antivalidity and contingency. As a€truth-predicate can be added to this logic, this result can be interpreted as showing that, despite the claims that are extremely widely accepted, classical logic does not trivialize in the context of transparent truth. (shrink)

Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egré, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences validated by this (...) logic. In this paper, we show that this logic, once it is adequately understood, is weaker than classical logic. Moreover, the logic is in a way similar to the paraconsistent logic LP. (shrink)

On some accounts of vagueness, predicates like “is a heap” are tolerant. That is, their correct application tolerates sufficiently small changes in the objects to which they are applied. Of course, such views face the sorites paradox, and various solutions have been proposed. One proposed solution involves banning repeated appeals to tolerance, while affirming tolerance in any individual case. In effect, this solution rejects the reasoning of the sorites argument. This paper discusses a thorny problem afflicting this approach to vagueness. (...) In particular, it is shown that, on the foregoing view, whether an object is a heap will sometimes depend on factors extrinsic to that object, such as whether its components came from other heaps. More generally, the paper raises the issue of how to count heaps in a tolerance-friendly framework. (shrink)

When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in a clear (...) sense, non-identical to it. We argue that this phenomenon can be generalized, given the existence of logics which coincide with Classical Logic regarding a number of metainferential levels—although they are, again, clearly different systems. We claim this highlights the need to arrive at a more refined version of the Collapse Argument, which we discuss at the end of the paper. (shrink)