The orthodox view of logic takes for granted the central importance of logical principles. Logic, and thus logical reasoning, is to be understood as a system of rules or principles with universal application. Let us call this orthodox view logical generalism. In this paper we argue that logical generalism, whether monist or pluralist, is wrong. We then outline an account of logical consequence in the absence of general logical principles, which we call logical particularism.

Many advocates of non-classical logic for reasons external to mathematics claim that their proposed revisions are consistent with the use of classical logic within pure mathematics. Doubts are raised about such claims, concerning the applicability of pure mathematics to natural and social science. -/- .

Thought: A Journal of Philosophy, EarlyView.

The object of this paper is to examine two approaches to giving non-vacuous truth conditions for counterpossibles, counterfactuals with impossible antecedents. I first develop modifications of a Lewis-style sphere semantics with impossible worlds. I argue that this approach sanctions intuitively invalid inferences and is supported by philosophically problematic foundations. I then develop modifications of certain ceteris paribus conditional logics with impossible worlds. Tableaux are given for each of these in an appendix and soundness and completeness results are proved. While certain (...) of the latter systems are shown to have similar problems to logics from the first approach, at least one relatively weak system appears to offer an adequate uniform semantics for counterpossibles and counterfactuals. (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)

A world is trivial if it makes every proposition true all at once. Such a world is impossible, an absurdity. Our world, we hope, is not an absurdity. It is important, nevertheless, for semantic and metaphysical theories that we be able to reason cogently about absurdities—if only to see that they are absurd. In this note we describe methods for ‘observing’ absurd objects like the trivial world without falling in to incoherence, using some basic techniques from modal logic. The goal (...) is to begin to locate the trivial world’s relative position in modal space; the outcome is that the less we assume about relative possibility, the more detail we can discern at the edge of reason. (shrink)

Disagreeing with most authors on vagueness, the author proposes a solution that he calls ‘three-valued semantic pluralism’ to the age-old sorites paradox. In essence, it is a three-valued semantics for a first-order vague language with identity with the additional suggestion that a vague language has more than one correct interpretation. Unlike the traditional three-valued approach to a vague language, three-valued semantic pluralism can accommodate the phenomenon of higher-order vagueness and the phenomenon of penumbral connection when equipped with ‘suitable conditionals’. The (...) author also shows that three-valued semantic pluralism is a natural consequence of a restricted form of the Tolerance principle ) and a few related ideas, and argues that ) is well-motivated by considerations about how we learn, teach, and use vague predicates. (shrink)

In this paper, I will defend the claim that there are three existence properties: the second-order property of being instantiated, a substantive first-order property (or better a group of such properties) and a formal, hence universal, first-order property. I will first try to show what these properties are and why we need all of them for ontological purposes. Moreover, I will try to show why a Meinong-like option that positively endorses both the former and the latter first-order property is the (...) correct view in ontology. Finally, I will add some methodological remarks as to why this debate has to be articulated from the point of view of reality, i.e., by speaking of properties, rather than from the point of view of language, i.e., by speaking of predicates (for such properties). (shrink)

The aim of this paper is to give a general solution to the paradoxes of the material conditional, including the paradoxes generated by embedded conditionals. The solution consists in a pragmatic reinterpretation of the formal languages of classical logic LK and relevant logic LR as presented in Paoli. In particular I argue that the material conditional in the classical logic LK captures the truth conditions of “if...then”, but ignores certain pragmatic enrichments that are associated to it, while relevant logic LR (...) can give a systematic diagnostic of the cases in which a conditional is pragmatically enriched and those cases in which it is not. This diagnostic shows the reason why the paradoxes seem unacceptable and why they are, nevertheless, truth-preserving. This reinterpretation will also cover the solution that Paoli gives to McGee’s paradoxes of the Modus Ponens. (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)

