In the present paper we prove that the poset of all extensions of the logic defined by a class of matrices whose sets of distinguished values are equationally definable by their algebra reducts is the retract, under a Galois connection, of the poset of all subprevarieties of the prevariety generated by the class of the algebra reducts of the matrices involved. We apply this general result to the problem of finding and studying all extensions of the logic of paradox. In (...) order to solve this problem, we first study the structure of prevarieties of Kleene lattices. Then, we show that the poset of extensions of the logic of paradox forms a four-element chain, all the extensions being finitely many-valued and finitely-axiomatizable logics. There are just two proper consistent extensions of the logic of paradox. The first is the classical logic that is relatively axiomatized by the Modus ponens rule for the material implication. The second extension, being intermediate between the logic of paradox and the classical logic, is the one relatively axiomatized by the Ex Contradictione Quodlibet rule. (shrink)

Justification logics are constructive analogues of modal logics. They are often used as epistemic logics, particularly as models of evidentialist justification. However, in this role, justification (and modal) logics are defective insofar as they represent justification with a necessity-like operator, whereas actual evidentialist justification is usually probabilistic. This paper first examines and rejects extant candidates for solving this problem: Milnikel’s Logic of Uncertain Justifications, Ghari’s Hájek–Pavelka-Style Justification Logics and a version of probabilistic justification logic developed by Kokkinis et al. It (...) then proposes a new solution to the problem in the form of a justification logic that incorporates the essential features of both a fuzzy logic and a probabilistic logic. (shrink)

Motivated by supplying a new strategy for connexive logic and a better semantics for conditionals so that negating a conditional amounts to negating its consequent under the condition, we propose a new semantics for connexive conditional logic, by combining Kleene’s three-valued logic and a slight modification of Stalnaker’s semantics for conditionals. In the new semantics, selection functions for selecting closest worlds for evaluating conditionals can be undefined. Truth and falsity conditions for conditionals are then supplemented with a precondition that the (...) selection function is defined. Based on the new semantics, we define six conditional logics by different classes of models, using two notions of validity, one preserving truth and the other preserving tolerant truth. We prove soundness and completeness of these logics and compare them with some conditional logics in the literature. Our partial function plus precondition strategy may be used in other semantic frameworks to generate more connexive logics. (shrink)

Ultralogic as Universal was drafted in 1976, appeared in 1977 as ‘Ultralogic as Universal?’ in The Relevance Logic Newsletter, 2 (1–2) and was reprinted as an appendix to Exploring Meinong’s Jungle...

This paper explores taste fragmentalism, a novel approach to matters of taste and faultless disagreement. The view is inspired by Kit Fine’s fragmentalism about time, according to which the temporal dimension can be constituted—in an absolute manner—by states that are pairwise incompatible, provided that they do not obtain together. In the present paper, we will apply this metaphysical framework to taste states. In our proposal, two incompatible taste states (such as the state of rhubarb’s being tasty and the state of (...) rhubarb’s being distasteful) can both constitute reality in an absolute manner, although no agent can have joint access to both states. We will then develop a formalised version of our view by means of an exact truthmaker semantics for taste assertions. Within this framework—we argue—our linguistic and inferential practices concerning cases of faultless disagreement are elegantly vindicated, thus suggesting that taste fragmentalism is worth of further consideration. (shrink)

Dialetheists believe some sentences are both true and false. Objectors have argued that this makes it unclear how people can disagree with each other because, given the dialetheist’s commitments, if I make a claim and you tell me my claim is false, we might both be correct. Graham Priest (2006a) thinks that people disagree by rejecting or denying what is said rather than ascribing falsehood to it. We build on the work of Julien Murzi and Massimiliano Carrara (2015) and show (...) that Priest’s approach cannot succeed: given the same dialetheist’s commitments you may be correct to reject a claim that I correctly believe. We argue further that any attempt to solve the problem by identifying a new attitude of disagreement will also fail. The culprit, we claim, is the attempt to find a pair of attitudes that satisfy ‘exclusivity’—that is, attitudes such that both cannot be simultaneously correct. Instead of identifying disagreement by the kinds of attitudes involved, we propose dialetheists focus on the normative landscape and identify it in part by whether parties have reasons to change their attitudes. We offer our own normative theory of disagreement to help dialetheists with this challenge. (shrink)

