The Kierstead's conjecture and limitwise monotonic functions (Q1709678)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Kierstead's conjecture and limitwise monotonic functions |
scientific article |
Statements
The Kierstead's conjecture and limitwise monotonic functions (English)
0 references
6 April 2018
0 references
A linear order is \(\Pi_1^0\)-rigid if it does not have any nontrivial \(\Pi_1^0\)-automorphism. Let \(\zeta, \eta\) are the order types integers and rational numbers, respectively. \textit{H. A. Kierstead} [J. Symb. Log. 52, 681--688 (1987; Zbl 0637.03043)] conjectured that every computable copy of a linear order \(\mathcal L\) has a strongly nontrivial \(\Pi_1^0\)-automorphism if and only if \(\mathcal L\) contains an interval of order type \(\eta\). In the paper under review, the authors prove this conjecture for linear orders whose order types are \(\Sigma_{q\in Q}F(q)\), where \(F\) is an extended \(\emptyset'\)-limitwise monotonic function, i.e. \(F\) can take the value \(\zeta\).
0 references
recursive linear order
0 references
automorphism
0 references
limitwise monotonic function
0 references