26 search results - page 2 / 6 » Unary PCF is Decidable |
AML
2006
14 years 11 months ago
2006
We prove that the existential theory of the Turing degrees, in the language with Turing reduction, 0, and unary relations for the classes in the generalized high/low hierarchy, is ...
99
Voted
LOPSTR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
103
Voted
IANDC
2007
14 years 11 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
SIAMCOMP
2008
14 years 11 months ago
2008
XML specifications often consist of a type definition (typically, a DTD) and a set of integrity constraints. It has been shown previously that such specifications can be inconsiste...
171
click to vote
POPL
2002
ACM
15 years 12 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...