882 search results - page 2 / 177 » On self-embeddings of computable linear orderings |
RTA
2000
Springer
13 years 9 months ago
2000
Springer
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
RTA
2000
Springer
13 years 9 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
WG
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
CSR
2008
Springer
13 years 7 months ago
2008
Springer
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...