Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises the question whether there are (...) three-valued logics for which there is a shorter translation into S5. The answer is affirmative: we present an elegant linear translation of the Logic of Paradox and of Strong Three-valued Logic into S5. (shrink)

The present paper attempts to provide an exact truthmaker semantical analysis of modalized propositions. According to the present proposal, an exact truthmaker for “Necessarily _P_” is a state that bans every exact truthmaker for “Not _P_”, and an exact truthmaker for “Possibly _P_” is a state that allows an exact truthmaker for _P_. Based on this proposal, a formal semantics will be developed; and the soundness and completeness results for a well-known family of the systems of normal modal propositional logic (...) will be established. It shall be seen that the present analysis offers an exactification of the standard Kripke semantics in the sense that it analyzes the accessibility relation between possible worlds in terms of the banning and allowing relations between the constituent states, and thereby gives an account of “truth at a possible world” in terms of exact truthmaking. (shrink)

Agent relativists about vagueness (henceforth ‘agent relativists’) hold that whether or not an object x falls in the extension of a vague predicate ‘P’ at a time t depends on the judgemental dispositions of a particular competent agent at t. My aim in this paper is to critically examine arguments that purport to support agent relativism by appealing to data from forced-march Sorites experiments. The most simple and direct versions of such forced-march Sorites arguments rest on the following (implicit) premise: (...) If competent speakers' judgements vary in a certain way, then the extensions of ‘P’ as used by these speakers must vary in the same way. This premise is in need of independent support, since otherwise opponents of agent relativism can simply reject it. In this paper, I focus on the idea that one cannot plausibly reject this premise, as that would commit one to implausible claims about linguistic competence. Against this, I argue that one can accommodate the data from forced-march Sorites experiments in a way that is compatible with a plausible picture of linguistic competence, without going agent relativist. Thus, there is reason to be sceptical of the idea that such data paired with considerations about linguistic competence can be invoked in order to lend any solid support to agent relativism. Forced-march Sorites arguments of this kind can, and should be, resisted. (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)

This paper develops the idea that valid arguments are equivalent to true conditionals by combining Kripke’s theory of truth with the evidential account of conditionals offered by Crupi and Iacona. As will be shown, in a first-order language that contains a naïve truth predicate and a suitable conditional, one can define a validity predicate in accordance with the thesis that the inference from a conjunction of premises to a conclusion is valid when the corresponding conditional is true. The validity predicate (...) so defined significantly increases our expressive resources and provides a coherent formal treatment of paradoxical arguments. (shrink)

According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct what Herzberger called “unstable statements with unpredictably complicated variations in truth value.” Besides, we also construct those paradoxes with infinitely many finite primary (...) periods but without any infinite primary period, those with an infinite critical point but without any finite primary period, and so on. This is the first formal appearance of these paradoxes. Our construction demonstrates that the binary sequences generated by a paradoxical sentence are something like genes from which we can even rebuild the original sentence itself. (shrink)

The paper presents a truth-maker semantics for Strict/Tolerant Logic (ST), which is the currently most popular logic among advocates of the non-transitive approach to paradoxes. Besides being interesting in itself, the truth-maker presentation of ST offers a new perspective on the recently discovered hierarchy of meta-inferences that, according to some, generalizes the idea behind ST. While fascinating from a mathematical perspective, there is no agreement on the philosophical significance of this hierarchy. I aim to show that there is no clear (...) philosophical significance of meta-inferences above the first level. (shrink)

Nontransitive responses to the validity Curry paradox face a dilemma that was recently formulated by Barrio, Rosenblatt and Tajer. It seems that, in the nontransitive logic ST enriched with a validity predicate, either you cannot prove that all derivable metarules preserve validity, or you can prove that instances of Cut that are not admissible in the logic preserve validity. I respond on behalf of the nontransitive approach. The paper argues, first, that we should reject the detachment principle for naive validity. (...) Secondly, I show how to add a validity predicate to ST while avoiding the dilemma. (shrink)

