Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
DOWNEY, ROD
LEMPP, STEFFEN
and
WU, GUOHUA
2010.
ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS.
Journal of Mathematical Logic,
Vol. 10,
Issue. 01n02,
p.
83.
Moses, Michael
2011.
The Block Relation in Computable Linear Orders.
Notre Dame Journal of Formal Logic,
Vol. 52,
Issue. 3,
Harris, Charles M.
2015.
On limitwise monotonicity and maximal block functions.
Computability,
Vol. 4,
Issue. 2,
p.
119.
Hirschfeldt, Denis R.
2017.
Computability and Complexity.
Vol. 10010,
Issue. ,
p.
22.
Morozov, A. S.
2018.
A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains.
Siberian Mathematical Journal,
Vol. 59,
Issue. 3,
p.
463.
Frolov, A. N.
and
Zubkov, M. V.
2021.
Computable Linear Orders and Limitwise Monotonic Functions.
Journal of Mathematical Sciences,
Vol. 256,
Issue. 1,
p.
61.