This article advances the first semantics that is neither for nor against a default implicational link between the progressive and perfective forms, when it comes to solving the imperfective paradox. Depending on the doxastic context of its use, we contend that the progressive form sometimes allows and sometimes does not allow the inference of the corresponding simple form. In other words, the preparatory phase of an event might or might not be believed to lead to its culmination. Indeed, the context (...) can put constraints on beliefs about the time of the culmination and whether or not it allows this inference to be made. From a formal perspective, this new solution to the imperfective paradox combines a specific modal approach with an event-structure analysis originating in event semantics. Finally, this approach solves the associated difficulties that have plagued the most well-known theories in this field. (shrink)

We offer tableaux systems for logics of essence and accident and logics of non-contingency, showing their soundness and completeness for Kripke semantics. We also show an interesting parallel between these logics based on the semantic insensitivity of the two non-normal operators by which these logics are expressed.

Infinitists argue that their view outshines foundationalism because infinitism can, whereas foundationalism cannot, explain two of epistemic justification’s crucial features: it comes in degrees and it can be complete. I present four different ways that foundationalists could make sense of those two features of justification, thereby undermining the case for infinitism.

In this paper, I argue that Goff's view that universal consciousness grounds logical laws such as the law of non-contradiction cannot be true on the grounds that we cannot guarantee the classical logic loving nature of universal consciousness that Goff desires in order to ground logical laws. I will present three arguments to show this.

Most literature on vagueness deals with the phenomenon as applied to predicates. On the contrary, even the idea of vague connectives seems to be taken as an oxymoron. The goal of this article is to propose an understanding of vague logical connectives based on vague quantifiers. The main idea is that the phenomenon of vagueness translates to connectives in terms of the property of Abnormality. I also argue that Prior’s Tonk can, according to this approach, be considered a vague connective. (...) In order to do so, I provide a sound and complete interpretation for it, based on Strict-Tolerant semantics, in which Tonk has a non-normal truth-table. (shrink)

Book Review of Impossible Worlds, by Francesco Berto and Mark Jago. Oxford: Oxford University Press, 2019.

There was a time when 'logic' just meant classical logic. The climate is slowly changing and non-classical logic cannot be dismissed off-hand. However, a metatheory used to study the properties of non-classical logic is often classical. In this paper, we will argue that this practice of relying on classical metatheories is problematic. In particular, we will show that it is a bad practice because the metatheory that is used to study a non-classical logic often rules out the very logic it (...) is designed to study. (shrink)

According to methodological anti-exceptionalism, logic follows a scientific methodology. There has been some discussion about which methodology logic has. Authors such as Priest, Hjortland and Williamson have argued that logic can be characterized by an abductive methodology. We choose the logical theory that behaves better under a set of epistemic criteria. In this paper, I analyze some important discussions in the philosophy of logic, and I show that they presuppose different methodologies, involving different notions of evidence and different epistemic values. (...) I argue that, rather than having a specific methodology such as abductivism, logic can be characterized by methodological pluralism. This position can also be seen as the application of scientific pluralism to the realm of logic. (shrink)

