In this paper we re-assess the philosophical foundation of Exactly True Logic ($$\mathcal {ET\!L}$$ ET L ), a competing variant of First Degree Entailment ($$\mathcal {FDE}$$ FDE ). In order to do this, we first rebut an argument against it. As the argument appears in an interview with Nuel Belnap himself, one of the fathers of $$\mathcal {FDE}$$ FDE, we believe its provenance to be such that it needs to be taken seriously. We submit, however, that the argument (...) ultimately fails, and that $$\mathcal {ET\!L}$$ ET L cannot easily be dismissed. We then proceed to give an overview of the research that was inspired by this logic over the last decade, thus providing further motivation for the study of $$\mathcal {ET\!L}$$ ET L and, more generally, of $$\mathcal {FDE}$$ FDE -related logics that result from semantical analyses alternative to Belnap’s canonical one. We focus, in particular, on philosophical questions that these developments raise. (shrink)

Sometimes it is worth using Tarski’s solution rather than merely mentioning it.

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a natural (...) dual of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)

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

Our question is: can we embed minimal negation in implicative logics weaker than I→? Previous results show how to define minimal negation in the positive fragment of the logic of relevance R and in contractionless intuitionistic logic. Is it possible to endow weaker positive logics with minimal negation? This paper prooves that minimal negation can be embedded in even such a weak system as Anderson and Belnap’s minimal positive logic.

The Belnap–Dunn logic is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Přenosil and Rivieccio. We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt (...) the point of view ofAlgebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family. In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies. (shrink)

Abstractionism in the philosophy of mathematics aims at deriving large fragments of mathematics by combining abstraction principles (i.e. the abstract objects $\S e_1, \S e_2$, are identical if, and only if, an equivalence relation $Eq_\S$ holds between the entities $e_1, e_2$) with logic. Still, as highlighted in work on the semantics for relevant logics, there are different ways theories might be combined. In exactly what ways must logic and abstraction be combined in order to get interesting mathematics? In this paper, (...) we investigate the matter by deriving the axioms of second-order Peano Arithmetic from Frege's Basic Law V (the extension of $F$ is identical with the extension of $G$ if, and only if, $F$ and $G$ are extensionally equivalent) in the presence of a relevant higher-order logic. The results are interesting. Not only must we take on logic as true, and not only must we apply our logic to abstraction principles, but also we have to apply our theory of abstraction back to the logic in order to arrive at arithmetic. Thus, what Abstractionism gives us is not simply what we get from abstraction via logic, but also what we get from logic via abstraction. (shrink)

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus (...) for the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

In one of their papers, Michael De and Hitoshi Omori observed that the notion of classical negation is not uniquely determined in the context of so-called Belnap-Dunn logic, and in fact there are 16 unary operations that qualify to be called classical negation. These varieties are due to different falsity conditions one may assume for classical negation. The aim of this paper is to observe that there is an interesting way to make sense of classical negation independent of falsity (...) conditions. We discuss two equivalent semantics, and offer a Hilbert-style system that is sound and complete with respect to the semantics. (shrink)

At least since Aristotle’s famous 'sea-battle' passages in On Interpretation 9, some substantial minority of philosophers has been attracted to the doctrine of the open future--the doctrine that future contingent statements are not true. But, prima facie, such views seem inconsistent with the following intuition: if something has happened, then (looking back) it was the case that it would happen. How can it be that, looking forwards, it isn’t true that there will be a sea battle, while also being true (...) that, looking backwards, it was the case that there would be a sea battle? This tension forms, in large part, what might be called the problem of future contingents. A dominant trend in temporal logic and semantic theorizing about future contingents seeks to validate both intuitions. Theorists in this tradition--including some interpretations of Aristotle, but paradigmatically, Thomason (1970), as well as more recent developments in Belnap, et. al (2001) and MacFarlane (2003, 2014)--have argued that the apparent tension between the intuitions is in fact merely apparent. In short, such theorists seek to maintain both of the following two theses: (i) the open future: Future contingents are not true, and (ii) retro-closure: From the fact that something is true, it follows that it was the case that it would be true. It is well-known that reflection on the problem of future contingents has in many ways been inspired by importantly parallel issues regarding divine foreknowledge and indeterminism. In this paper, we take up this perspective, and ask what accepting both the open future and retro-closure predicts about omniscience. When we theorize about a perfect knower, we are theorizing about what an ideal agent ought to believe. Our contention is that there isn’t an acceptable view of ideally rational belief given the assumptions of the open future and retro-closure, and thus this casts doubt on the conjunction of those assumptions. (shrink)

