Linear orders with distinguished function symbol (Q1005923): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00153-008-0112-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2066080230 / rank | |||
Normal rank |
Revision as of 09:36, 20 March 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