Defining Cognitive Logics by Non-Classical Tableau Rules

In the paper we propose a new approach to formalization of cognitive logics. By cognitive logics we understand supraclassical, but non-trivial consequence operations, defined in a propositional language. We extend some paradigm of tableau methods, in which classical consequence Cn is defined, to stronger logics - monotonic, as well as non-monotonic ones - by specific use of non-classical tableau rules. So far, in that context tableaus have been treated as a way of formalizing other approaches to supraclassical logics, but we use them autonomically to generate various consequence operations. It requires a description of the hierarchy of non-classical tableau rules that result in different supraclassical consequence operations, so we give it.