In this short note we show that the so-called Ambiguous Set (2019) is a subclass of the Double Refined Indeterminacy Neutrosophic Set (2017) and is a particular case of the Refined Neutrosophic Set (2013). Also, the Ambiguous Set is similar to the Quadripartitioned Neutrosophic Set (2016), and Belnap’s Four-Valued Logic (1975).

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)

A number of logicians and philosophers have turned their attention in recent years to the problem of developing a logic of interrogatives. Their work has thrown a great deal of light on the formal properties of questions and question-sentences and has led also to interesting innovations in our understanding of the structures of performatives in general and, for example, in the theory of presuppositions. When, however, we examine the attempts of logicians such as Belnap or Åqvist to specify what, (...) precisely, a question is, or what it is to ask or raise a question, then what we are offered is somewhat less illuminating. Two alternative reductionist accounts seem in particular to have gained most favor: questions are identified either as special sorts of statements, or as special sorts of requests. As we hope will become clear in what follows, neither of these accounts is even nearly adequate; and matters are not improved if questions are identified, by force majeure, as combinations of statements and requests. (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)

A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.

This paper assesses branching spacetime theories in light of metaphysical considerations concerning time. I present the A, B, and C series in terms of the temporal structure they impose on sets of events, and raise problems for two elements of extant branching spacetime theories—McCall’s ‘branch attrition’, and the ‘no backward branching’ feature of Belnap’s ‘branching space-time’—in terms of their respective A- and B-theoretic nature. I argue that McCall’s presentation of branch attrition can only be coherently formulated on a model (...) with at least two temporal dimensions, and that this results in severing the link between branch attrition and the flow of time. I argue that ‘no backward branching’ prohibits Belnap’s theory from capturing the modal content of indeterministic physical theories, and results in it ascribing to the world a time-asymmetric modal structure that lacks physical justification. (shrink)

There seems to be a minimal core that every theory wishing to accommodate the intuition that the future is open must contain: a denial of physical determinism (i.e. the thesis that what future states the universe will be in is implied by what states it has been in), and a denial of strong fatalism (i.e. the thesis that, at every time, what will subsequently be the case is metaphysically necessary).1 Those two requirements are often associated with the idea of an (...) objective temporal flow and the non-reality of the future. However, at least certain ways to frame the “openness” intuition do not rely on any of these. Branching Time Theory (BTT) is one such: it is compatible with the denial that time flow is objective and it is couched in a language with a (prima facie) commitment to an eternalist ontology. BTT, though, urges us to resist certain intuitions about the determinacy of future claims, which arguably do not lead either to physical determinism or to fatalism. Against BTT, supporters of the Thin Red Line Theory (TRL) argue that their position avoids determinism and fatalism, while also representing the fact that there is a future which is “special” because it is the one that will be the case. But starting with Belnap and Green 1994, some have objected to the tenability of TRL, mainly on metaphysical grounds. In particular, those argue that “positing a thin red line amounts to giving up objective indeterminism,”2 and that “has unacceptable consequences, ranging from a mistreatment of actuality to an inability to talk coherently about what would have happened had what is going to happen not taken place.”3 In this paper, we wish to reframe the.. (shrink)

I here present and defend what I call the Triviality Theory of Truth, to be understood in analogy with Matti Eklund’s Inconsistency Theory of Truth. A specific formulation of is defended and compared with alternatives found in the literature. A number of objections against the proposed notion of meaning-constitutivity are discussed and held inconclusive. The main focus, however, is on the problem, discussed at length by Gupta and Belnap, that speakers do not accept epistemically neutral conclusions of Curry derivations. (...) I first argue that the facts about speakers’ reactions to such Curry derivations do not constitute a problem for the Triviality Theory specifically. Rather, they follow from independent, uncontroversial facts. I then propose a solution which coheres with the theory as I understand it. Finally, I consider a normative reading of their objection and offer a response. (shrink)

This paper has two aims. First, it sets out an interpretation of the relevant logic E of relevant entailment based on the theory of situated inference. Second, it uses this interpretation, together with Anderson and Belnap’s natural deduc- tion system for E, to generalise E to a range of other systems of strict relevant implication. Routley–Meyer ternary relation semantics for these systems are produced and completeness theorems are proven. -/- .

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent logics once the right (...) set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

