Linear orders with distinguished function symbol (Q1005923): Difference between revisions

This paper studies the computable categoricity of linear orderings with a monotone function on them. That is, give a structure \((L,<, f)\), where \((L,<)\) is a linear ordering and \(f\) is a unary function symbol, when can we say that the structure is computably categorical? The authors consider two types of structures. First, they consider structures where \((L,<)\) is isomorphic to the order type of the rationals, and \(f\) is monotone and fixed-point free. They obtain the following result. Given such a structure, say that two elements are equivalent if their orbits under the application of \(f\) have the same least upper bound. It is shown that such a structure is computably categorical if and only if there are finitely many equivalence classes under this equivalence relation. Second, they consider structures where \((L,<)\) is isomorphic to the ordering on the natural numbers and \(f\) is non-decreasing. In this case, various sufficient and necessary conditions for computable categoricity are given. But the questions does not seem to have a straight simple answer as in the case of the rationals.