A semantic solution to the liar paradox (“This statement is not true”) is presented in this article. Since the liar paradox seems to evince a contradiction, the principle of non-contradiction is preliminarily discussed, in order to determine whether dismissing this principle may be reason enough to stop considering the liar paradox a problem. No conclusive outcome with respect to the value of this principle is aspired to here, so that the inquiry is not concluded at this point and the option (...) to explore an alternative, semantic, solution remains open. This proposed solution is focused on what the liar paradox expresses and what it fails to express. (shrink)

Deflationists about truth hold that the function of the truth predicate is to enable us to make certain assertions we could not otherwise make. Pragmatists claim that the utility of negation lies in its role in registering incompatibility. The pragmatist insight about negation has been successfully incorporated into bilateral theories of content, which take the meaning of negation to be inferentially explained in terms of the speech act of rejection. We implement the deflationist insight in a bilateral theory by taking (...) the meaning of the truth predicate to be explained by its inferential relation to assertion. We combine this account of the meaning of the truth predicate with a new diagnosis of the Liar Paradox: its derivation requires the truth rules to preserve evidence, but these rules only preserve commitment. The result is a novel inferential deflationist theory of truth, which solves the Liar Paradox in a principled manner. We end by showing that our theory and simple extensions thereof have the resources to axiomatize the internal logic of several supervaluational hierarchies, including Cantini’s. This solves open problems of Halbach (2011) and Horsten (2011). (shrink)

An old and well-known objection to non-classical logics is that they are too weak; in particular, they cannot prove a number of important mathematical results. A promising strategy to deal with this objection consists in proving so-called recapture results. Roughly, these results show that classical logic can be used in mathematics and other unproblematic contexts. However, the strategy faces some potential problems. First, typical recapture results are formulated in a purely logical language, and do not generalize nicely to languages containing (...) the kind of vocabulary that usually motivates non-classical theories—for example, a language containing a naïve truth predicate. Second, proofs of recapture results typically employ classical principles that are not valid in the targeted non-classical system; hence, non-classical theorists do not seem entitled to those results. In this paper, we analyze these problems and provide solutions on behalf of non-classical theorists. To address the first problem, we provide a novel kind of recapture result, which generalizes nicely to a truth-theoretic language. As for the second problem, we argue that it relies on an ambiguity and that, once the ambiguity is removed, there are no reasons to think that non-classical logicians are not entitled to their recapture results. (shrink)

Some scientific theories are inconsistent, yet non-trivial and meaningful. How is that possible? The present paper aims to show that we can analyse the inferential use of such theories in terms of consistent compositions of the applications of universal axioms. This technique will be represented by a preferred models semantics, which allows us to accept the instances of universal axioms selectively. For such a semantics to be developed, the framework of partial structures by da Costa and French will be extended (...) by a few elements of the Sneed formalism, also known as the structuralist approach to science. (shrink)

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

I explore, from a proof-theoretic perspective, the hierarchy of classical and paraconsistent logics introduced by Barrio, Pailos and Szmuc in (Journal o f Philosophical Logic,49, 93-120, 2021). First, I provide sequent rules and axioms for all the logics in the hierarchy, for all inferential levels, and establish soundness and completeness results. Second, I show how to extend those systems with a corresponding hierarchy of validity predicates, each one of which is meant to capture “validity” at a different inferential level. Then, (...) I point out two potential philosophical implications of these results. (i) Since the logics in the hierarchy differ from one another on the rules, I argue that each such logic maintains its own distinct identity (contrary to arguments like the one given by Dicher and Paoli in 2019). (ii) Each validity predicate need not capture “validity” at more than one metainferential level. Hence, there are reasons to deny the thesis (put forward in Barrio, E., Rosenblatt, L. & Tajer, D. (Synthese, 2016)) that the validity predicate introduced in by Beall and Murzi in (Journal o f Philosophy,110(3), 143–165, 2013) has to express facts not only about what follows from what, but also about the metarules, etc. (shrink)

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)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Il s’agit de comprendre dans cet article l’opposition formulée par Gilles-Gaston Granger entre deux types de négation : la négation « radicale », d’un côté, et les négations « appliquées » de l’autre. Nous examinerons les propriétés de cette opposition, ainsi que les enseignements à en tirer sur la philosophie de la logique de Granger. Puis nous proposerons une théorie constructive des valeurs logiques considérées comme des objets structurés, consolidant à la fois l’unité de la théorie logique de Granger et (...) son pluralisme philosophique. (shrink)