Even though the strong relationship between proof-theoretic and model-theoretic notions in one’s logical theory can be shown by soundness and completeness proofs, whether we can define the model-theoretic notions by means of the inferences in a proof system is not at all trivial. For instance, provable inferences in a proof system of classical logic in the logical framework do not determine its intended models as shown by Carnap (Formalization of logic, Harvard University Press, Cambridge, 1943), i.e., there are non-Boolean models (...) that satisfy its provable inferences. In the literature, this is known as the Categoricity problem or Carnap’s problem. In this paper, we will discuss the Categoricity problem (or Carnap’s problem) for three-valued logics K3 and LP. We will provide three different restrictions on admissible models that will deliver us categoricity results, some of which draw from the solutions provided for the Categoricity problem for classical logic in Belnap and Massey (Stud Log 49(1):67–82, 1990) and Bonnay and Westerståhl (Erkenntis 81(4):721–739, 2016). We will then argue that two of those solutions are philosophically well-motivated: (1) restricting the admissible models where negation is interpreted as a Strong Kleene truth-function, and (2) restricting the admissible models where a complex formula is assigned the third value when its immediate subformulas are assigned the third value. (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 aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.

The paper suggests a modal predicate logic that deals with classical quantification and modalities as well as intermediate operators, like “most” and “mostly”. Following up the theory of generalized quantifiers, we will understand them as two-placed operators and call them determiners. Quantifiers as well as modal operators will be constructed from them. Besides the classical deduction, we discuss a weaker probabilistic inference “therefore, probably” defined by symmetrical probability measures in Carnap’s style. The given probabilistic inference relates intermediate quantification to singular (...) statements: “Most S are P” does not logically entail that a particular individual S is also P, but it follows that this is probably the case, where the probability is not ascribed to the propositions but to the inference. We show how this system deals with single case expectations while predictions of statistical statements remain generally problematic. (shrink)

Logical pluralism is commonly described as the view that there is more than one correct logic. It has been claimed that, in order for that view to be interesting, there has to be at least a potential for rivalry between the correct logics. This paper offers a detailed assessment of this suggestion. I argue that an interesting version of logical pluralism is hard, if not impossible, to achieve. I first outline an intuitive understanding of the notions of rivalry and correctness. (...) I then discuss a natural account of rivalry in terms of disagreement about validity claims and the argument from meaning variance that has been raised against it. I explore a more refined picture of the meaning of validity claims that makes use of the character-content distinction of classical two dimensional semantics. There are three ways in which pluralists can use that framework to argue for the view that different logics may be rivals but could nevertheless be equally correct. I argue that none of them is convincing. (shrink)

This paper sets out to evaluate the claim that Aristotle’s Assertoric Syllogistic is a relevance logic or shows significant similarities with it. I prepare the grounds for a meaningful comparison by extracting the notion of relevance employed in the most influential work on modern relevance logic, Anderson and Belnap’s Entailment. This notion is characterized by two conditions imposed on the concept of validity: first, that some meaning content is shared between the premises and the conclusion, and second, that the premises (...) of a proof are actually used to derive the conclusion. Turning to Aristotle’s Prior Analytics, I argue that there is evidence that Aristotle’s Assertoric Syllogistic satisfies both conditions. Moreover, Aristotle at one point explicitly addresses the potential harmfulness of syllogisms with unused premises. Here, I argue that Aristotle’s analysis allows for a rejection of such syllogisms on formal grounds established in the foregoing parts of the Prior Analytics. In a final section I consider the view that Aristotle distinguished between validity on the one hand and syllogistic validity on the other. Following this line of reasoning, Aristotle’s logic might not be a relevance logic, since relevance is part of syllogistic validity and not, as modern relevance logic demands, of general validity. I argue that the reasons to reject this view are more compelling than the reasons to accept it and that we can, cautiously, uphold the result that Aristotle’s logic is a relevance logic. (shrink)

There appears to be few, if any, limits on what sorts of logical connectives can be added to a given logic. One source of potential limitations is the motivating ideology associated with a logic. While extraneous to the logic, the motivating ideology is often important for the development of formal and philosophical work on that logic, as is the case with intuitionistic logic. One family of logics for which the philosophical ideology is important is the family of relevant logics. In (...) this paper, I explore the limits of what a relevant connective is, showing how some basic criteria motivated by the ideology of relevant logicians provide robust limits on potential connectives. These criteria provide some plausible necessary conditions on being a relevant connective. (shrink)

Mares and Goldblatt, 163–187, 2006) provided an alternative frame semantics for two quantified extensions of the relevant logic R. In this paper, I show how to extend the Mares-Goldblatt frames to accommodate identity. Simpler frames are provided for two zero-order logics en route to the full logic in order to clarify what is needed for identity and substitution, as opposed to quantification. I close with a comparison of this work with the Fine-Mares models for relevant logics with identity and a (...) discussion of constant and variable domains. (shrink)

