19 search results - page 3 / 4 » Completeness of the finitary Moss logic |
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Coalgebras for a functor on the category of sets subsume many formulations of the notion of transition system, including labelled transition systems, Kripke models, Kripke frames a...
LOGCOM
2010
13 years 3 months ago
2010
This paper provides sound and complete logical systems for several fragments of English which go beyond syllogistic logic in that they use verbs as well as other limited syntactic...
DLT
1993
13 years 6 months ago
1993
We concider an extened algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotoni...
EJC
2008
13 years 4 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
LOGCOM
2010
13 years 3 months ago
2010
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...