Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Analytical Tableaux For Da Costás Hierarchy Of Paraconsistent Logics Cn, 1≤n<ω1|
|Abstract:||In this paper we present a new hierarchy of analytical tableaux systems TNDCn, 1≤n<ω, for da Costás hierarchy of propositional paraconsistent logics Cn, 1≤n<ω. In our tableaux formulation, we introduce da Costás "ball" operator "o", the generalized operators "k" and "(k)", for 1≤k, and the negations " ̃ k", for k≥1, as primitive operators, differently to what has been done in the literature, where these operators are usually defined operators. We prove a version of Cut Rule for the TNDCn, 1≤n<ω, and also prove that these systems are logically equivalent to the corresponding systems Cn, 1≤n<ω. The systems TNDCn constitute completely automated theorem proving systems for the systems of da Costás hierarchy C n, 1≤n<ω.|
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.