#### Topics from this paper

#### 70 Citations

Revision based total semantics for extended normal logic programs

- Mathematics
- 2013

Dissertacao para obtencao do Grau de Doutor em
Matematica - Logica e Fundamentos da Matematica

Is there a zande logic

- Mathematics
- 1998

The issue of what consequences to draw from the existence of non-classical logical systems has been the subject of an interesting debate across a diversity of fields. In this paper the matter of al...

On the Usefulness of Paraconsistent Logic

- Mathematics, Computer Science
- Logic, Thought and Action
- 2005

This paper examines some intuitive motivations to develop a para-consistent logic, and employs, in particular, bivaluations and truth-tables to characterise this logic. Expand

A paraconsistent view on B and S5

- Computer Science
- Advances in Modal Logic
- 2016

This paper shows that the famous modal logics B and S5, can be viewed as paraconsistent logics with several particularly useful properties. Expand

A Taxonomy of C-systems

- Mathematics
- 2001

A thorough investigation of the foundations of paraconsistent logics. Relations between logical principles are formally studied, a novel notion of consistency is introduced, the logics of formal… Expand

Paraconsistency and the need for infinite semantics

- Computer Science
- Soft Comput.
- 2019

We show that most of the paraconsistent logics which have been investigated in the literature have no finite characteristic matrices, and in the most important cases not even finite characteristic… Expand

On Paraconsistent Extensions of C1

- Mathematics, Computer Science
- Electron. Notes Theor. Comput. Sci.
- 2015

It is shown that logic C1 cannot be extended to a paraconsistent logic in which the substitution theorem is valid, but C1 can be extended by adding some desirable properties as axioms by using three-valued logics. Expand

Outline of a Paraconsistent Category Theory

- Mathematics
- 2004

In this paper, we show how a certain kind of paraconsistent category theory can be developed. We also want to contribute to a better knowledge of Oubina’s and Bosch’s work in category theory.

Paraconsistency: Towards a tentative interpretation

- Philosophy
- 2001

In this expository paper, we examine some philosophical and technical issues brought by paraconsistency (such as, motivations for developing a paraconsistent logic, the nature of this logic, and its… Expand

An Application of Clasp in the Study of Logics

- Computer Science
- LPNMR
- 2011

We show how to use the Answer Set Programming (ASP) tool called clasp to prove that there exists a unique three-valued paraconsistent logic that satisfies the substitution property and is sound with… Expand

#### References

SHOWING 1-10 OF 35 REFERENCES

Paraconsistent logics as a formalism for reasoning about inconsistent knowledge bases

- Computer Science
- Artif. Intell. Medicine
- 1989

Various alternative schemes for paraconsistent reasoning are discussed and it is shown how it applies to the design of large knowledge bases and databases in expert systems where incosistent information may often be present. Expand

A survey of Paraconsistent Logic (1)

- Computer Science
- 1980

This paper constitutes a first attempt to sistematize the present state of the development of para-consistent logic, as well as the main topics and open questions related to it. As we want this paper… Expand

The first axiomatization of relevant logic

- Mathematics, Computer Science
- J. Philos. Log.
- 1992

This is a review, with historical and critical comments, of a paper by I. E. Orlov from 1928, which gives the oldest known axiomatization of the implication-negation fragment of the relevant logic R.… Expand

What is Negation in a System

- Mathematics
- 1987

Publisher Summary The notion of negation is basic to any formal or informal logical system. When any such system is presented, it is presented either as a system without negation or as a system with… Expand

Propositional sequence-calculi for inconsistent systems

- Mathematics, Computer Science
- Notre Dame J. Formal Log.
- 1968

A hierarchy of propositional calculi Cn(l ^ n ^ ω) whose decidability has not been settled yet is built, and a new hierarchy of decidable calculi with the same essential properties of the Cw are constructed. Expand

Many-Valued Logics

- Mathematics
- 1994

Introduction 1. The classical logic 2. The third logical value of Lukasiewicz 3. Logic algebras and matrices 4. Many-valuedness 5. Lukasiewicz logics 6. Post logics 7. Three-valuedness of Kleene and… Expand

Th eorie de la valuation', Appendix 2 in

- Logiques Classiques et Non Classiques
- 1995

Du Pont's paradox and the problem of intensional logic

- Logica' 93 -Proceedings of the 7th International Symposium, Prague, Academy of Sciences of the Czech Republic
- 1994

Du Pont's paradox and the problem of intensional logic

- Logica' 93 -Proceedings of the 7th International Symposium, Prague, Academy of Sciences of the Czech Republic
- 1994