In this paper, we build on earlier work by Standefer (Logic J IGPL 27(4):543–569, 2019) in investigating extensions of substructural logics, particularly relevant logics, with the machinery of justification logics. We strengthen a negative result from the earlier work showing a limitation with the canonical model method of proving completeness. We then show how to enrich the language with an additional operator for implicit commitment to circumvent these problems. We then extend the logics with axioms for D, 4, and 5, (...) which requires additional justification term operators, following the work of Pacuit (in proceedings of the fifth panhellenic logic symposium, 2005) and Rubtsova (in Grigoriev D, Harrison J (eds) Computer science—theory and applications, CSR 2006; J Logic Comput 16(5):671–684, 2006), and present the required modifications to the frame semantics. We present a simplification of the neighborhood frames from the earlier work and we close by investigating the distinctive contribution of the + operator to the logic. (shrink)

The forward convergence constraint is important to time analysis. Without it, given two future moments to the same point, the time branches. This is unacceptable if one assumes that time is linear. Nevertheless, one may wish to consider time-branching in order to discuss future possibilities. One can have both a linear order for the time and branching through the combination of the tense logic semantics with those of an alethic logic which allows the evaluation of the timelines of other possible (...) worlds. In this paper, I give the semantics and the tableaux systems for some alethic-tense logics. I review one in which worlds differ on their time orders, another in which they agree on the time order, a pair of conditional tense logics ), and the first-order version of MT. A brief philosophical discussion arises from every system. (shrink)

We consider a family of logical systems for representing entailment relations of various kinds. This family has its root in the logic of first-degree entailment formulated as a binary consequence system, i.e. a proof system dealing with the expressions of the form \, where both \ and \ are single formulas. We generalize this approach by constructing consequence systems that allow manipulating with sets of formulas, either to the right or left of the turnstile. In this way, it is possible (...) to capture proof-theoretically not only the entailment relation of the standard four-valued Belnap’s logic, but also its dual version, as well as some of their interesting extensions. The proof systems we propose are, in a sense, of a hybrid Hilbert–Gentzen nature. We examine some important properties of these systems and establish their completeness with respect to the corresponding entailment relations. (shrink)

The continental philosophy of non-classical logics is a relatively new field that seeks to determine whether any aspects of certain continental philosophers’ thinking can be characterized in terms of non-classical logics. Some of the main figures that have been examined so far are Martin Heidegger, Jacques Derrida, Gilles Deleuze, and François Laruelle. Although many of these studies are grounded in the writings of Graham Priest, who wrote some of the seminal texts in the field, Jc Beall’s work also features prominently (...) in a number of cases. After surveying this field and highlighting Beall’s influence within it, I claim that it can be substantially expanded by making further uses of Beall’s writings, especially ones that introduce non-classical logics in ways that are especially suitable for this particular field of study and also that discuss such topics as negation, subclassical logics, logical pluralism, and glutty futures. (shrink)

Deleuze never explicitly formulates his philosophy of logical truth‐values. It thus remains an open question as to the number and types he held there to be. Despite his explicit comments on these matters, additional textual evidence suggests that in his thinking on the event, he favored a third truth‐value, holding either the analetheic view that some truth‐bearers can be truth‐valueless or the dialetheic view that some truth‐bearers can be both true and false. I first argue that taking a logical approach (...) to Deleuze's thinking is feasible, despite his and others' claims that might suggest otherwise. Next, I examine his explicit statements to show that they cannot be taken at face value and that, rather, we need to transpose his claims into contemporary terminology in order to accurately assess them. I lastly turn to his Leibniz‐inspired philosophy of time to argue that the affirmations involved in this conception strongly suggest a dialetheic tendency in his thinking. (shrink)

This paper aims to call into question the customary division of logically revisionary responses to the truth-theoretic paradoxes into those that are “substructural” and those that are “ structural.” I proceed by examining, as a case study, Beall’s recent proposal based on the paraconsistent logic LP. Beall formulates his response to paradox in terms of a consequence relation that obeys all standard structural rules, though at the price of the language’s lacking a detaching conditional. I argue that the same response (...) to paradox can be given using a consequence relation that preserves detachment rules for a conditional, though at the price of restricting structural rules. The question “Is paradox being blocked by invoking a substructural consequence relation?” is thus ill-posed. The lesson of this example, I conclude, is that there is no useful explication of the idea of a substructural approach to paradox. (shrink)

