 
Possible-translations semantics (extended abstract)
In: W. A. Carnielli, F. M. Dionísio, and P. Mateus, editors,
Proceedings of the Workshop on Combination of Logics: Theory and Applications
(CombLog'04),
held in Lisbon, Portugal, 28–30 July 2004, pp.119–128.
A generous formulation of the notion of possible-translations representation as a special way
of splitting and splicing logics. Canonical entailment relations are shown to be characterizable in terms of
this form of combination.
Referred at: CSB.
(Extended version available
at CLC)
Overture:
Paraconsistent Logics
In: João Marcos, Diderik Batens, and Walter A. Carnielli,
organizers, Proceedings of the Workshop on Paraconsistent Logic
(WoPaLo), held in Trento,
Italy, 5-9 August 2002, as part of the 14th European Summer School on
Logic, Language and Information
(ESSLLI 2002), pp.1–10.
Introduction to the workshop: blitzsurvey of paraconsistency, its origin, development and
worthiness, and descriptions of the other papers.
(Preprint available
at CLE e-prints)
  Ex
contradictione non sequitur quodlibet
(with W.
A. Carnielli)
In: R. L. Epstein,
editor, Proceedings of the 2nd Annual Conference on Reasoning and Logic, v.I,
held in Bucharest, Romania, July 2000, pp.89-109.
Advanced Reasoning Forum, 2001.
A very basic philosophically-minded yet down-to-earth introduction
to the LFIs, the Logics of Formal Inconsistency.
Referred at: CSB.
(Preprint available
at RUG, BARK)
Non-truth-functional
fibred semantics
(extended abstract, with C.
Caleiro)
In: H. R. Arabnia, editor, Proceedings
of the 2001 International Conference on Artificial Intelligence
(IC-AI'2001),
v.II, held in Las Vegas, USA, June 2001, pp.841–847. CSREA
Press, 2001.
This is devoted to the problem of combining logics whose operators
are not necessarily truth-functional. An application to the first-orderfying
of propositional paraconsistent logics is worked out in some detail.
Referred at: Citeseer; CSB.
(Preprint available
at CLC,
CMSRA
homepage, RUG)
Tableau
systems for logics of formal inconsistency
(extended abstract, with
W.
A. Carnielli)
In: H. R. Arabnia, editor, Proceedings
of the 2001 International Conference on Artificial Intelligence
(IC-AI'2001),
v.II, held in Las Vegas, USA, June 2001, pp.848–852. CSREA
Press, 2001.
We show how interesting tableaux (some even admitting loops without
losing decidability) can be associated to some particularly appealing propositional
paraconsistent logics.
Referred at: Citeseer; CSB.
(Preprint available
at CMSRA homepage)
|
