I show that it is not possible to uniquely characterize classical logic when working within classical set theory. By building on recent work by Eduardo Barrio, Federico Pailos, and Damian Szmuc, I show that for every inferential level (finite and transfinite), either classical logic is not unique at that level or there exist intuitively valid inferences of that level that are not definable in modern classical set theory. The classical logician is thereby faced with a three-horned dilemma: Give up uniqueness (...) but preserve characterizability, give up characterizability and preserve uniqueness, or (potentially) preserve both but give up modern classical set theory. After proving the main result, I briefly explore this third option by developing an account of classical logic within a paraconsistent set theory. This account of classical logic ensures unique characterizability in some sense, but the non-classical set theory also produces highly non-classical meta-results about classical logic. (shrink)

Formal symptoms of relevance usually concern the propositional variables shared between the antecedent and the consequent of provable conditionals. Among the most famous results about such symptoms are Belnap’s early results showing that for sublogics of the strong relevant logic R, provable conditionals share a signed variable between antecedent and consequent. For logics weaker than R stronger variable sharing results are available. In 1984, Ross Brady gave one well-known example of such a result. As a corollary to the main result (...) of the paper, we give a very simple proof of a related but strictly stronger result. (shrink)

Priest argued in Fusion and Confusion (Priest in Topoi 34(1):55–61, 2015a) for a new concept of logical consequence over the relevant logic B, one where premises my be “confused” together. This paper develops Priest’s idea. Whereas Priest uses a substructural proof calculus, this paper provides a Hilbert proof calculus for it. Using this it is shown that Priest’s consequence relation is weaker than the standard Hilbert consequence relation for B, but strictly stronger than Anderson and Belnap’s original relevant notion of (...) consequence. Unlike the latter, however, Priest’s consequence relation does not satisfy a variant of the variable sharing property. This paper shows that how it can be modified so as to do so. Priest’s consequence relation turns out to be surprisingly weak in some respects. The prospects of strengthening it is raised and discussed in a broader philosophical context. (shrink)

ABSTRACT In our response Field's ‘Properties, Propositions and Conditionals’, we explore the methodology of Field's program. We begin by contrasting it with a proof-theoretic approach and then commenting on some of the particular choices made in the development of Field's theory. Then, we look at issues of property identity in connection with different notions of equivalence. We close with some comments relating our discussion to Field's response to Restall’s [2010] ‘What Are We to Accept, and What Are We to Reject, (...) While Saving Truth from Paradox?’. (shrink)

The basic quasi-Boolean negation expansions of relevance logics included in Anderson and Belnap’s relevance logic R are defined. We consider two types of QB-negation: H-negation and D-negation. The former one is of paraintuitionistic or superintuitionistic character, the latter one, of dual intuitionistic nature in some sense. Logics endowed with H-negation are paracomplete; logics with D-negation are paraconsistent. All logics defined in the paper are given a Routley-Meyer ternary relational semantics.

Many relevant logics can be conservatively extended by Boolean negation. Mares showed, however, that E is a notable exception. Mares’ proof is by and large a rather involved model-theoretic one. This paper presents a much easier proof-theoretic proof which not only covers E but also generalizes so as to also cover relevant logics with a primitive modal operator added. It is shown that from even very weak relevant logics augmented by a weak K-ish modal operator, and up to the strong (...) relevant logic R with a S5 modal operator, all fail to be conservatively extended by Boolean negation. The proof, therefore, also covers Meyer and Mares’ proof that NR—R with a primitive S4-modality added—also fails to be conservatively extended by Boolean negation. (shrink)

A number of `no-proposition' approaches to the liar paradox find themselves implicitly committed to a moderate disquotational principle: the principle that if an utterance of the sentence `$P$' says anything at all, it says that $P$ (with suitable restrictions). I show that this principle alone is responsible for the revenge paradoxes that plague this view. I instead propose a view in which there are several closely related language-world relations playing the `semantic expressing' role, none of which is more central to (...) semantic theorizing than any other. I use this thesis about language and the negative result about disquotation to motivate the view that people do say things with utterances of paradoxical sentences, although they do not say the proposition you'd always expect, as articulated with a disquotational principle. (shrink)