We investigate a hitherto under-considered avenue of response for the logical pluralist to collapse worries. In particular, we note that standard forms of the collapse arguments seem to require significant order-theoretic assumptions, namely that the collection of admissible logics for the pluralist should be closed under meets and joins. We consider some reasons for rejecting this assumption, noting some prima facie plausible constraints on the class of admissible logics which would lead a pluralist admitting those logics to resist such closure (...) conditions. (shrink)

By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

This paper puts forth a class of algebraic structures, relativized Boolean algebras (RBAs), that provide semantics for propositional logic in which truth/validity is only defined relative to a local domain. In particular, the join of an event and its complement need not be the top element. Nonetheless, behavior is locally governed by the laws of propositional logic. By further endowing these structures with operators—akin to the theory of modal Algebras—RBAs serve as models of modal logics in which truth is relative. (...) In particular, modal RBAs provide semantics for various well-known awareness logics and an alternative view of possibility semantics. (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)

Philosophy and Literature is an internationally renowned refereed journal founded by Denis Dutton at the University of Canterbury, Christchurch. It is now published by the Johns Hopkins University Press. Since its inception in 1976, Philosophy and Literature has been concerned with the relation between literary and philosophical studies, publishing articles on the philosophical interpretation of literature as well as the literary treatment of philosophy. Philosophy and Literature has sometimes been regarded as iconoclastic, in the sense that it repudiates academic pretensions, (...) insidious jargon and institutional vogue. Dutton, who remains the editor, still writes a regular column. A distinctive feature of Philosophy and Literature was the annual Bad Writing Contest, held from 1995–98, which sought to identify (and publish) the ‘most stylistically lamentable passages’ of academic prose, often to great amusement. (shrink)

Why must incompatibility be symmetric? An odd question, but recent work in the semantics of non-classical logic, which appeals to the notion of incompatibility as a primitive and defines negation in terms of it, has brought this question to the fore. Francesco Berto proposes such a semantics for negation argues that, since incompatibility must be symmetric, double negation introduction must be a law of negation. However, he offers no argument for the claim that incompatibility really must be symmetric. Here, I (...) provide such an argument, showing that, insofar as we think of incompatibility in normative pragmatic terms, it can play its basic pragmatic function only if it is symmetric. The upshot is that we can vindicate Berto’s claim about the symmetry of incompatibility but only if we, pace Berto, think about incompatibility, in the first instance, as a pragmatic relation between acts rather than a semantic relation between contents. (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)

Incoherence is usually regarded as a bad thing. Incoherence suggests irrationality, confusion, paradox. Incoherentism disagrees: incoherence is not always a bad thing, sometimes we ought to be incoherent. If correct, Incoherentism has important and controversial implications. It implies that rationality does not always require coherence. Dilemmism and Incoherentism both embrace conflict in epistemology. After identifying some important differences between these two ways of embracing conflict, I offer some reasons to prefer Incoherentism over Dilemmism. Namely, that Incoherentism allows us to deliberate (...) about what we ought to believe using ordinary epistemology, and it does a better job of accommodating the positive features of incoherence. (shrink)

This paper concerns the paraconsistent logic LPQ⊃,F and an application of it in the area of relational database theory. The notions of a relational database, a query applicable to a relational database, and a consistent answer to a query with respect to a possibly inconsistent relational database are considered from the perspective of this logic. This perspective enables among other things the definition of a consistent answer to a query with respect to a possibly inconsistent database without resort to database (...) repairs. In an earlier paper, LPQ⊃,F is presented with a sequent-style natural deduction proof system. In this paper, a sequent calculus proof system is presented instead because such proof systems are generally considered more suitable as the basis of proof search procedures than natural deduction proof systems and proof search procedures can serve as the core of algorithms for computing consistent answers to queries. (shrink)

An argument for the rationality of religious belief in the existence of God is defended. After reviewing three preconditions for rational belief, I show reasons to privilege the criterion of consistency. Taking the inconsistency of the religious belief in God and the belief in the scientific world picture as the impediment to a rational belief in God, I propose that we can overcome this objection by assuming, firstly, that God is a universal class. This allows us to put the problem (...) of God in set-theoretic terms, such that the antinomy that follows from such an assumption can be overcome by assuming that God is not a subject but a strict class that cannot be individuated. I conclude that that the self-contradictory nature of God does not prevent the believer from making a rational, ethical assessment that the contradiction resides in the possibility of using language to explain his existence, but that this does not make belief in the existence of God unjustifiable – on the contrary. In this way, we can say statements that claim God exists are justifiable. (shrink)

Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic is (...) paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (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)

