26 search results - page 4 / 6 » Unary PCF is Decidable |
CSL
2010
Springer
13 years 6 months ago
2010
Springer
d Abstract) Thomas Schwentick and Thomas Zeume TU Dortmund University The finite satisfiability problem for two-variable logic over structures with unary relations and two order re...
IFIP
1994
Springer
13 years 10 months ago
1994
Springer
We consider three notions of factorization arising in different frameworks: factorizing languages, factorization of the natural numbers, factorizing codes. A language X A is call...
CSL
2008
Springer
13 years 7 months ago
2008
Springer
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
SIAMCOMP
2008
13 years 5 months ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
INFORMATICALT
2007
13 years 5 months ago
2007
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...