We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
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...
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
Davide Bresolin, Dario Della Monica, Valentin Gora...
First-order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently several se...
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...