DeepAI AI Chat
Log In Sign Up

On Logics of Perfect Paradefinite Algebras

by   Joel Gomes, et al.

The present study shows how any De Morgan algebra may be enriched by a 'perfection operator' that allows one to express the Boolean properties of negation-consistency and negation-determinedness. The corresponding variety of 'perfect paradefinite algebras' (PP-algebras) is shown to be term-equivalent to the variety of involutive Stone algebras, introduced by R. Cignoli and M. Sagastume, and more recently studied from a logical perspective by M. Figallo and L. Cantú. Such equivalence then plays an important role in the investigation of the 1-assertional logic and also the order-preserving logic asssociated to the PP-algebras. The latter logic, which we call PP≤, happens to be characterised by a single 6-valued matrix and consists very naturally in a Logic of Formal Inconsistency and Formal Undeterminedness. The logic PP≤ is here axiomatised, by means of an analytic finite Hilbert-style calculus, and a related axiomatization procedure is presented that covers the logics of other classes of De Morgan algebras as well as super-Belnap logics enriched by a perfection connective.


page 1

page 2

page 3

page 4


Logics of involutive Stone algebras

An involutive Stone algebra (IS-algebra) is a structure that is simultan...

Finite axiomatizability of logics of distributive lattices with negation

This paper focuses on order-preserving logics defined from varieties of ...

First-order swap structures semantics for some Logics of Formal Inconsistency

The logics of formal inconsistency (LFIs, for short) are paraconsistent ...

Algebraizability of the Logic of Quasi-N4-Lattices

The class of quasi-N4-lattices (QN4-lattices) was introduced as a common...

Finite two-dimensional proof systems for non-finitely axiomatizable logics

The characterizing properties of a proof-theoretical presentation of a g...

How to Make a New Logic

We discuss about how to make a new logic with considering a slogan: take...

Rapid Prototyping Formal Systems in MMT: 5 Case Studies

Logical frameworks are meta-formalisms in which the syntax and semantics...