We consider proof systems for effectively propositional logic. First, we show that propositional resolution for effectively propositional logic may have exponentially longer refuta...
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Sonic1 is the first prototype implementation of non-standard inferences for Description Logics that can be used via a graphical user interface. In addition to that our implementat...
We propose a new semantics for modeling belief, mixing conncepts from qualitative probabilistic and classical possible world accounts. Our belief structures are coherent sets of q...
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...