26 search results - page 1 / 6 » Unary PCF is Decidable |
TCS
1998
13 years 10 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
CSL
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
CSL
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
AIML
2008
14 years 8 days ago
2008
A logic LTD is defined, inspired by [37]. It is syntactically like basic modal logic with an additional unary operator but it has an interval-based semantics on structures with arb...
IANDC
2008
13 years 11 months ago
2008
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...