In a previous work we studied, from the perspective ofAlgebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice language. We prove that this logic is algebraizable and investigate its algebraic models, which turn out to be distributive bilattices with (...) additional implication operations. We axiomatize and state several results on these new classes of algebras, in particular representation theorems analogue to the well-known one for interlaced bilattices. (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)

We develop a Priestley-style duality theory for different classes of algebras having a bilattice reduct. A similar investigation has already been realized by B. Mobasher, D. Pigozzi, G. Slutzki and G. Voutsadakis, but only from an abstract category-theoretic point of view. In the present work we are instead interested in a concrete study of the topological spaces that correspond to bilattices and some related algebras that are obtained through expansions of the algebraic language.

This paper discusses a dualization of Fitting's notion of a "cut-down" operation on a bilattice, rendering a "track-down" operation, later used to represent the idea that a consistent opinion cannot arise from a set including an inconsistent opinion. The logic of track-down operations on bilattices is proved equivalent to the logic d_Sfde, dual to Deutsch's system S_fde. Furthermore, track-down operations are employed to provide an epistemic interpretation for paraconsistent weak Kleene logic. Finally, two logics of sequential combinations of cut-and (...) track-down operations allow settling positively the question of whether bilattice-based semantics are available for subsystems of S_fde. (shrink)

We introduce a new product bilattice con- struction that generalizes the well-known one for interlaced bilattices and others that were developed more recently, allowing to obtain a bilattice with two residuated pairs as a certain kind of power of an arbitrary residuated lattice. We prove that the class of bilattices thus obtained is a variety, give a finite axiomatization for it and characterize the congruences of its members in terms of those of their lat- tice factors. Finally, we (...) show how to employ our product construction to define first-order definable classes of bi- lattices corresponding to any first-order definable subclass of residuated lattices. (shrink)

The paper contains some algebraic results on several varieties of algebras having an (interlaced) bilattice reduct. Some of these algebras have already been studied in the literature (for instance bilattices with conflation, introduced by M. Fit- ting), while others arose from the algebraic study of O. Arieli and A. Avron’s bilattice logics developed in the third author’s PhD dissertation. We extend the representation theorem for bounded interlaced bilattices (proved, among others, by A. Avron) to un- bounded bilattices (...) and prove analogous representation theorems for the other classes of bilattices considered. We use these results to establish categorical equivalences between these structures and well-known varieties of lattices. (shrink)

A recent paper by Jakl, Jung and Pultr succeeded for the first time in establishing a very natural link between bilattice logic and the duality theory of d-frames and bitopological spaces. In this paper we further exploit, extend and investigate this link from an algebraic and a logical point of view. In particular, we introduce classes of algebras that extend bilattices, d-frames and N4-lattices to a setting in which the negation is not necessarily involutive, and we study corresponding logics. (...) We provide product representation theorems for these algebras, as well as completeness, algebraizability results for the corresponding logics. (shrink)

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 theory of propositional identity which distinguishes necessarily equivalent propositions that differ in subject-matter. Rather than forming a Boolean lattice as in extensional and intensional semantic theories, the space of propositions forms a non-interlaced bilattice. After motivating a departure from tradition by way of a number of plausible principles for subject-matter, I will provide a Finean state semantics for a novel theory of propositions, presenting arguments against the convexity and nonvacuity constraints which Fine (2016, 2017a,b) introduces. I (...) will then move to compare the resulting logic of propositional identity (PI) with Correia’s (2016) logic of generalised identity (GI), as well as the first degree fragment of Angell’s (1989) logic of analytic containment (AC). The paper concludes by extending PI to include axioms and rules for a subject-matter operator, providing a much broader theory of subject-matter than the principles with which I will begin. (shrink)

In this paper, the notion of degree of inconsistency is introduced as a tool to evaluate the sensitivity of the Full Bayesian Significance Test (FBST) value of evidence with respect to changes in the prior or reference density. For that, both the definition of the FBST, a possibilistic approach to hypothesis testing based on Bayesian probability procedures, and the use of bilattice structures, as introduced by Ginsberg and Fitting, in paraconsistent logics, are reviewed. The computational and theoretical advantages of using (...) the proposed degree of inconsistency based sensitivity evaluation as an alternative to traditional statistical power analysis is also discussed. (shrink)

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)