882 search results - page 1 / 177 » On self-embeddings of computable linear orderings |
62
Voted
APAL
2006
15 years 14 days ago
2006
The Dushnik
78
Voted
JSC
2010
14 years 10 months ago
2010
93
Voted
ORDER
2007
14 years 12 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....
96
Voted
CORR
2007
Springer
15 years 11 days 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...
100
Voted
NDJFL
1998
15 years 2 days 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 ...