3145 search results - page 47 / 629 » Algebraic Linear Orderings |
146
click to vote
NDJFL
1998
15 years 5 months ago
1998
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
148
click to vote
ORDER
2002
15 years 5 months ago
2002
We show that: (1) For many regular cardinals (in particular, for all successors of singular strong limit cardinals, and for all successors of singular -limits), for all n {2, 3, ...
151
click to vote
CSR
2008
Springer
15 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...
140
click to vote
MLQ
2010
15 years 4 months ago
2010
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...
169
click to vote
DEXAW
2008
IEEE
16 years 9 days ago
2008
IEEE
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...