Sistema paraconsistente LBPc¬I

Main Article Content

Manuel Sierra A.


incompatibility, weak negation, paraconsistent deductive system.


The language of the LBPc¬I system extends the language of the classical positive logic when including an operator of weak negation and an operator of incompatibility, and permit to define an operator of strong negation; this last one has all the characteristics of the classical negation. The system is characterized by a traditional semantics with which test that, with respect to the operator of weak negation, the system is paraconsistent. When the formulas involved in an argument behave classically, that is to say, are incompatible with his weak negation, then the weak negation behaves like the classical negation, but this requirement not always is necessary, the weak negation can precise be as powerful as the classical negation although the involved formulas do not behave classically.

MSC: 03Bxx, 03B53 


Download data is not yet available.
Abstract 383 | PDF (Español) Downloads 211


[1] N. Da Costa. Inconsistent Formal Systems. Curitiba: Editora UFPR, 1993.

[2] W. Carnielli and J. Marcos. A Taxonomy of C-Systems. En Paraconsistency: The LogicalWay to the Inconsistent. Lecture Notes in Pure and Applied Mathematics, New York: Ed. Marcel Dekker, 228, 2002.

[3] X. Caicedo. Elementos de lógica y calculabilidad. Bogotá: Universidad de los Andes, 1990.

[4] A. Hamilton. Lógica para matemáticos. Madrid: Paraninfo S.A., 1981.

[5] A. Tarski. Logic, semantics and metamathematics. Second edition, Indianapolis: Hackett Publ., 1983.

[6] M. Sierra. Lógica básica con afirmación alterna. Ingeniería y Ciencia, 1(1), 2005.

[7] L. Henkin. The completeness of the first order functional calculus. The journal of symbolic logic, 14(3), 1949.