𝔖 Bobbio Scriptorium
✦   LIBER   ✦

First order theory for literal-paraconsistent and literal-paracomplete matrices

✍ Scribed by Renato A. Lewin; Irene F. Mikenberg

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
111 KB
Volume
56
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper a first order theory for the logics defined through literal paraconsistent‐paracomplete matrices is developed. These logics are intended to model situations in which the ground level information may be contradictory or incomplete, but it is treated within a classical framework. This means that literal formulas, i.e. atomic formulas and their iterated negations, may behave poorly specially regarding their negations, but more complex formulas, i.e. formulas that include a binary connective are well behaved. This situation may and does appear for instance in data bases (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

Literal-paraconsistent and literal-parac
Literal-paraconsistent and literal-paracomplete matrices
✍ Renato A. Lewin; Irene F. Mikenberg 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by

Algebraization of logics defined by lite
Algebraization of logics defined by literal-paraconsistent or literal-paracomplete matrices
✍ Eduardo Hirsh; Renato A. Lewin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

## Abstract We study the algebraizability of the logics constructed using literal‐paraconsistent and literal‐paracomplete matrices described by Lewin and Mikenberg in [11], proving that they are all algebraizable in the sense of Blok and Pigozzi in [3] but not finitely algebraizable. A characteriza