Literal-paraconsistent and literal-paracomplete matrices

Simple item page
dc.contributor.authorLewin, Renato A.
dc.contributor.authorMikenberg, Irene F.
dc.date.accessioned2025-01-21T01:06:28Z
dc.date.available2025-01-21T01:06:28Z
dc.date.issued2006
dc.description.abstractWe 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. (c) 2006 WILEY-VCH Verlag GmbH & Co. KGaA. Weinheim.
dc.fuente.origenWOS
dc.identifier.doi10.1002/malq.200510044
dc.identifier.issn0942-5616
dc.identifier.urihttps://doi.org/10.1002/malq.200510044
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/96162
dc.identifier.wosidWOS:000241897300008
dc.issue.numero5
dc.language.isoen
dc.pagina.final493
dc.pagina.inicio478
dc.revistaMathematical logic quarterly
dc.rightsacceso restringido
dc.subjectparaconsistency
dc.subjectparacompleteness
dc.subjectlogical matrix
dc.subjectLeibniz relation-operator
dc.titleLiteral-paraconsistent and literal-paracomplete matrices
dc.typeartículo
dc.volumen52
sipa.indexWOS
sipa.trazabilidadWOS;2025-01-12
Files
Collections
Artículos de revistas