This paper develops a trivalent semantics for the truth conditions and the probability of the natural language indicative conditional. Our framework rests on trivalent truth conditions first proposed by Cooper (1968) and Belnap (1973) and it yields two logics of conditional reasoning: (i) a logic C of certainty-preserving inference; and (ii) a logic U for uncertain reasoning that preserves the probability of the premises. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework, and we (...) use the distinction between the two systems to cast light on the validity of inferences such as Modus Ponens, Or-To-If, and Conditional Excluded Middle. Specifically, the conditional behaves monotonically in C, but non-monotonically in U; Modus Ponens is valid in C, but valid in U only for non-nested conditionals. The result is a unified account of the semantics and epistemology of indicative conditionals that can be fruitfully applied to analyzing the validity of conditional inferences. (shrink)

The model of self-referential truth presented in this paper, named Revision-theoretic supervaluation, aims to incorporate the philosophical insights of Gupta and Belnap’s Revision Theory of Truth into the formal framework of Kripkean fixed-point semantics. In Kripke-style theories the final set of grounded true sentences can be reached from below along a strictly increasing sequence of sets of grounded true sentences: in this sense, each stage of the construction can be viewed as an improvement on the previous ones. I want (...) to do something similar replacing the Kripkean sets of grounded true sentences with revision-theoretic sets of stable true sentences. This can be done by defining a monotone operator through a variant of van Fraassen’s supervaluation scheme which is simply based on ω-length iterations of the Tarskian operator. Clearly, all virtues of Kripke-style theories are preserved, and we can also prove that the resulting set of “grounded” true sentences shares some nice features with the sets of stable true sentences which are provided by the usual ways of formalising revision. What is expected is that a clearer philosophical content could be associated to this way of doing revision; hopefully, a content directly linked with the insights underlying finite revision processes. (shrink)

Without directly addressing the Demarcation Problem for logic—the problem of distinguishing logical vocabulary from others—we focus on distinctive aspects of logical vocabulary in pursuit of a second goal in the philosophy of logic, namely, proposing criteria for the justification of logical rules. Our preferred approach has three components. Two of these are effectively Belnap’s, but with a twist. We agree with Belnap’s response to Prior’s challenge to inferentialist characterisations of the meanings of logical constants. Belnap argued that (...) for a logical constant to exist, its rules must be conservative over a previously given consequence relation and guarantee the uniqueness of the constant. The twist is that we require logical vocabulary to be provably conservative, not over a previously given formal consequence relation, but over a previously given meaningful vocabulary of a language. Uniqueness is also a feature defined in terms of provability: if two syntactically distinguished expressions are governed by the same rules, then formulas with them as main operators are interderivable. Belnap’s criteria are not only those for the existence of a logical constant, but more: they are what distinguishes logical vocabulary from all other expressions. It is the defining mark of a logical constant that it is provably conservative over the fragment of the language which excludes it and that its rules guarantee its uniqueness. The third component is the topic neutrality of logic. The provable conservativeness of logic over a previously given vocabulary of a language is motivated, in part, by appeal to molecularism in the theory of meaning. Molecularity is a feature endorsed by the theory of meaning as a whole, so it does not distinguish logical constants from other expressions. The same is true for conservativeness. We argue that molecularity, and hence conservativeness, are implicit presuppositions of speakers’ use of language: the addition of new vocabulary to a language is presupposed to be conservative. But this presupposition is one that we should be able reflectively to endorse (such as when attempting a rational reconstruction of the use of the vocabulary). Thus, where conservativeness is found to fail, this defect should be remedied and the use of the vocabulary corrected (as in classical negation) or excised altogether (as in pejoratives). We go on to characterise a notion of topic neutrality, which we argue applies to logical vocabulary. We then note that reflective endorsement of the conservativeness of a topic neutral vocabulary requires a proof that the vocabulary is conservative relative to any base vocabulary. Thus we require that logical vocabulary be demonstrably conservative. Allying this requirement, distinctive of logic, to a general consideration about the commitments of assertion yields a mode of justification for logical constants akin to some conceptions of Harmony, i.e., to the idea that the consequences of assertion of a logical complex need to be warranted by the grounds and ought to be the strongest consequences warranted by the grounds. Intuitionistic logic acquires a somewhat familiar justification but emanating from a new motivation. (shrink)

In this article I explore two accounts of the Fallacy of Many Questions made famous by the question "Have you stopped beating your wife?" The accounts are from the works of Lennart Aqvist and Noel Belnap, and the two authors differ in their accounts of the fallacy. Then I give my own account based on understanding a facet of erotetic logic, i. e., the logic of questions.

