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)
 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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,357
External links
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA
    Similar books and articles

    Monthly downloads

    Added to index


    Total downloads

    11 ( #112,987 of 1,088,832 )

    Recent downloads (6 months)

    1 ( #69,666 of 1,088,832 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature

    Start a new thread
    There  are no threads in this forum
    Nothing in this forum yet.