Logical Weak Completions of Paraconsistent Logics

DOI10.1093/logcom/exn015zbMath1156.03025OpenAlexW2010968193MaRDI QIDQ3549315

Mauricio Osorio Galindo, José Ramón Enrique Arrazola Ramírez, José Luis Carballido

Publication date: 22 December 2008

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn015

zbMATH Keywords

modal logicsstable semanticsparaconsistent logicsnonmonotonic semantics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Paraconsistent logics (03B53)

Related Items

Revisiting da Costa logic, Quasi-classical reasoning in paraconsistent databases, Modular Paracoherent Answer Sets, Paracoherent Answer Set Semantics meets Argumentation Frameworks, Better Paracoherent Answer Sets with Less Resources, Revisiting \(\mathbb Z\), Paracoherent answer set computation, Equivalence for the \(G_3^\prime\)-stable models semantics, On paraconsistent extensions of \(C_1\), Semi-equilibrium models for paracoherent answer set programs