The present contribution might be regarded as a kind of defense of the common sense in logic. It is demonstrated that if the classical negation is interpreted as the minimal negation with n = 2 truth values, then deviant logics can be conceived as extension of the classical bivalent frame. Such classical apprehension of negation is possible in non- classical logics as well, if truth value is internalized and bivalence is replaced by bipartition.

Given the plethora of competing logical theories of validity available, it’s understandable that there has been a marked increase in interest in logical epistemology within the literature. If we are to choose between these logical theories, we require a good understanding of the suitable criteria we ought to judge according to. However, so far there’s been a lack of appreciation of how logical practice could support an epistemology of logic. This paper aims to correct that error, by arguing for a (...) practice-based approach to logical epistemology. By looking at the types of evidence logicians actually appeal to in attempting to support their theories, we can provide a more detailed and realistic picture of logical epistemology. To demonstrate the fruitfulness of a practice-based approach, we look to a particular case of logical argumentation—the dialetheist’s arguments based upon the self-referential paradoxes—and show that the evidence appealed to support a particular theory of logical epistemology, logical abductivism. (shrink)

In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...) some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn logics and extensions of these logics to more expressive languages. We do so by relying on the \ calculus, a signed tableau calculus whose rules mirror the Dunn conditions syntactically and which characterizes the Dunn logics in a uniform way. In (...) terms of the \ calculus, we first introduce two different interpolation methods, each of which uniformly shows that the Dunn logics have the interpolation property. One of the methods is closely related to Maehara’s method but the other method, which we call the pruned tableau method, is novel to this paper. We provide various reasons to prefer the pruned tableau method to the Maehara-style method. We then turn our attention to extensions of Dunn logics with so-called appropriate implication connectives. Although these logics have been considered at various places in the literature, a study of the interpolation properties of these logics is lacking. We use the pruned tableau method to uniformly show that these extended Dunn logics have the interpolation property and explain that the same result cannot be obtained via the Maehara-style method. Finally, we show how the pruned tableau method constructs interpolants for functionally complete extensions of the Dunn logics. (shrink)

In this paper a new conception of foundation-oriented epistemology is developed. The major challenge for foundation-oriented justifications consists in the problem of stopping the justificational regress without taking recourse to dogmatic assumptions or circular reasoning. Two alternative accounts that attempt to circumvent this problem, coherentism and externalism, are critically discussed and rejected as unsatisfactory. It is argued that optimality arguments are a new type of foundation-oriented justification that can stop the justificational regress. This is demonstrated on the basis of a (...) novel result in the area of induction: the optimality of meta-induction. In the final section the method of optimality justification is generalized to deductive and abductive inferences. (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)

Propositions are often aligned with truth-conditions. The view is mistaken, since propositions discriminate where truth conditions do not. Propositions are hyperintensional: they are sensitive to necessarily equivalent differences. I investigate an alternative view on which propositions are truthmaker conditions, understood as sets of possible truthmakers. This requires making metaphysical sense of merely possible states of affairs. The theory that emerges illuminates the semantic phenomena of samesaying, subject matter, and aboutness.

ABSTRACTDo truth tables—the ordinary sort that we use in teaching and explaining basic propositional logic—require an assumption of consistency for their construction? In this essay we show that truth tables can be built in a consistency-independent paraconsistent setting, without any appeal to classical logic. This is evidence for a more general claim—that when we write down the orthodox semantic clauses for a logic, whatever logic we presuppose in the background will be the logic that appears in the foreground. Rather than (...) any one logic being privileged, then, on this count partisans across the logical spectrum are in relatively similar dialectical positions. (shrink)

By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also contains a host of unfamiliar (...) logics. We first study the members of our class semantically, after which we present a uniform sequent calculus that is sound and complete with respect to all of them. Two further sequent calculi and \ calculus) will be considered, which serve the same purpose and which are obtained by applying general methods to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the \ and the \ calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the \ and the \ calculus, we also hint at its philosophical significance. (shrink)

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)