One of the main logical functions of the truth predicate is to enable us to express so-called ‘infinite conjunctions’. Several authors claim that the truth predicate can serve this function only if it is fully disquotational, which leads to triviality in classical logic. As a consequence, many have concluded that classical logic should be rejected. The purpose of this paper is threefold. First, we consider two accounts available in the literature of what it means to express infinite conjunctions with a (...) truth predicate and argue that they fail to support the necessity of transparency for that purpose. Second, we show that, with the aid of some regimentation, many expressive functions of the truth predicate can actually be performed using truth principles that are consistent in classical logic. Finally, we suggest a reconceptualisation of deflationism, according to which the principles that govern the use of the truth predicate in natural language are largely irrelevant for the question of what formal theory of truth we should adopt. Many philosophers think that the paradoxes pose a special problem for deflationists; we will argue, on the contrary, that deflationists are in a much better position to deal with the paradoxes than their opponents. (shrink)

Epistemic logic is usually employed to model two aspects of a situation: the factual and the epistemic aspects. Truth, however, is not always attainable, and in many cases we are forced to reason only with whatever information is available to us. In this paper, we will explore a four-valued epistemic logic designed to deal with these situations, where agents have only knowledge about the available information, which can be incomplete or conflicting, but not explicitly about facts. This layer of available (...) information or evidence, which is the object of the agents’ knowledge, can be seen as a database. By adopting this sceptical posture in our semantics, we prepare the ground for logics where the notion of knowledge—or more appropriately, belief—is entirely based on evidence. The technical results include a set of reduction axioms for public announcements, correspondence proofs, and a complete tableau system. In summary, our contributions are twofold: on the one hand we present an intuition and possible application for many-valued modal logics, and on the other hand we develop a logic that models the dynamics of evidence in a simple and intuitively clear fashion. (shrink)

‘Feminist logic’ may sound like an impossible, incoherent, or irrelevant project, but it is none of these. We begin by delineating three categories into which projects in feminist logic might fall: philosophical logic, philosophy of logic, and pedagogy. We then defuse two distinct objections to the very idea of feminist logic: the irrelevance argument and the independence argument. Having done so, we turn to a particular kind of project in feminist philosophy of logic: Valerie Plumwood's feminist argument for a relevance (...) logic. Plumwood's work serves as our primary case study as we turn to the project of considering three different ways we might understand her argument and revisionist arguments like it: as a priori theorizing, as ameliorative conceptual engineering, or as instances of anti-exceptionalist approaches to logic. After arguing that the anti-exceptionalist approach seems to provide the most promising means of understanding the kind of project undertaken in a feminist challenge to classical logic, we briefly address the consequences that this might have for logic instruction. Here, we argue for the perhaps unexpected conclusion that feminist programs ought to offer more, not less, instruction in logic for those who take interest. (shrink)

It is part of the current wisdom that the Liar and similar semantic paradoxes can be taken care of by the use of certain non-classical multivalued logics. In this paper I want to suggest that bivalent logic can do just as well. This is accomplished by using a non-deterministic matrix to define the negation connective. I show that the systems obtained in this way support a transparent truth predicate. The paper also contains some remarks on the conceptual interest of such (...) systems. (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)

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.

Thought: A Journal of Philosophy, EarlyView.

