472 search results - page 27 / 95 » Limiting Negations in Formulas |
CADE
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
LICS
2007
IEEE
14 years 4 months ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
ECSQARU
2003
Springer
14 years 3 months ago
2003
Springer
While AGM belief revision identifies belief states with sets of formulas, proposals for iterated revision are usually based on more complex belief states. In this paper we investi...
DIMACS
1996
13 years 11 months ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...