Sciweavers

NDJFL
1998
81views more  NDJFL 1998»
14 years 3 days ago
An Undecidable Linear Order That Is n-Decidable for All n
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 ...
John Chisholm, Michael Moses