The recent literature on Nāgārjuna’s catuṣkoṭi centres around Jay Garfield’s (2009) and Graham Priest’s (2010) interpretation. It is an open discussion to what extent their interpretation is an adequate model of the logic for the catuskoti, and the Mūla-madhyamaka-kārikā. Priest and Garfield try to make sense of the contradictions within the catuskoti by appeal to a series of lattices – orderings of truth-values, supposed to model the path to enlightenment. They use Anderson & Belnaps's (1975) framework of First Degree Entailment. (...) Cotnoir (2015) has argued that the lattices of Priest and Garfield cannot ground the logic of the catuskoti. The concern is simple: on the one hand, FDE brings with it the failure of classical principles such as modus ponens. On the other hand, we frequently encounter Nāgārjuna using classical principles in other arguments in the MMK. There is a problem of validity. If FDE is Nāgārjuna’s logic of choice, he is facing what is commonly called the classical recapture problem: how to make sense of cases where classical principles like modus pones are valid? One cannot just add principles like modus ponens as assumptions, because in the background paraconsistent logic this does not rule out their negations. In this essay, I shall explore and critically evaluate Cotnoir’s proposal. In detail, I shall reveal that his framework suffers collapse of the kotis. Furthermore, I shall argue that the Collapse Argument has been misguided from the outset. The last chapter suggests a formulation of the catuskoti in classical Boolean Algebra, extended by the notion of an external negation as an illocutionary act. I will focus on purely formal considerations, leaving doctrinal matters to the scholarly discourse – as far as this is possible. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those (...) models. I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of (...) abstract algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (shrink)

Neutrosophy has been introduced some years ago by Florentin Smarandache as a new branch of philosophy dealing with “the origin, nature and scope of neutralities, as well as their interactions with different ideational spectra”. A variety of new theories have been developed on the basic principles of neutrosophy: among them is neutrosophic logics, a family of many-valued systems that can be regarded as a generalization of fuzzy logics. In this paper we present a critical introduction to neutrosophic logics, focusing on (...) the problem of defining suitable neutrosophic propositional connectives and discussing the relationship between neutrosophic logics and other well-known frameworks for reasoning with uncertainty and vagueness, such as (intuitionistic and interval-valued) fuzzy systems and Belnap’s logic. (shrink)

Trivalence is quite natural for deontic action logic, where actions are treated as good, neutral or bad.We present the ideas of trivalent deontic logic after J. Kalinowski and its realisation in a 3-valued logic of M. Fisher and two systems designed by the authors of the paper: a 4-valued logic inspired by N. Belnap’s logic of truth and information and a 3-valued logic based on nondeterministic matrices. Moreover, we combine Kalinowski’s idea of trivalence with deontic action logic based on (...) boolean algebra. (shrink)

In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. A syntactic characterization of (...) these logics is left for further work. In this paper, based on our previous work on a functionally complete extension of Belnap’s logic, we present a sound and complete tableau calculus for these logics. It crucially exploits the Cartesian nature of the four values, which is reflected in the fact that each proof consists of two tableaux. The bi-facial notion of truth of Z&S is thus augmented with a bi-facial notion of proof. We also provide translations between the logics for semi-classical negation and classical logic and show that an argument is valid in a logic for semi-classical negation just in case its translation is valid in classical logic. (shrink)

In this essay I give a complete join semi-lattice of possible display-equivalence schemes for Display Logic, using the standard connectives, and leaving fixed only the schemes governing the star. In addition to proving the completeness of this list, I offer a discussion of the basic properties of these schemes.

According to Roman Ingarden, transcendental idealism prevented Kant from "even undertaking an attempt" at elucidating freedom "in terms of the causal structure of the world." I show that this claim requires qualification. In a remarkable series of Critical-period Reflexionen (5611-4, 5616-9), Kant sketches a defense of the possibility of freedom that differs radically from his published ones by incorporating an indeterministic account of the phenomena. Anticipating Łukasiewicz, he argues that universal causal determination is consistent with an open future: if an (...) action is contingent, there is an infinite regress of determining causes, yet there is a prior time at which this infinite series of causes has not yet commenced. However, he concedes that on this account the unity of experience "cannot fully obtain in the case of free beings." The fact that Kant even contemplated the indeterministic theory may carry implications for interpreting the argument of the Second Analogy. (shrink)