In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly t...
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 ...
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...