The answers to the questions in the title depend on the kind of pluralism one is talking about. We will focus here on our own views. The purpose of this article is to trace out some possible connections between these kinds of pluralism. We show how each of them might bear on the other, depending on how certain open questions are resolved.

This paper explores early Australasian philosophy in some detail. Two approaches have dominated Western philosophy in Australia: idealism and materialism. Idealism was prevalent between the 1880s and the 1930s, but dissipated thereafter. Idealism in Australia often reflected Kantian themes, but it also reflected the revival of interest in Hegel through the work of ‘absolute idealists’ such as T. H. Green, F. H. Bradley, and Henry Jones. A number of the early New Zealand philosophers were also educated in the idealist tradition (...) and were influential in their communities, but produced relatively little. In Australia, materialism gained prominence through the work of John Anderson, who arrived in Australia in 1927, and continues to be influential. John Anderson had been a student of Henry Jones, who might therefore be said to have influenced both main strands of Australian philosophical thought. (shrink)

Analogues of Scott's isomorphism theorem, Karp's theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An "interpolation theorem" for the infinitary quantificational boolean logic L-infinity omega. holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.

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)

An important question for proponents of non-contractive approaches to paradox is why contraction fails. Zardini offers an answer, namely that paradoxical sentences exhibit a kind of instability. I elaborate this idea using revision theory, and I argue that while instability does motivate failures of contraction, it equally motivates failure of many principles that non-contractive theorists want to maintain.

This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...) overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs for naïve set theory are also provided. (shrink)

This special issue collects together nine new essays on logical consequence :the relation obtaining between the premises and the conclusion of a logically valid argument. The present paper is a partial, and opinionated,introduction to the contemporary debate on the topic. We focus on two influential accounts of consequence, the model-theoretic and the proof-theoretic, and on the seeming platitude that valid arguments necessarilypreserve truth. We briefly discuss the main objections these accounts face, as well as Hartry Field’s contention that such objections (...) show consequenceto be a primitive, indefinable notion, and that we must reject the claim that valid arguments necessarily preserve truth. We suggest that the accountsin question have the resources to meet the objections standardly thought to herald their demise and make two main claims: (i) that consequence, as opposed to logical consequence, is the epistemologically significant relation philosophers should be mainly interested in; and (ii) that consequence is a paradoxical notion if truth is. (shrink)

Logical orthodoxy has it that classical first-order logic, or some extension thereof, provides the right extension of the logical consequence relation. However, together with naïve but intuitive principles about semantic notions such as truth, denotation, satisfaction, and possibly validity and other naïve logical properties, classical logic quickly leads to inconsistency, and indeed triviality. At least since the publication of Kripke’s Outline of a theory of truth , an increasingly popular diagnosis has been to restore consistency, or at least non-triviality, by (...) restricting some classical rules. Our modest aim in this note is to briefly introduce the main strands of the current debate on paradox and logical revision, and point to some of the potential challenges revisionary approaches might face, with reference to the nine contributions to the present volume.For a recent introduction to non-classical theories of truth and other semantic notions, see the excellent Beall a .. (shrink)

A unified answer is offered to two distinct fundamental questions: whether a nonclassical solution to the semantic paradoxes should be extended to other apparently similar paradoxes and whether a nonclassical logic should be expressed in a nonclassical metalanguage. The paper starts by reviewing a budget of paradoxes involving the logical properties of validity, inconsistency, and compatibility. The author’s favored substructural approach to naive truth is then presented and it is explained how that approach can be extended in a very natural (...) way so as to solve a certain paradox of validity. However, three individually decisive reasons are later provided for thinking that no approach adopting a classical metalanguage can adequately account for all the features involved in the paradoxes of logical properties. Consequently, the paper undertakes the task to do better, and, building on the system already developed, introduces a theory in a nonclassical metalanguage that expresses an adequate logic of naive truth and of some naive logical properties. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

