131 search results - page 9 / 27 » On Monadic Theories of Monadic Predicates |
PODS
2004
ACM
15 years 9 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...
LISP
2006
14 years 9 months ago
2006
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
APAL
2005
14 years 9 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
RTA
1998
Springer
15 years 1 months ago
1998
Springer
The system FT
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...