The perhaps most important criticism of the nontransitive approach to semantic paradoxes is that it cannot truthfully express exactly which metarules preserve validity. I argue that this criticism overlooks that the admissibility of metarules cannot be expressed in any logic that allows us to formulate validity-Curry sentences and that is formulated in a classical metalanguage. Hence, the criticism applies to all approaches that do their metatheory in classical logic. If we do the metatheory of nontransitive logics in a nontransitive logic, (...) however, there is no reason to think that the argument behind the criticism goes through. In general, asking a logic to express its own admissible metarules may not be a good idea. (shrink)

Some think that logic concerns the “laws of truth”; others that logic concerns the “laws of thought.” This paper presents a way to reconcile both views by building a bridge between truth-maker theory, à la Fine, and normative bilateralism, à la Restall and Ripley. The paper suggests a novel way of understanding consequence in truth-maker theory and shows that this allows us to identify a common structure shared by truth-maker theory and normative bilateralism. We can thus transfer ideas from normative (...) bilateralism to truth-maker theory, such as non-transitive solutions to paradox, and vice versa, such as notions of factual equivalence and containment. (shrink)

Nonclassical theories of truth have in common that they reject principles of classical logic to accommodate an unrestricted truth predicate. However, different nonclassical strategies give up different classical principles. The paper discusses one criterion we might use in theory choice when considering nonclassical rivals: the maxim of minimal mutilation.

I argue for two claims: that the ordinary English truth predicate is a gradable adjective and that truth is a property that comes in degrees. The first is a semantic claim, motivated by the linguistic evidence and the similarity of the truth predicate’s behavior to other gradable terms. The second is a claim in natural language metaphysics, motivated by interpreting the best semantic analysis of gradable terms as applied to the truth predicate. In addition to providing arguments for these two (...) claims, I draw out consequences for debates about deflationism and truth-based analyses of notions such as assertion and logical consequence. (shrink)

This paper explores the idea that vague predicates like “tall”, “loud” or “expensive” are applied based on a process of analog magnitude representation, whereby magnitudes are represented with noise. I present a probabilistic account of vague judgment, inspired by early remarks from E. Borel on vagueness, and use it to model judgments about borderline cases. The model involves two main components: probabilistic magnitude representation on the one hand, and a notion of subjective criterion. The framework is used to represent judgments (...) of the form “x is clearly tall” versus “x is tall”, as involving a shift of one’s criterion, and then to derive observed patterns of acceptance for borderline contradictions, namely sentences of the form “x is tall and not tall”, relative to the acceptance of their conjuncts. (shrink)

The tolerance principle, the idea that vague predicates are insensitive to sufficiently small changes, remains the main bone of contention between theories of vagueness. In this paper I examine three sources behind our ordinary belief in the tolerance principle, to establish whether any of them might give us a good reason to revise classical logic. First, I compare our understanding of tolerance in the case of precise predicates and in the case of vague predicates. While tolerance in the case of (...) precise predicates results from approximation, tolerance in the case of vague predicates appears to originate from two more specific sources: semantic indeterminacy on the one hand, and epistemic indiscriminability on the other. Both give us good and coherent grounds to revise classical logic. Epistemic indiscriminability, it is argued, may be more fundamental than semantic indeterminacy to justify the intuition that vague predicates are tolerant. (shrink)

This paper revisits Buridan’s Bridge paradox (Sophismata, chapter 8, Sophism 17), itself close kin to the Liar paradox, a version of which also appears in Bradwardine’s Insolubilia. Prompted by the occurrence of the paradox in Cervantes’s Don Quixote, I discuss and compare four distinct solutions to the problem, namely Bradwardine’s “just false” conception, Buridan’s “contingently true/false” theory, Cervantes’s “both true and false” view, and then the “neither true simpliciter nor false simpliciter” account proposed more recently by Jacquette. All have in (...) common to accept that the Bridge expresses a truth-apt proposition, but only the latter three endorse the transparency of truth. Against some previous commentaries I first show that Buridan’s solution is fully compliant with an account of the paradox within classical logic. I then argue that Cervantes’s insights, as well as Jacquette’s treatment, are both supportive of a dialetheist account, and Jacquette’s in particular of the strict-tolerant account of truth. I defend dialetheist intuitions (whether in LP or ST guise) against two objections: one concerning the future, the other concerning the alleged simplicity of the Bridge compared to the Liar. (shrink)

