We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
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...
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...