Studia Logica

, Volume 43, Issue 1–2, pp 75–78 | Cite as

Some definitions of negation leading to paraconsistent logics

  • M. W. Bunder


In positive logic the negation of a propositionA is defined byAX whereX is some fixed proposition. A number of standard properties of negation, includingreductio ad absurdum, can then be proved, but not the law of noncontradiction so that this forms a paraconsistent logic. Various stronger paraconsistent logics are then generated by putting in particular propositions forX. These propositions range from true through contingent to false.


Mathematical Logic Computational Linguistic Standard Property Paraconsistent Logic Positive Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. W. Bunder,A new hierachy of paraconsistent logics, in:A. I. Arruda, N. C. A. da Costa andA. M. Seite (eds.),Proceedings of the Brazilian Conference on Mathematical Logic, São Paulo, 1980.Google Scholar
  2. [2]
    N. C. A. da Costa,On the theory of inconsistent formal systems,Notre Dame Journal of Formal Logic, Vol. XV (1974) pp. 497–510.Google Scholar
  3. [3]
    N.C. A. da Costa andL. Dubikajtis,On Jaśkowski's discussive logic, in: A. I. Arruda, N. C. A. da Costa and R. Chuaqui (eds.)Non-classical Logics, Model Theory and Computability, North-Holland 1977.Google Scholar

Copyright information

© Polish Academy of Sciences 1984

Authors and Affiliations

  • M. W. Bunder
    • 1
  1. 1.Mathematics DepartmentThe University Of WollongongAustralia

Personalised recommendations