1670 search results - page 118 / 334 » On Skolemization in constructive theories |
158
click to vote
LOGCOM
2010
15 years 4 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...
183
click to vote
NETWORKS
2010
15 years 4 months ago
2010
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
186
click to vote
IAT
2010
IEEE
15 years 4 months ago
2010
IEEE
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detec...
185
click to vote
FUIN
2010
15 years 3 months ago
2010
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
206
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...