Linear orders with distinguished function symbol (Q1005923): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Effective categoricity of equivalence structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computably categorical structures and expansions by constants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Autostability of models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3931264 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3820590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively Categorical Linear Orderings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recursively rigid Boolean algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic properties of branching models / rank | |||
Normal rank |
Latest revision as of 04:23, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear orders with distinguished function symbol |
scientific article |
Statements
Linear orders with distinguished function symbol (English)
0 references
17 March 2009
0 references
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.
0 references
computably categorical
0 references
linear order
0 references