The paper develops a set of quantified temporal alethic boulesic doxastic systems. Every system in this set consists of five parts: a ‘quantified’ part, a temporal part, a modal (alethic) part, a boulesic part and a doxastic part. There are no systems in the literature that combine all of these branches of logic. Hence, all systems in this paper are new. Every system is defined both semantically and proof-theoretically. The semantic apparatus consists of a kind of$$T \times W$$T×Wmodels, and the (...) proof-theoretical apparatus of semantic tableaux. The ‘quantified part’ of the systems includes relational predicates and the identity symbol. The quantifiers are, in effect, a kind of possibilist quantifiers that vary over every object in the domain. The tableaux rules are classical. The alethic part contains two types of modal operators for absolute and historical necessity and possibility. According to ‘boulesic logic’ (the logic of the will), ‘willing’ (‘consenting’, ‘rejecting’, ‘indifference’ and ‘non-indifference’) is a kind of modal operator. Doxastic logic is the logic of beliefs; it treats ‘believing’ (and ‘conceiving’) as a kind of modal operator. I will explore some possible relationships between these different parts, and investigate some principles that include more than one type of logical expression. I will show that every tableau system in the paper is sound and complete with respect to its semantics. Finally, I consider an example of a valid argument and an example of an invalid sentence. I show how one can use semantic tableaux to establish validity and invalidity and read off countermodels. These examples illustrate the philosophical usefulness of the systems that are introduced in this paper. (shrink)

In Paradoxa Stoicorum, the Roman philosopher Cicero defends six important Stoic theses. Since these theses seem counterintuitive, and it is not likely that the average person would agree with them, they were generally called "paradoxes". According to the third paradox, (P3), (all) transgressions (wrong actions) are equal and (all) right actions are equal. According to one interpretation of this principle, which I will call (P3′), it means that if it is forbidden that A and it is forbidden that B, then (...) not-A is as good as not-B; and if it is permitted that A and it is permitted that B, then A is as good as B. In this paper, I show how it is possible to prove this thesis in dyadic deontic logic. I also try to defend (P3′) against some philosophical counterarguments. Furthermore, I address the claim that (P3′) is not a correct interpretation of Cicero’s third paradox and the assertion that it does not matter whether (P3′) is true or not. I argue that it does matter whether (P3′) is true or not, but acknowledge that (P3′) is perhaps a slightly different principle than Cicero’s thesis. The upshot is that (P3′) seems to be a plausible principle, and that at least one part of paradox III in Cicero’s Paradoxa Stoicorum appears to be defensible. (shrink)

The Moral Law is fulfilled iff everything that ought to be the case is the case, and The Good is realised in a possible world w at a time t iff w is deontically accessible from w at t. In this paper, I will introduce a set of temporal modal deontic systems with propositional quantifiers that can be used to prove some interesting theorems about The Moral Law and The Good. First, I will describe a set of systems without any (...) propositional quantifiers. Then, I will show how these systems can be extended by a couple of propositional quantifiers. I will use a kind of TxW semantics to describe the systems semantically and semantic tableaux to describe them syntactically. Every system will include a constant · that stands for The Good. ‘·’ is read as ‘The Good is realised’. All systems that contain the propositional quantifiers will also include a constant '*' that stands for The Moral Law. '*' is read as ‘The Moral Law is fulfilled’. I will prove that all systems (without the propositional quantifiers) are sound and complete with respect to their semantics and that all systems (including the extended systems) are sound with respect to their semantics. It is left as an open question whether or not the extended systems are complete. (shrink)

In this paper, I will develop a set of boulesic-doxastic tableau systems and prove that they are sound and complete. Boulesic-doxastic logic consists of two main parts: a boulesic part and a doxastic part. By ‘boulesic logic’ I mean ‘the logic of the will’, and by ‘doxastic logic’ I mean ‘the logic of belief’. The first part deals with ‘boulesic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of boulesic expression: ‘individual x wants it to be (...) the case that’ and ‘individual x accepts that it is the case that’. The second part deals with ‘doxastic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of doxastic expression: ‘individual x believes that’ and ‘it is imaginable to individual x that’. Boulesic-doxastic logic investigates how these concepts are related to each other. Boulesic logic is a new kind of logic. Doxastic logic has been around for a while, but the approach to this branch of logic in this paper is new. Each system is combined with modal logic with two kinds of modal operators for historical and absolute necessity and predicate logic with necessary identity and ‘possibilist’ quantifiers. I use a kind of possible world semantics to describe the systems semantically. I also sketch out how our basic language can be extended with propositional quantifiers. All the systems developed in this paper are new. (shrink)