Tarski's Undefinability of Truth Theorem comes in two versions: that no consistent theory which interprets Robinson's Arithmetic (Q) can prove all instances of the T-Scheme and hence define truth; and that no such theory, if sound, can even express truth. In this note, I prove corresponding limitative results for validity. While Peano Arithmetic already has the resources to define a predicate expressing logical validity, as Jeff Ketland has recently pointed out (2012, Validity as a primitive. Analysis 72: 421-30), no theory (...) which interprets Q closed under the standard structural rules can define nor express validity, on pain of triviality. The results put pressure on the widespread view that there is an asymmetry between truth and validity, viz. that while the former cannot be defined within the language, the latter can. I argue that Vann McGee's and Hartry Field's arguments for the asymmetry view are problematic. (shrink)

In this paper a principle of substitutivity of logical equivalents salve veritate and a version of Leibniz’s law are formulated and each is shown to cause problems when combined with naive truth theories.

This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends classical (...) logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered. (shrink)

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)

Roache has raised a new objection to cohabitation theories of personal fission. According to these theories, in cases of personal fission the pre-fission body is cohabited by (at least) two persons. She claims such cohabitants cannot be concerned for their survival in the way ordinary non-cohabitants can. I will offer criticism of Roache’s argument and conclude she doesn’t establish this claim.

This accessible essay treats knowledge and belief in a usable and applicable way. Many of its basic ideas have been developed recently in Corcoran-Hamid 2014: Investigating knowledge and opinion. The Road to Universal Logic. Vol. I. Arthur Buchsbaum and Arnold Koslow, Editors. Springer. Pp. 95-126. http://www.springer.com/birkhauser/mathematics/book/978-3-319-10192-7 .

We collect together some misgivings about the logic R of relevant inplication, and then give support to a weak entailment logic $DJ^{d}$ . The misgivings centre on some recent negative results concerning R, the conceptual vacuousness of relevant implication, and the treatment of classical logic. We then rectify this situation by introducing an entailment logic based on meaning containment, rather than meaning connection, which has a better relationship with classical logic. Soundness and completeness results are proved for $DJ^{d}$ with respect (...) to a content semantics, which embraces the concept of meaning containment. (shrink)

In this paper, we examine a number of relevant logics’ variable sharing properties from the perspective of theories of topic or subject-matter. We take cues from Franz Berto’s recent work on topic to show an alignment between families of variable sharing properties and responses to the topic transparency of relevant implication and negation. We then introduce and defend novel variable sharing properties stronger than strong depth relevance—which we call cn-relevance and lossless cn-relevance—showing that the properties are satisfied by the weak (...) relevant logics and , respectively. We argue that such properties address a sort of semantic lossiness of strong depth relevance. (shrink)

The present PhD dissertation aims to examine the relation between modality and change in Aristotle’s metaphysics. -/- On the one hand, Aristotle supports his modal realism (i.e., worldly objects have modal properties - potentialities and essences - that ground the ascriptions of possibility and necessity) by arguing that the rejection of modal realism makes change inexplicable, or, worse, banishes it from the realm of reality. On the other hand, the Stagirite analyses processes by means of modal notions (‘change is the (...) actuality of what is virtual insofar as it is virtual’). In other words: to grasp what change is, one has to resort to the modal idiom of potentialities, while the fact that there is change is indicative of the fact that nature is full of modal properties. -/- Aristotle’s modal and kinetic realism finds a negative in the figure of the Megaric Diodorus Kronus. The polemical situation of Greek philosophy has indeed the dialectical advantage of not opposing the Aristotelian position to a sui generis straw man. Both in its reduction of modal judgements to temporal quantifications and in its dissolution of the reality of the state-of-being-in-motion in favour of a cinematographic view of processes, the philosophical figure of reductionist antirealism embodied by Diodorus constitutes an alternative that takes the opposite view of Aristotle’s realism. -/- The present study is structured as a discussion between these two positions. In the face of Diodorus’ antirealist challenges, Aristotle articulates modal and kinetic considerations: the answers he gives to Diodorus’ puzzles thus provide valuable insight into his metaphysics. Moreover, the examination of Aristotle’s and Diodorus’ metaphysics, because of their insight and originality, will not fail to interest the philosopher concerned with the metaphysical foundations of modern physics, insofar as the entanglement between modalities and processes is nowadays at the core of mechanics (phase spaces, path integrals, etc.). (shrink)