It has been an open question whether or not we can define a belief revision operation that is distinct from simple belief expansion using paraconsistent logic. In this paper, we investigate the possibility of meeting the challenge of defining a belief revision operation using the resources made available by the study of dynamic epistemic logic in the presence of paraconsistent logic. We will show that it is possible to define dynamic operations of belief revision in a paraconsistent setting.

A quasi-canonical Gentzen-type system is a Gentzen-type system in which each logical rule introduces either a formula of the form , or of the form , and all the active formulas of its premises belong to the set . In this paper we investigate quasi-canonical systems in which exactly one of the two classical rules for negation is included, turning the induced logic into either a paraconsistent logic or a paracomplete logic, but not both. We provide a constructive coherence criterion (...) for such systems, and show that a quasi-canonical system of the type we investigate is coherent iff it is strongly paraconsistent or strongly paracomplete (in a sense defined in the paper), iff it has a trivalent, non-deterministic semantics of a special type (also defined in the paper) for which it is sound and complete. Finally, we determine when a system of this sort admits cut-elimination, and provide a simple procedure for transforming one which does not into one which does. (shrink)

This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...) a family of trivalent logics. I go on to examine the strict conditional and its derivatives. This family is the only one to avoid the faulty inference but it does so without addressing the status of the truth-value assigned to defective conditionals. (shrink)

