====== Comments on Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics ======


Provides "a general method for a systematic and modular generation of cut-free calculi for thousands of paraconsistent logics known as Logics of Formal (In)consistency."

  * Why a general method?
  * Why thousands?
  * Who uses even one of them?

Method relies non-deterministic semantics!

Nós somos o [23] A. Neto and M. Finger. A KE tableau for a logic for formal inconsistency. In Proceedings of TABLEAUX’07 position papers and Workshop on Agents, Logic and Theorem Proving, volume LSIS.RR.2007.002,2007.

>> some analytic calculi have been introduced also for a few
other C-systems

a uniform and modular method for a **systematic generation of cut-free sequent calculi** for a large family of paraconsistent logics, which practically includes every C-system ever studied in the literature.

semantics provided in [[https://www.dropbox.com/s/dgsnh9fyd42l024/c-systems-publicado-1-s2.0-S0888613X06000636-main.pdf | 4-Avron-publicado 1.684]] (ou [[http://www.cs.tau.ac.il/~aa/articles/c-systems.pdf | 4-Avron]], [[http://dx.doi.org/10.1016/j.ijar.2006.06.011 | DOI]]) for this family. 


>> Is it "a fact of life that large knowledge bases are inherently inconsistent"? ow.ly/bpfBU