In 1977, R. B. Angell presented a logic for analytic containment, a notion of relevant implication stronger than Anderson and Belnap's entailment. In this paper I provide for the first time the logic of first degree analytic containment, as presented in [2] and [3], with a semantical characterization—leaving higher degree systems for future investigations. The semantical framework I introduce for this purpose involves a special sort of truth-predicates, which apply to pairs of collections of formulas instead of individual formulas, and (...) which behave in some respects like Gentzen's sequents. This semantics captures very general properties of the truth-functional connectives, and for that reason it may be used to model a vast range of logics. I briefly illustrate the point with classical consequence and Anderson and Belnap's tautological entailments. (shrink)

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

This paper is an experiment in Leibnizian analysis. The reader will recall that Leibniz considered all true sentences to be analytically so. The difference, on his account, between necessary and contingent truths is that sentences reporting the former are finitely analytic; those reporting the latter require infinite analysis of which God alone is capable. On such a view at least two competing conceptions of entailment emerge. According to one, a sentence entails another when the set of atomic requirements for the (...) first is included in the corresponding set for the other; according to the other conception, every atomic requirement of the entailed sentence is underwritten by an atomic constituent of the entailing one. The former conception is classical on the twentieth century understanding of the term; the latter is the one we explore here. Now if we restrict ourselves to the formal language of the propositional calculus, every sentence has a finite analysis into its conjunctive normal form. Semantically, then, every sentence of that language can be represented as a simple hypergraph, H, on the powerset of a universe of states. Entailment of the sort we wish to study can be represented as a known relation, subsumption between hypergraphs. Since the lattice of hypergraphs thus ordered is a DeMorgan lattice, the logic of entailment thus understood is the familiar system, FDE of first-degree entailment. We observe that, extensionalized, the relation of subsumption is itself a DeMorgan Lattice ordered by higher-order subsumption. Thus the semantic idiom that hypergraph-theory affords reveals a hierarchy of lattices capable of representing entailments of every finite degree. (shrink)

I provide a truthmaker semantics for Angell’s system of analytic implication and establish completeness.

We examine the relationship between the logics of nonsense of Bochvar and Halldén and the containment logics in the neighborhood of William Parry’s A I. We detail two strategies for manufacturing containment logics from nonsense logics—taking either connexive and paraconsistent fragments of such systems—and show how systems determined by these techniques have appeared as Frederick Johnson’s R C and Carlos Oller’s A L. In particular, we prove that Johnson’s system is precisely the intersection of Bochvar’s B 3 and Graham Priest’s (...) non-symmetrized connexive logic and that Oller’s system lies just beneath the intersection of B 3 and Priest’s paraconsistent L P. We conclude by examining Oller’s system in more depth, giving it a characterization in terms of L P and showing that it plays the same role to Harry Deutsch’s paraconsistent containment logic S that Aleksandr Zinov'ev’s S 1 plays with respect to A I. (shrink)

The hallmark of the deductive systems known as ‘conceptivist’ or ‘containment’ logics is that for all theorems of the form , all atomic formulae appearing in also appear in . Significantly, as a consequence, the principle of Addition fails. While often billed as a formalisation of Kantian analytic judgements, once semantics were discovered for these systems, the approach was largely discounted as merely the imposition of a syntactic filter on unrelated systems. In this paper, we examine a number of prima (...) facie unrelated deductive contexts in which Addition fails and attempt to harmonise them by developing a computational interpretation of conceptivist logics. (shrink)

The subsystem S of Parry's AI [10] (obtained by omitting modus ponens for the material conditional) is axiomatized and shown to be strongly complete for a class of three valued Kripke style models. It is proved that S is weakly complete for the class of consistent models, and therefore that Ackermann's rule is admissible in S. It also happens that S is decidable and contains the Lewis system S4 on translation — though these results are not presented here. S is (...) arguably the most relevant relevant logic known at this time to be decidable. (shrink)

How does metaphysical grounding interact with the truth-functions? I argue that the answer varies according to whether one has a worldly conception or a conceptual conception of grounding. I then put forward a logic of worldly grounding and give it an adequate semantic characterisation.

In early Buddhist logic, it was standard to assume that for any state of a ff airs there were four possibilities: that it held, that it did not, both, or neither. This is the catuskoti (or tetralemma). Classical logicians have had a hard time mak­ing sense of this, but it makes perfectly good sense in the se­mantics of various paraconsistent logics, such as First Degree Entailment. Matters are more complicated for later Buddhist thinkers, such as Nagarjuna, who appear to suggest (...) that none of these options , or more than one, may hold. The point of this paper is to examine the matter, including the formal logical machinery that may be appropriate. (shrink)