Max Cresswell and Hilary Putnam seem to hold the view, often shared by classical logicians, that paraconsistent logic has not been made sense of, despite its well-developed mathematics. In this paper, I examine the nature of logic in order to understand what it means to make sense of logic. I then show that, just as one can make sense of non-normal modal logics (as Cresswell demonstrates), we can make `sense' of paraconsistent logic. Finally, I turn the tables on classical logicians (...) and ask what sense can be made of explosive reasoning. While I acknowledge a bias on this issue, it is not clear that even classical logicians can answer this question. (shrink)

A survey is given of three-valued paraconsistent propositionallogics connected with Jaśkowski’s criterion for constructing paraconsistentlogics. Several problems are raised and four new matrix three-valued paraconsistent logics are suggested.

ABSTRACT In the paper we present a survey of some approaches to the semantics of many-valued propositional systems. These approaches are inspired on one hand by classical problems in the investigations of logical aspects of epistemic activity: knowledge and truth, contradictions, beliefs, reliability of data, etc. On the other hand they reflect contemporary concerns of researchers in Artificial Intelligence (and Cognitive Science in general) with inferences drawn from imperfect information, even from total ignorance. We treat the mathematical apparatus that has (...) emerged recently: algebraic structures related to the new logical systems in the same way Boolean algebras correspond to classical logic. (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)

Paraconsistent and dialetheist approaches to a theory of truth are faced with a problem: the expressive resources of the logic do not suffice to express that a sentence is just true—i.e., true and not also false—or to express that a sentence is consistent. In his recent book, Spandrels of Truth, Jc Beall proposes a ‘just true’-operator to identify sentences that are true and not also false. Beall suggests seven principles that a ‘just true’-operator must fulfill, and proves that his operator (...) indeed fulfills all of them. He concludes that just true has been expressed in the language. I argue that, while the seven conditions may be necessary for an operator to express just true, they are not jointly sufficient. Specifically, first, I prove that a further plausible desideratum for necessary conditions on ‘just true’ is not fulfilled by Beall's proposal, namely that ‘just true’ ascriptions should themselves be just true, and not also false (or equivalently, that the ‘just true’-operator iterates). Second, I show that Beall's operator does not adequately express just true, but that it merely captures an arbitrary proper subset of the just true sentences. Further, there is no prospect of extending the proposal in order to encompass a more reasonable subset of the just true sentences without presupposing that we have antecedent means to characterize the class of just true sentences. (shrink)

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...) matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

Abstract. As a general theory of reasoning—and as a general theory of what holds true under every possible circumstance—logic is supposed to be ontologically neutral. It ought to have nothing to do with questions concerning what there is, or whether there is anything at all. It is for this reason that traditional Aristotelian logic, with its tacit existential presuppositions, was eventually deemed inadequate as a canon of pure logic. And it is for this reason that modern quantification theory, too, with (...) its residue of existentially loaded theorems and patterns of inference, has been claimed to suffer from a defect of logical purity. The law of non-contradiction rules out certain circumstances as impossible—circumstances in which a statement is both true and false, or perhaps circumstances where something both is and is not the case. Is this to be regarded as a further ontological bias? (shrink)

A common and much-explored thought is Łukasiewicz's idea that the future is ‘indeterminate’—i.e., ‘gappy’ with respect to some claims—and that such indeterminacy bleeds back into the present in the form of gappy ‘future contingent’ claims. What is uncommon, and to my knowledge unexplored, is the dual idea of an overdeterminate future—one which is ‘glutty’ with respect to some claims. While the direct dual, with future gluts bleeding back into the present, is worth noting, my central aim is simply to sketch (...) and briefly explore an alternative glutty-future view, one that is conservative—indeed, entirely classical—with respect to the present. The structure of the paper runs as follows. §1 briefly sketches the target gap picture of an indeterminate future yielding gappy claims at the present. §2 presents the direct dual idea—a glut picture of an overdeterminate future yielding glutty claims at present. §3 sketches the central idea, a more interesting glut picture in which the future contains contradictory states but the present remains entirely classical. §4 contains a general defence of the idea, leaving it open as to whether the gappy-future view enjoys substantive virtues over the proposed glutty-future view of §3. (shrink)

Relevantism, as a matter of definition, rejects classical logic as incorrect and adopts instead a relevant logic as encapsulating correct inference. It rejects classical logic on the grounds that the rule of Material Detachment, from A and not A or B to infer B,, sometimes leads from truth to falsity. Relevantism — although promoted by some relevant logicians, and an integral part of ultralogic — has recently encountered heavy, but interesting, criticism from relevance logicians themselves.

1 What are the features of a paraconsistent negation? Since paraconsistent logic was launched by da Costa in his seminal paper [4], one of the fundamental problems has been to determine what exactly are the theoretical or metatheoretical properties of classical negation that can have a unary operator not obeying the principle of noncontradiction, that is, a paraconsistent operator. What the result presented here shows is that some of these properties are not compatible with each other, so that in constructing (...) a paraconsistent negation as close as possible to classical negation, we have to make a choice among classical properties compatible with the idea of paraconsistency. In particular, there is no paraconsistent negation more classical than all the others. (shrink)

In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of it, (...) which we call tolerant truth and strict truth. We characterize the space of consequence relations definable in terms of those and discuss the kind of solution this gives to the sorites paradox. We discuss some applications of the framework to the pragmatics and psycholinguistics of vague predicates, in particular regarding judgments about borderline cases. (shrink)

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems to change (...) this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that $\neg(a\wedge\neg a)$ is a theorem which can be algebraized by a technique similar to the Tarski-Lindenbaum technique.

An approach to the treatment of inference in the presence of uncertain truth values is described, based on representing uncertainties by sets of ordinary (certain) truth values. Both the algebraic and the logical aspects are studied for a variety of lattices used as truth value spaces in the domain of many-valued logic.

The purpose of this essay is to shed some light on a certain type of sentence, which I call a borderline contradiction. A borderline contradiction is a sentence of the form F a ∧ ¬F a, for some vague predicate F and some borderline case a of F , or a sentence equivalent to such a sentence. For example, if Jackie is a borderline case of ‘rich’, then ‘Jackie is rich and Jackie isn’t rich’ is a borderline contradiction. Many theories (...) of vague language have entailments about borderline contradictions; correctly describing the behavior of borderline contradictions is one of the many tasks facing anyone offering a theory of vague language. Here, I first briefly review claims made by various theorists about these borderline contradictions, attempting to draw out some predictions about the behavior of ordinary speakers. Second, I present an experiment intended to gather relevant data about the behavior of ordinary speakers. Finally, I discuss the experimental results in light of several different theories of vagueness, to see what explanations are available. My conclusions are necessarily tentative; I do not attempt to use the present experiment to demonstrate that any single theory is incontrovertibly true. Rather, I try to sketch the auxiliary hypotheses that would need to be conjoined to several extant theories of vague language to predict the present result, and offer some considerations regarding the plausibility of these various hypotheses. In the end, I conclude that two of the theories I consider are better-positioned to account for the observed data than are the others. But the field of logically-informed research on people’s actual responses to vague predicates is young; surely as more data come in we will learn a great deal more about which (if any) of these theories best accounts for the behavior of ordinary speakers. (shrink)

Bertrand Russell’s 1906 article ‘The Theory of Implication’ contains an algebraic weak completeness proof for classical propositional logic. Russell did not present it as such. We give an exposition of the proof and investigate Russell’s view of what he was about, whether he could have appreciated the proof for what it is, and why there is no parallel of the proof in Principia Mathematica.

This paper argues for tlie claims that a) a natural language such as English is semanticaly closed b) semantic closure implies inconsistency. A corollary of these is that the semantics of English must be paraconsistent. The first part of the paper formulates a definition of semantic closure which applies to natural languages and shows that this implies inconsistency. The second section argues that English is semeantically closed. The preceding discussion is predicated on the assumption that there are no truth value (...) gaps. The next section of the paper considers whether the possibility of these makes any difference to the substantive conclusions of the previous sections, and argues that it does not. The crux of the preceding arguments is that none of the consistent semantical accounts that have been offered for solving the semantical paradoxes is a semantic ofEnglish. The final section of the paper produces a general argument as to why this must always be the case. (shrink)

The paper concerns time, change and contradiction, and is in three parts. The first is an analysis of the problem of the instant of change. It is argued that some changes are such that at the instant of change the system is in both the prior and the posterior state. In particular there are some changes from p being true to p being true where a contradiction is realized. The second part of the paper specifies a formal logic which accommodates (...) this possibility. It is a tense logic based on an underlying paraconsistent prepositional logic, the logic of paradox. (See the author's article of the same name Journal of Philosophical Logic 8 (1979).) Soundness and completeness are established, the latter by the canonical model construction, and extensions of the basic system briefly considered. The final part of the paper discusses Leibniz's principle of continuity: Whatever holds up to the limit holds at the limit. It argues that in the context of physical changes this is a very plausible principle. When it is built into the logic of the previous part, it allows a rigorous proof that change entails contradictions. Finally the relation of this to remarks on dialectics by Hegel and Engels is briefly discussed. (shrink)

The paper explains how a paraconsistent logician can appropriate all classical reasoning. This is to take consistency as a default assumption, and hence to work within those models of the theory at hand which are minimally inconsistent. The paper spells out the formal application of this strategy to one paraconsistent logic, first-order LP. (See, Ch. 5 of: G. Priest, In Contradiction, Nijhoff, 1987.) The result is a strong non-monotonic paraconsistent logic agreeing with classical logic in consistent situations. It is shown (...) that the logical closure of a theory under this logic is trivial only if its closure under LP is trivial. (shrink)

We have seen that proofs of soundness of (Boolean) DS, EFQ and of ABS — and hence the legitimation of these inferences — can be achieved only be appealing to the very form of reasoning in question. But this by no means implies that we have to fall back on classical reasoning willy-nilly. Many logical theories can provide the relevant boot-strapping. Decision between them has, therefore, to be made on other grounds. The grounds include the many criteria familiar from the (...) philosophy of science: theoretical integrity (e.g., paucity of ad hoc hypotheses), adequacy to the data (explaining the data of inference —all inferences, not just those chosen from consistent domains!) and so on. This paper has not attempted to address these issues in general. All it demonstrates is that the charge that a dialetheist solution to the semantic paradoxes can be maintained only by making some intelligible notion ineffable cannot be made to stick. The dialetheist has a coherent position, endorsing the T-scheme, but rejecting DS, EFQ (even Boolean DS and EFQ) and ABS. And any argument to the effect that the relevant notions are both ineffable and intelligible begs the question. The case against consistent “solutions” to the semantic paradoxes therefore remains intact. (shrink)

On an internalist account of logical inference, we are warranted in drawing conclusions from accepted premises on the basis of our knowledge of logical laws. Lewis Carroll’s regress challenges internalism by purporting to show that this kind of warrant cannot ground the move from premises to conclusion. Carroll’s regress vindicates a repudiation of internalism and leads to the espousal of a standpoint that regards our inferential practice as not being grounded on our knowledge of logical laws. Such a standpoint can (...) take two forms. One can adopt either a broadly externalist model of inference or a sceptical stance. I will attempt, in what follows, to defend a version of internalism which is not affected by the regress. The main strategy will be to show that externalism and scepticism are not satisfying standpoints to adopt with regard to our inferential practice, and then to suggest an internalist alternative. (shrink)