Why is ordinary language vague? We argue that in contexts in which a cooperative speaker is not perfectly informed about the world, the use of vague expressions can offer an optimal tradeoff between truthfulness (Gricean Quality) and informativeness (Gricean Quantity). Focusing on expressions of approximation such as “around”, which are semantically vague, we show that they allow the speaker to convey indirect probabilistic information, in a way that can give the listener a more accurate representation of the information available to (...) the speaker than any more precise expression would (intervals of the form “between”). That is, vague sentences can be _more informative_ than their precise counterparts. We give a probabilistic treatment of the interpretation of “around”, and offer a model for the interpretation and use of “around”-statements within the Rational Speech Act (RSA) framework. In our account the shape of the speaker’s distribution matters in ways not predicted by the Lexical Uncertainty model standardly used in the RSA framework for vague predicates. We use our approach to draw further lessons concerning the semantic flexibility of vague expressions and their irreducibility to more precise meanings. (shrink)

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of the predicament: (...) one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

The need for a ‘many-valued logic’ in linguistics has been evident since the 1970s, but there was lack of clarity as to whether it should come from the family of fuzzy logics or from the family of probabilistic logics. In this regard, Fine [14] and Kamp [26] pointed out undesirable effects of fuzzy logic (the failure of idempotency and coherence) which kept two generations of linguists and philosophers at arm’s length. (Another unwanted feature of fuzzy logic is the property of (...) truth functionality.) While probabilistic logic is not fraught by the same problems, its lack of constructiveness, i.e. its inability to compose complex truth degrees from atomic truth degrees, did not make it more attractive to linguists either. In the absence of a clear perspective in ‘many-valued logic’, scholars chose to proliferate ontologies grafted atop the classical bivalent logic: ontologies for truth, individuals, events, situations, possible worlds and degrees. The result has been a collection of incompatible classical logics. In this paper, I present sample logic, in particular its semantics (not its axiomatization). Sample logics is a member of the family of probabilistic logics, which is constructive without being truth functional. More specifically, I integrate all the important linguistic data on which the classical logics are predicated. The concepts of (in)dependency and conditional (in)dependency are the cornerstones of sample logic. (shrink)

Barrio et al. (_Journal of Philosophical Logic_, _49_(1), 93–120, 2020 ) and Pailos (_Review of Symbolic Logic_, _2020_(2), 249–268, 2020 ) develop an approach to define various metainferential hierarchies on strong Kleene models by transferring the idea of distinct standards for premises and conclusions from inferences to metainferences. In particular, they focus on a hierarchy named the \(\mathbb {S}\mathbb {T}\) -hierarchy where the inferential logic at the bottom of the hierarchy is the non-transitive logic ST but where each subsequent metainferential (...) logic ‘says’ about the former logic that it is transitive. While Barrio et al. ( 2020 ) suggests that this hierarchy is such that each subsequent level ‘in some intuitive sense, more classical than’ the previous level, Pailos ( 2020 ) proposes an extension of the hierarchy through which a ‘fully classical’ metainferential logic can be defined. Both Barrio et al. ( 2020 ) and Pailos ( 2020 ) explore the hierarchy in terms of semantic definitions and every proof proceeds by a rather cumbersome reasoning about those semantic definitions. The aim of this paper is to present and illustrate the virtues of a proof-theoretic tool for reasoning about the \(\mathbb {S}\mathbb {T}\) -hierarchy and the other metainferential hierarchies definable on strong Kleene models. Using the tool, this paper argues that each level in the \(\mathbb {S}\mathbb {T}\) -hierarchy is non-classical to an equal extent and that the ‘fully classical’ metainferential logic is actually just the original non-transitive logic ST ‘in disguise’. The paper concludes with some remarks about how the various results about the \(\mathbb {S}\mathbb {T}\) -hierarchy could be seen as a guide to help us imagine what a non-transitive metalogic for ST would tell us about ST. In particular, it teaches us that ST is from the perspective of ST as metatheory not only non-transitive but also transitive. (shrink)