In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The (...) systems in this paper can be used to symbolise not only the doxastic states of perfectly rational individuals, but also the beliefs of finite humans. Proof-theoretically, I will use a tableau technique. Every system is combined with predicate logic with necessary identity and ‘possibilist’ quantifiers and modal logic with two kinds of modal operators for relative and absolute necessity. The semantics is a possible world semantics. Finally, I prove that every tableau system in the paper is sound and complete with respect to its semantics. (shrink)

In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will emerge that there is considerable open texture to the idea. In Section 2, I’ll give some examples of techniques for (...) developing paraconsistent logics. In Section 3, I’ll discuss what seem to me to be some promising applications of certain paraconsistent logics. In fact, however, I don’t think there’s all that much to the concept ‘paraconsistent’ itself; the collection of paraconsistent logics is far too heterogenous to be very productively dealt with under a single label. Perhaps that will emerge as we go. (shrink)

At least since [Frege, 1960] and [Geach, 1965], there has been some consensus about the relation between negation, the speech act of denial, and the attitude of rejection: a denial, the consensus has had it, is the assertion of a negation, and a rejection is a belief in a negation. Recently, though, there have been notable deviations from this orthodox view. Rejectivists have maintained that negation is to be explained in terms of denial or rejection, rather than vice versa. Some (...) other theorists have maintained that negation is a separate phenomenon from denial, and that neither is to be explained in terms of the other. In this paper, I present and consider these heterodox theories of the relation between negation, denial, and rejection. (shrink)

The recent development and exploration of mixed metainferential logics is a breakthrough in our understanding of nontransitive and nonreflexive logics. Moreover, this exploration poses a new challenge to theorists like me, who have appealed to similarities to classical logic in defending the logic ST, since some mixed metainferential logics seem to bear even more similarities to classical logic than ST does. There is a whole ST-based hierarchy, of which ST itself is only the first step, that seems to become more (...) and more classical at each level. I think this seeming is misleading: for certain purposes, anyhow, metainferential hierarchies give us no reason to move on from ST. ST is indeed only the first step on a grand metainferential adventure; but one step is enough. This paper aims to explain and defend that claim. Along the way, I take the opportunity also to develop some formal tools and results for thinking about metainferential logics more generally. (shrink)

The recent development and exploration of mixed metainferential logics is a breakthrough in our understanding of nontransitive and nonreflexive logics. Moreover, this exploration poses a new challenge to theorists like me, who have appealed to similarities to classical logic in defending the logic ST, since some mixed metainferential logics seem to bear even more similarities to classical logic than ST does. There is a whole ST-based hierarchy, of which ST itself is only the first step, that seems to become more (...) and more classical at each level. I think this seeming is misleading: for certain purposes, anyhow, metainferential hierarchies give us no reason to move on from ST. ST is indeed only the first step on a grand metainferential adventure; but one step is enough. This paper aims to explain and defend that claim. Along the way, I take the opportunity also to develop some formal tools and results for thinking about metainferential logics more generally. (shrink)

Here is a puzzle, which I learned from Terence Parsons in his “True Contradictions” [8]. First Degree Entailment is a logic which allows for truth value gaps as well as truth value gluts. If you are agnostic between assigning paradoxical sentences gaps and gluts, then this looks no different, in effect, from assigning them a gap value? After all, on both views you end up with a theory that doesn’t commit you to the paradoxical sentence or its negation. How is (...) the fde theory any different from the theory with gaps alone? In this paper, I will present a clear answer to this puzzle – an answer that explains how being agnostic between gaps and gluts is a genuinely different position than admitting gaps alone, by using the formal notion of a bi-theory, and showing that while such positions might agree on what is to be accepted, they differ on what is to be rejected. (shrink)