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 applied to a n formula φ(x̄) and a sequence ā of elements of the linear order, will determine whether or not φ(ā) is true in the structure. A linear order is decidable if the relations determined by all formulas are un...
