882 search results - page 1 / 177 » On self-embeddings of computable linear orderings |
APAL
2006
13 years 11 months ago
2006
The Dushnik
JSC
2010
13 years 9 months ago
2010
ORDER
2007
13 years 10 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....
CORR
2007
Springer
13 years 11 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
NDJFL
1998
13 years 10 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 ...