The aim of this article is to show that, just like in recent years Cobreros, Égré, Ripley and van Rooij provided a non-transitive counterpart of classical logic (meaning by this that all classically acceptable inferences are valid, but Cut and other metainferences are not) the same can be done for every Tarskian logic, with full generality. In order to establish this fact, we take a semantic approach, by showing that appropriate structures can be devised to characterize a non-transitive counterpart of (...) every Tarskian logic, starting from the logical matrices that are usually taken to render them. (shrink)

This book proposes a novel theory of truth and falsity. It argues that truth is a form of reference and falsity is a form of reference failure. -/- Most of the philosophical literature on truth concentrates on certain ontological and epistemic problems. This book focuses instead on language. By utilizing the Fregean idea that sentences are singular referring expressions, the author develops novel connections between the philosophical study of truth and falsity and the huge literature in in the philosophy of (...) language on the notion of reference. The first part of the book constructs the author’s theory and argues for it in length. Part II addresses the ways in which the theory relates to, and is different from, some of the basic theories of truth. Part III takes up how to account for the truth of sentences with logical operators and quantifiers. Finally, Part IV discusses the applications and implications of the theory for longstanding problems in philosophy of language, metaphysics, and epistemology. -/- A Referential Theory of Truth and Falsity will appeal to researchers and advanced students working in philosophy of language, epistemology, metaphysics, and linguistics. -/- . (shrink)

In this first volume of The Sylvan Jungle, the editors present a scholarly edition of the first chapter, "Exploring Meinong's Jungle," of Richard Routley's 1000-plus page book, Exploring Meinong's Jungle and Beyond. Going against the Quinean orthodoxy, Routley’s aim was to support Meinong’s idea that we can truthfully refer to non-existent and even impossible objects, like Superman, unicorns and the round-square cupola on Berkeley College. The tools of non-classical logic at Routley’s disposal enabled him to update Meinong’s project for a (...) new generation. This volume begins with an Introduction from Dominic Hyde, “The ‘Jungle Book’ in Context,” an essay that situates Exploring Meinong’s Jungle and Beyond historically. We provide the original Preface by Routley, followed by Chapter 1: “Exploring Meinong’s Jungle and Beyond.” In Chapter 2, Nicholas Griffin argues that Sylvan’s project was insufficiently radical with his essay, “Why the Original Theory of Items Didn’t Go Far Enough.” Sylvan revisits his position from this time in Chapter 3, with his article, “Re-Exploring Item-Theory.” Filippo Casati, who has worked in the Routley Archives then takes up the question of the future of Sylvan’s research program in his essay, “The Future Perfect of Exploring Meinong’s Jungle.” Iconic and iconoclastic Australian philosopher Richard Routley published Exploring Meinong’s Jungle and Beyond in 1980. This work has fallen out of print, yet without great fanfare it has influenced two generations of philosophers and logicians. (shrink)

Per il dialeteismo ci sono contraddizioni vere. Questa concezione filosofica ha assunto una forma chiara e definita a partire dal lavoro del filosofo e logico Graham Priest – uno dei suoi padri fondatori, nonché uno dei suoi più strenui difensori. Questo libro intende portare il dialeteismo all’attenzione di un ampio pubblico, che non sia solo quello degli addetti ai lavori. Il volume è suddiviso in due parti. La prima include le cinque lezioni su "Dialeteismo e storia della filosofia" tenute da (...) Priest e Filippo Casati a Padova nel 2016, in occasione del Corso di Eccellenza per il dottorato in filosofia dell’Università di Padova. La seconda contiene quattro contributi sul dialeteismo di autori italiani. (shrink)

What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

Ultralogic as Universal? is a seminal text in non-classcial logic. Richard Routley presents a hugely ambitious program: to use an 'ultramodal' logic as a universal key, which opens, if rightly operated, all locks. It provides a canon for reasoning in every situation, including illogical, inconsistent and paradoxical ones, realized or not, possible or not. A universal logic, Routley argues, enables us to go where no other logic—especially not classical logic—can. Routley provides an expansive and singular vision of how a universal (...) logic might one day solve major problems in set theory, arithmetic, linguistics, physics, and more. It circulated in typescript in the late 1970s before appearing as the Appendix to Exploring Meinong's Jungle and Beyond. With engaging, forceful prose, unsparing criticism of entrenched institutions, and many tantalizing proof sketches, Ultralogic? has had a major influence on the development of paraconsistent and relevant logic. This new edition makes this work available for a modern audience, newly typeset and corrected, along with extensive notes, and new commentary essays. (shrink)