I show that the logic $\textsf {TJK}^{d+}$, one of the strongest logics currently known to support the naive theory of truth, is obtained from the Kripke semantics for constant domain intuitionistic logic by dropping the requirement that the accessibility relation is reflexive and only allowing reflexive worlds to serve as counterexamples to logical consequence. In addition, I provide a simplified natural deduction system for $\textsf {TJK}^{d+}$, in which a restricted form of conditional proof is used to establish conditionals.

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)

Mereotopology is a theory of connected parts. The existence of boundaries, as parts of everyday objects, is basic to any such theory; but in classical mereotopology, there is a problem: if boundaries exist, then either distinct entities cannot be in contact, or else space is not topologically connected . In this paper we urge that this problem can be met with a paraconsistent mereotopology, and sketch the details of one such approach. The resulting theory focuses attention on the role of (...) empty parts, in delivering a balanced and bounded metaphysics of naive space. (shrink)

This paper begins an axiomatic development of naive set theoryin a paraconsistent logic. Results divide into two sorts. There is classical recapture, where the main theorems of ordinal and Peano arithmetic are proved, showing that naive set theory can provide a foundation for standard mathematics. Then there are major extensions, including proofs of the famous paradoxes and the axiom of choice (in the form of the well-ordering principle). At the end I indicate how later developments of cardinal numbers will lead (...) to Cantor’s theorem, the existence of large cardinals, and a counterexample to the continuum hypothesis. (shrink)

In this paper, we study some classes of logical structures from the universal logic standpoint, viz., those of the Tarski- and the Lindenbaum-types. The characterization theorems for the Tarski- and two of the four different Lindenbaum-type logical structures have been proved as well. The separations between the five classes of logical structures, viz., the four Lindenbaum-types and the Tarski-type have been established via examples. Finally, we study the logical structures that are of both Tarski- and a Lindenbaum-type, show their separations, (...) and end with characterization, adequacy, minimality, and representation theorems for one of the Tarski–Lindenbaum-type logical structures. (shrink)

Relevant logics have traditionally been viewed as paraconsistent. This paper shows that this view of relevant logics is wrong. It does so by showing forth a logic which extends classical logic, yet satisfies the Entailment Theorem as well as the variable sharing property. In addition it has the same S4-type modal feature as the original relevant logic E as well as the same enthymematical deduction theorem. The variable sharing property was only ever regarded as a necessary property for a logic (...) to have in order for it to not validate the so-called paradoxes of implication. The Entailment Theorem on the other hand was regarded as both necessary and sufficient. This paper shows that the latter theorem also holds for classical logic, and so cannot be regarded as a sufficient property for blocking the paradoxes. The concept of suppression is taken up, but shown to be properly weaker than that of variable sharing. (shrink)

This paper describes a modal conception of sets, according to which sets are 'potential' with respect to their members. A modal theory is developed, which invokes a naive comprehension axiom schema, modified by adding `forward looking' and `backward looking' modal operators. We show that this `bi-modal' naive set theory can prove modalized interpretations of several ZFC axioms, including the axiom of infinity. We also show that the theory is consistent by providing an S5 Kripke model. The paper concludes with some (...) discussion of the nature of the modalities involved, drawing comparisons with noneism, the view that there are some non-existent objects. (shrink)

The divine attributes of omniscience and omnipotence have faced objections to their very consistency. Such objections rely on reasoning parallel to semantic paradoxes such as the Liar or to set-theoretic paradoxes like Russell's paradox. With the advent of paraconsistent logics, dialetheism—the view that some contradictions are true—became a major player in the search for a solution to such paradoxes. This paper explores whether dialetheism, armed with the tools of paraconsistent logics, has the resources to respond to the objections levelled against (...) the divine attributes. (shrink)

The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between P and , is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of (...) contraction. I first motivate philosophically this idea with the metaphysical picture of the states-of-affairs expressed by paradoxical sentences as being distinctively . I then proceed to demonstrate that the theory of truth resulting from this metaphysical picture is, in many philosophically interesting respects, surprisingly stronger than most other theories of truth endorsing the equivalence between P and (for example, the theory vindicates the validity of the traditional laws of excluded middle and of non-contradiction, and also vindicates the traditional constraint of truth preservation on logical consequence). I conclude by proving a cutelimination theorem that shows the consistency of the theory. (shrink)

