## 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 frame
Literal-paraconsistent and literal-paracomplete matrices
โ Scribed by Renato A. Lewin; Irene F. Mikenberg
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 202 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
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 the class of all these matrices, we give conditions for the maximality of these logics and we study in detail several relevant examples. (ยฉ 2006 WILEYโVCH Verlag GmbH & Co. KGaA, Weinheim)
๐ SIMILAR VOLUMES
## 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
## Abstract As our language of evaluation changes, so do the metaphors we use to describe our work. In this chapter, the author discusses how examining metaphors in language of individuals and groups offers insight into how people frame and resolve problems.
The Liter and the Cubic Decimeter. H