In the recent paper “Naive modus ponens”, Zardini presents some brief considerations against an approach to semantic paradoxes that rejects the transitivity of entailment. The problem with the approach is, according to Zardini, that the failure of a meta-inference closely resembling modus ponens clashes both with the logical idea of modus ponens as a valid inference and the semantic idea of the conditional as requiring that a true conditional cannot have true antecedent and false consequent. I respond on behalf of (...) the non-transitive approach. I argue that the meta-inference in question is independent from the logical idea of modus ponens, and that the semantic idea of the conditional as formulated by Zardini is inadequate for his purposes because it is spelled out in a vocabulary not suitable for evaluating the adequacy of the conditional in semantics for non-transitive entailment. I proceed to generalize the semantic idea of the conditional and show that the most popular semantics for non-transitive entailment satisfies the new formulation. (shrink)

This paper presents a sound and complete five-sided sequent calculus for first-order weak Kleene valuations which permits not only elegant representations of four logics definable on first-order weak Kleene valuations, but also admissibility of five cut rules by proof analysis.

This paper continues my work of [9], which showed there was a broad family of many valued logics that have a strict/tolerant counterpart. Here we consider a generalization of weak Kleene three valued logic, instead of the strong version that was background for that earlier work. We explain the intuition behind that generalization, then determine a subclass of strict/tolerant structures in which a generalization of weak Kleene logic produces the same results that the strong Kleene generalization did. This paper provides (...) much background, but is not self-contained. Some results from [9] are called on, and are not reproved here. [9] Melvin C. Fitting. “A Family of Strict/Tolerant Logics”. In: Journal of Philosophical Logic. Online. Print publication forthcoming. (shrink)

Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a three-valued logic with left sides of sequents understood as if in Kleene’s Strong Three Valued Logic, and right sides as if in Priest’s Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, metameta, … (...) consequence levels in Barrio et al.. In my earlier paper Fitting I showed that the original ideas behind ST are, in fact, much more general than first appeared, and an infinite family of many valued logics have Strict/Tolerant counterparts. This family includes both Kleene’s and Priest’s logic individually, as well as first degree entailment. For instance, for both the Kleene and the Priest logic, the corresponding strict/tolerant logic is six-valued, but with differing sets of strictly and tolerantly designated truth values. The present paper extends that generalization in two directions. We examine a reverse notion, of Tolerant/Strict logics, which exist for the same structures that were investigated in Fitting. And we show that the generalization extends through the meta, metameta, … consequence levels for the same infinite family of many valued logics. Finally we close with remarks on the status of cut and related rules, which can actually be rather nuanced. Throughout, the aim is not the philosophical applications of the Strict/Tolerant idea, but the determination of how general a phenomenon it is. (shrink)

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and provide a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

Bounds consequence provides an interpretation of a multiple-conclusion consequence relation in which the derivability of a sequent is understood as the claim that it is conversationally out-of-bounds to take a position in which each member of Γ is asserted while each member of Δ is denied. Two of the foremost champions of bounds consequence—Greg Restall and David Ripley—have independently indicated that the shape of the bounds in question is determined by conversational practice. In this paper, I suggest that the standard (...) treatments of bounds consequence have focused heavily on the matter of veridicality at the expense of ignoring other features by which conversational bounds are set, prime among them being the matter of content or subject-matter. Furthermore, I argue that the semantic behavior of propositions containing “monstrous” content—content whose introduction is inappropriate to a context independently of veridical considerations—leads to a weak Kleene account of bounds consequence. (shrink)