The main aim is to extend the range of logics which solve the set-theoretic paradoxes, over and above what was achieved by earlier work in the area. In doing this, the paper also provides a link between metacomplete logics and those that solve the paradoxes, by finally establishing that all M1-metacomplete logics can be used as a basis for naive set theory. In doing so, we manage to reach logics that are very close in their axiomatization to that of the (...) logic R of relevant implication. A further aim is the use of metavaluations in a new context, expanding the range of application of this novel technique, already used in the context of negation and arithmetic, thus providing an alternative to traditional model theoretic approaches. (shrink)

In this paper, we distinguish two versions of Curry's paradox: c-Curry, the standard conditional-Curry paradox, and v-Curry, a validity-involving version of Curry's paradox that isn’t automatically solved by solving c-curry. A unified treatment of curry paradox thus calls for a unified treatment of both c-Curry and v-Curry. If, as is often thought, c-Curry paradox is to be solved via non-classical logic, then v-Curry may require a lesson about the structure—indeed, the substructure—of the validity relation itself.

ABSTRACT In ‘Properties, Propositions, and Conditionals’ Field [2021] advances further on our understanding of the logic and meaning of naive theories – theories that maintain, in the face of paradox, basic assumptions about properties and propositions. His work follows in a tradition going back over 40 years now, of using Kripke fixed-point model constructions to show how naive schemas can be (Post) consistent, as long as one embeds in a non-classical logic. A main issue in all this research is the (...) question of finding a suitable conditional for the naive schemas, an implication connective that is well-behaved enough to be useful but weak enough to maintain coherence when there are paradoxes in the surrounding aether. Field takes several cues from the exemplary work of Ross Brady. Brady's work is predominantly concerned with models for naive theories in relevant logic. Field's considered view is that ‘relevant conditionals are just the wrong tool for naive theories’ [ibid.: 140]. In this note, I reply that a relevant conditional is an indispensable tool for at least one very important job: giving identity conditions for properties. (shrink)

This is a general account of metavaluations and their applications, which can be seen as an alternative to standard model-theoretic methodology. They work best for what are called metacomplete logics, which include the contraction-less relevant logics, with possible additions of Conjunctive Syllogism, & →.A→C, and the irrelevant, A→.B→A, these including the logic MC of meaning containment which is arguably a good entailment logic. Indeed, metavaluations focus on the formula-inductive properties of theorems of entailment form A→B, splintering into two types, M1- (...) and M2-, according to key properties of negated entailment theorems. Metavaluations have an inductive presentation and thus have some of the advantages that model theory does, but they represent proof rather than truth and thus represent proof-theoretic properties, such as the priming property, if ├ A $\vee$ B then ├ A or ├ B, and the negated-entailment properties, not-├ ∼ and ├ ∼ iff ├ A and ├ ∼ B. Topics to be covered are their impact on naive set theory and paradox solution, and also Peano arithmetic and Godel’s First and Second Theorems. Interesting to note here is that the familiar M1- and M2-metacomplete logics can be used to solve the set-theoretic paradoxes and, by inference, the Liar Paradox and key semantic paradoxes. For M1-logics, in particular, the final metavaluation that is used to prove the simple consistency is far simpler than its correspondent in the model-theoretic proof in that it consists of a limit point of a single transfinite sequence rather than that of a transfinite sequence of such limit points, as occurs in the model-theoretic approach. Additionally, it can be shown that Peano Arithmetic is simply consistent, using metavaluations that constitute finitary methods. Both of these results use specific metavaluational properties that have no correspondents in standard model theory and thus it would be highly unlikely that such model theory could prove these results in their final forms. (shrink)

