A reasoning method for a paraconsistent logic

Studia Logica 52 (2):281 - 289 (1993)
A proof method for automation of reasoning in a paraconsistent logic, the calculus C1* of da Costa, is presented. The method is analytical, using a specially designed tableau system. Actually two tableau systems were created. A first one, with a small number of rules in order to be mathematically convenient, is used to prove the soundness and the completeness of the method. The other one, which is equivalent to the former, is a system of derived rules designed to enhance computational efficiency. A prototype based on this second system was effectively implemented.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01058392
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,590
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

19 ( #258,456 of 2,168,526 )

Recent downloads (6 months)

1 ( #346,757 of 2,168,526 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums