825 search results - page 60 / 165 » Modal Logics with Counting |
CLIMA
2010
13 years 9 months ago
2010
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantif...
INFORMATICALT
2007
13 years 7 months ago
2007
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is...