A new semantic paradox developed by Richard Heck and relying on very minimal logical and truth-theoretic resources is rehearsed. A theory of truth restricting the structural metarule of contraction is presented and some of the theory's relevant features are made explicit. It is then shown how the theory provides a principled solution to the paradox while preserving the extremely compelling truth-theoretic principles at stake, thus bringing out a significant advantage that the theory enjoys over virtually all other non-dialetheic theories. It (...) is finally argued that such advantage is amplified by theoretical considerations made available by the adoption of a correspondentist perspective in the philosophy of truth. (shrink)

We group the existing variants of the familiar set-theoretical and truth-theoretical paradoxes into two classes: connective paradoxes, which can in principle be ascribed to the presence of a contracting connective of some sort, and structural paradoxes, where at most the faulty use of a structural inference rule can possibly be blamed. We impute the former to an equivocation over the meaning of logical constants, and the latter to an equivocation over the notion of consequence. Both equivocation sources are tightly related, (...) and can be cleared up by adopting a particular substructural logic in place of classical logic. We then argue that our perspective can be justified via an informational semantics of contraction-free substructural logics. (shrink)

In other works, I’ve proposed a solution to the semantic paradoxes which, at the technical level, basically relies on failure of contraction. I’ve also suggested that, at the philosophical level, contraction fails because of the instability of certain states of affairs. In this paper, I try to make good on that suggestion.

We start by noting that the set-theoretic and semantic paradoxes are framed in terms of a definition or series of definitions. In the process of deriving paradoxes, these definitions are logically represented by a logical equivalence. We will firstly examine the role and usage of definitions in the derivation of paradoxes, both set-theoretic and semantic. We will see that this examination is important in determining how the paradoxes were created in the first place and indeed how they are to be (...) solved in a uniform way. There are three features that are special about these definitions used in the derivation of most of the above paradoxes. The first is the use of self-reference between the definiens and the definiendum, the second is the generality of the definiendum, and the third is the under-determination and over-determination of concepts that usually occur as a result of these definitions. We will examine the impact of these three features on the logical representation of definitions and show how this representation then leads to a uniform paradox solution using an appropriate logic that is both paraconsistent and paracomplete. However, it is the paracompleteness, exhibited through the rejection of the Law of Excluded Middle, together with the rejection of contraction principles, that enables the solution of the paradoxes to go through. We characterize definitions as involving syntactic identity and/or meaning identity. We point out that some paradoxes do not have explicit self-reference or circularity and some may not utilize the generality of the definiendum, but the general characterizations of definitions that we give will still apply. We also look beyond all this to paradoxes that rely on illicit definitions between objects that are essentially different to start with. (shrink)

In a recent series of papers, I and others have advanced new logical approaches to familiar paradoxes. The key to these approaches is to accept full classical logic, and to accept the principles that cause paradox, while preventing trouble by allowing a certain sort ofnontransitivity. Earlier papers have treated paradoxes of truth and vagueness. The present paper will begin to extend the approach to deal with the familiar paradoxes arising in naive set theory, pointing out some of the promises and (...) pitfalls of such an approach. (shrink)

The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with |$\wedge $|⁠, |$\vee $| and |$\sim $| as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B|$^{\textrm {d}}$|⁠. It is to be noted that Boolean negation (so, classical propositional logic) (...) is definable in the strongest element in the said class. (shrink)

Circular denitions have primarily been studied in revision theory in the classical scheme. I present systems of circular denitions in the Strong Kleene and supervaluation schemes and provide complete proof systems for them. One class of denitions, the intrinsic denitions, naturally arises in both schemes. I survey some of the features of this class of denitions.

Philosophical applications of familiar paracomplete and paraconsistent logics often rely on an idea of . With respect to the paraconsistent logic LP (the dual of Strong Kleene or K3), such is standardly cashed out via an LP-based nonmonotonic logic due to Priest (1991, 2006a). In this paper, I offer an alternative approach via a monotonic multiple-conclusion version of LP.

The goal of the paper is to discuss whether substructural non-contractive accounts of the truth-theoretic paradoxes can be philosophically motivated. First, I consider a number of explanations that have been offered to justify the failure of contraction and I argue that they are not entirely compelling. I then present a non-contractive theory of truth that I’ve proposed elsewhere. After looking at some of its formal properties, I suggest an explanation of the failure of structural contraction that is compatible with it.