In a series of works, Pablo Cobreros, Paul Égré, David Ripley and Robert van Rooij have proposed a nontransitive system (call it ‘_K__3__L__P_’) as a basis for a solution to the semantic paradoxes. I critically consider that proposal at three levels. At the level of the background logic, I present a conception of classical logic on which _K__3__L__P_ fails to vindicate classical logic not only in terms of structural principles, but also in terms of operational ones. At the level of (...) the theory of truth, I raise a cluster of philosophical difficulties for a _K__3__L__P_-based system of naive truth, all variously related to the fact that such a system proves things that would seem already by themselves repugnant, even in the absence of transitivity. At the level of the theory of validity, I consider an extension of the _K__3__L__P_-based system of naive validity that is supposed to certify that validity in that system does not fall short of naive validity, argue that such an extension is untenable in that its nontriviality depends on the inadmissibility of a certain irresistible instance of transitivity (whence the advertised “final cut”) and conclude on this basis that the _K__3__L__P_-based system of naive validity cannot coherently be adopted either. At all these levels, a crucial role is played by certain metaentailments and by the extra strength they afford over the corresponding entailments: on the one hand, such strength derives from considerations that would seem just as compelling in a general nontransitive framework, but, on the other hand, such strength wreaks havoc in the particular setting of _K__3__L__P_. (shrink)

The paper is concerned with a logical difficulty which Lionel Shapiro’s deflationist theory of logical consequence (as well as the author’s favoured, non-deflationist theory) gives rise to. It is argued that Shapiro’s non-contractive approach to solving the difficulty, although correct in its broad outlines, is nevertheless extremely problematic in some of its specifics, in particular in its failure to validate certain intuitive rules and laws associated with the principle of modus ponens. An alternative non-contractive theory is offered which does not (...) suffer from the same problem. (shrink)

G. Priest's anti-consistency argument (Priest 1979, 1984, 1987) and J. R. Lucas's anti-mechanist argument (Lucas 1961, 1968, 1970, 1984) both appeal to Gödel incompleteness. By way of refuting them, this paper defends the thesis of quartet compatibility, viz., that the logic of the mind can simultaneously be Gödel incomplete, consistent, mechanical, and recursion complete (capable of all means of recursion). A representational approach is pursued, which owes its origin to works by, among others, J. Myhill (1964), P. Benacerraf (1967), J. (...) Webb (1980, 1983) and M. Arbib (1987). It is shown that the fallacy shared by the two arguments under discussion lies in misidentifying two systems, the one for which the Gödel sentence is constructable and to be proved, and the other in which the Gödel sentence in question is indeed provable. It follows that the logic of the mind can surpass its own Gödelian limitation not by being inconsistent or non-mechanistic, but by being capable of representing stronger systems in itself; and so can a proper machine. The concepts of representational provability, representational maximality, formal system capacity, etc., are discussed. (shrink)

We introduce a two-valued and a three-valued truth-valuational substitutional semantics for the Quantified Argument Calculus (Quarc). We then prove that the 2-valid arguments are identical to the 3-valid ones with strict-to-tolerant validity. Next, we introduce a Lemmon-style Natural Deduction system and prove the completeness of Quarc on both two- and three-valued versions, adapting Lindenbaum’s Lemma to truth-valuational semantics. We proceed to investigate the relations of three-valued Quarc and the Predicate Calculus (PC). Adding a logical predicate T to Quarc, true of (...) all singular arguments, allows us to represent PC quantification in Quarc and translate PC into Quarc, preserving validity. Introducing a weak existential quantifier into PC allows us to translate Quarc into PC, also preserving validity. However, unlike the translated systems, neither extended system can have a sound and complete proof system with Cut, supporting the claim that these are basically different calculi. (shrink)

