abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
In this paper we present a new approach to reason about actions and causation which is based on a conditional logic. The conditional implication is interpreted as causal implicati...
We consider logical expressions built on the single binary connector of implication and a finite number of literals (boolean variables and their negations). We prove that asympto...