Sciweavers

825 search results - page 68 / 165
» Modal Logics with Counting
Sort
View
ECCC
2006
41views more  ECCC 2006»
13 years 7 months ago
On a syntactic approximation to logics that capture complexity classes
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 ...
Argimiro Arratia, Carlos E. Ortiz
AIML
2004
13 years 9 months ago
Complexity of Strict Implication
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...
Félix Bou
ENTCS
2010
120views more  ENTCS 2010»
13 years 8 months ago
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
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...
APAL
2004
91views more  APAL 2004»
13 years 7 months ago
First-order intensional logic
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...
Melvin Fitting
LOGCOM
1998
122views more  LOGCOM 1998»
13 years 7 months ago
Adding the Everywhere Operator to Propositional Logic
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...
David Gries, Fred B. Schneider