Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...