Many topics have not been covered, in most cases because I don't know quite what to say about them. Would it be possible to add a decidability predicate to the language? What about stronger connectives, like exclusion negation or Lukasiewicz implication? Would an expanded language do better at expressing its own semantics? Would it contain new and more terrible paradoxes? Can the account be supplemented with a workable notion of inherent truth (see note 36)? In what sense does stage semantics (...) lie “between” fixed point and stability semantics? In what sense, exactly, are our semantical rules inconsistent? In what sense, if any, does their inconsistency resolve the problem of the paradoxes?The ideals of strength, grounding, and closure together define an intuitively appealing conception of truth. Nothing would be gained by insisting that it was the intuitive conception of truth, and in fact recent developments make me wonder whether such a thing exists. However that may be, until the alternatives are better understood it would be foolish to attempt to decide between them. Truth gives up her secrets slowly and grudgingly, and loves to confound our presumptions. (shrink)

Stephen Read has presented an argument for the inconsistency of the concept of validity. We extend Read’s results and show that this inconsistency is but one half of a larger problem. Like the concept of truth, validity is infected with what we call semantic pathology, a condition that actually gives rise to two symptoms: inconsistency and indeterminacy. After sketching the basic ideas behind semantic pathology and explaining how it manifests both symptoms in the concept of truth, we present cases that (...) establish the indeterminacy of validity and that link this indeterminacy with the concept’s inconsistency. Our conclusion is that an adequate treatment of the semantic pathology thus revealed must deal with both of its symptoms. Further, it must extend to the occurrences of this condition elsewhere: in the concept of truth, in the other central semantic notions, and even in certain philosophical concepts outside semantics. (shrink)

There are various ways of achieving an enlarged understanding of a concept of interest. One way is by giving its proper definition. Another is by giving something else a proper definition and then using it to model or formally represent the original concept. Between the two we find varying shades of grey. We might open up a concept by a direct lexical definition of the predicate that expresses it, or by a theory whose theorems define it implicitly. At the other (...) end of the spectrum, the modelling-this-as-that option also admits of like variation, ranging from models rooted in formal representability theorems to models conceived of as having only heuristic value. There exist on both sides of this divide further differences still. In one of them, both the definiendum and definiens of a definition are words or phrases of some common natural language. In others, the item of interest is a natural language expression and its representation is furnished by the artificial linguistic system that models it. The modern history of these approaches is both very large and growing. Much of this evolution has given too short a shrift to the history of the demotion of ‘intuitive’ concepts in favour of the artificially contrived ones intended to model them. A working assumption of this article is that in the absence of a good understanding of what motivated the modelling-turn in the foundations of mathematics and the intuitive theory of truth, the whole notion of formal representability will have been inadequately understood. In the interests of space, I will concentrate on seminal issues in set theory as dealt with by Russell and Frege, and in the theory of truth in natural languages as dealt with by Tarski. The nub of the present focus is the representational role of model theory in the logics of formalized languages. (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)

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)

Thought: A Journal of Philosophy, EarlyView.

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)

Are there ‘self-referential’ propositions? That is, propositions that say of themselves that they have a certain property, such as that of being false. There can seem reason to doubt that there are. At the same time, there are a number of reasons why it matters. For suppose that there are indeed no such propositions. One might then hope that while paradoxes such as the Liar show that many plausible principles about sentences must be given up, no such fate will befall (...) principles about propositions. But the existence of self-referential propositions would dash such hopes. Further, the existence of such propositions would also seem to challenge the widespread claim that Liar sentences fail to express propositions. The aim of this paper is thus to settle the question–at least given an assumption. In particular, I argue that if propositions are structured, then self-referential propositions exist. (shrink)

The notion of a proposition is central to philosophy. But it is subject to paradoxes. A natural response is a hierarchical account and, ever since Russell proposed his theory of types in 1908, this has been the strategy of choice. But in this paper I raise a problem for such accounts. While this does not seem to have been recognized before, it would seem to render existing such accounts inadequate. The main purpose of the paper, however, is to provide a (...) new hierarchical account that solves the problem. (shrink)

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)

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.

In this paper, we shall consider the so-called cancellation view of negation and the inferential role of contradictions. We will discuss some of the problematic aspects of negation as cancellation, such as its original presentation by Richard and Valery Routley and its role in motivating connexive logic. Furthermore, we will show that the idea of inferential ineffectiveness of contradictions can be conceptually separated from the cancellation model of negation by developing a system we call qLPm, a combination of Graham Priest’s (...) minimally inconsistent Logic of Paradox with q-entailment as introduced by Grzegorz Malinowski. (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)