Many analyses of notion of _metainferences_ in the non-transitive logic ST have tackled the question of whether ST can be identified with classical logic. In this paper, we argue that the primary analyses are overly restrictive of the notion of metainference. We offer a more elegant and tractable semantics for the strict-tolerant hierarchy based on the three-valued function for the LP material conditional. This semantics can be shown to easily handle the introduction of _mixed_ inferences, _i.e._, inferences involving objects belonging (...) to more than one (meta)inferential level and solves several other limitations of the ST hierarchies introduced by Barrio, Pailos, and Szmuc. (shrink)

Nicholas Smith argues that an adequate account of vagueness must involve\ndegrees of truth. The basic idea of degrees of truth is that while\nsome sentences are true and some are false, others possess intermediate\ntruth values: they are truer than the false sentences, but not as\ntrue as the true ones. This idea is immediately appealing in the\ncontext of vagueness--yet it has fallen on hard times in the philosophical\nliterature, with existing degree-theoretic treatments of vagueness\nfacing apparently insuperable objections. Smith seeks to turn the\ntide in (...) favor of a degree-theoretic treatment of vagueness, by motivating\nand defending the basic idea that truth can come in degrees, by arguing\nthat no theory of vagueness that does not countenance degrees of\ntruth can be correct, and by developing a new degree-theoretic treatment\nof vagueness--fuzzy plurivaluationism--that solves the problems plaguing\nearlier degree theories. (shrink)

This paper proposes an experimental investigation of the use of vague predicates in dynamic sorites. We present the results of two studies in which subjects had to categorize colored squares at the borderline between two color categories (Green vs. Blue, Yellow vs. Orange). Our main aim was to probe for hysteresis in the ordered transitions between the respective colors, namely for the longer persistence of the initial category. Our main finding is a reverse phenomenon of enhanced contrast (i.e. negative hysteresis), (...) present in two different tasks, a comparative task involving two color names, and a yes/no task involving a single color name, but not found in a corresponding color matching task. We propose an optimality-theoretic explanation of this effect in terms of the strict-tolerant framework of Cobreros et al. (J Philos Log 1–39, 2012), in which borderline cases are characterized in a dual manner in terms of overlap between tolerant extensions, and underlap between strict extensions. (shrink)

We propose a new theory based on the notions of marginal and large difference which has natural models in the context of nonstandard mathematics. We introduce the notion of finite marginality and show a representation result which ensures, for finitely marginal countable models, the existence of a homomorphism of the structure of marginal and large difference into a nonstandard model of the natural numbers, and show the extent to which any such homomorphism is unique. Finally, we show that our theory (...) constitutes part of the underlying abstract structure of three distinct philosophical theories of vagueness: Dean’s neofeasibilism, Itzhaki’s theory of nonstandard heuristics, and our own initial sketch of a nonstandard primitivism about vagueness. (shrink)

The past decades have seen remarkable progress in the study of substructural logics, be it mathematically or philosophically oriented. This progress has a somewhat perplexing effect: the more subst...

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)

Traditionally, epistemologists have held that only truth-related factors matter in the question of whether a subject can be said to know a proposition. Various philosophers have recently departed from this doctrine by claiming that the answer to this question also depends on practical concerns. They take this move to be warranted by the fact that people’s knowledge attributions appear sensitive to contextual variation, in particular variation due to differing stakes. This paper proposes an alternative explanation of the aforementioned fact, one (...) that allows us to stick to the orthodoxy. The alternative applies the conceptual spaces approach to the concept of knowledge. With knowledge conceived of spatially, the variability in knowledge attributions follows from recent work on identity, according to which our standards for judging things (including concepts) to be identical are context-dependent. On the proposal to be made, it depends on what is at stake in a context whether it is worth distinguishing between knowing and being at least close to knowing. (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)

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)

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 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)

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)