Abstract
We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York, St. Louis, San Francisco, Toronto, London, and Sydney (1967).
Shore R. A. and Marcone A., “The maximal linear extension theorem in second order arithmetic,” Arch. Math. Logic, vol. 50, no. 5–6, 543–564 (2011).
Shore R. A., Marcone A., and Montalbán A., “Computing maximal chains,” Arch. Math. Logic, vol. 51, no. 4, 615–660 (2012).
Montalbán A., “Computable linearizations of well-partial-orderings,” Order, vol. 24, no. 1, 39–48 (2007).
Shore R. A., Cholak P. A., and Dzhafarov D. D., “Computably enumerable partial orders,” arXiv:1110.4068v1 [math.LO]. 2011. 10 p.
Knight J. F., Harizanov V. S., and Jockusch C. G., Jr., “Chains and antichains in partial orderings,” Arch. Math. Logic, vol. 48, no. 1, 39–53 (2009).
Bazhenov N. A., Frolov A. N., Kalimullin I. Sh., and Melnikov A. G., “Computability of distributive lattices,” Sib. Math. J., vol. 58, no. 6, 959–970 (2017).
Zubkov M. V., “Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable η-like linear orders,” Sib. Math. J., vol. 58, no. 1, 80–90 (2017).
Zubkov M. V., “Initial segments of computable linear orders with additional computable predicates,” Algebra and Logic, vol. 48, no. 5, 321–329 (2009).
Frolov A. N., “Effective categoricity of computable linear orderings,” Algebra and Logic, vol. 54, no. 5, 415–417 (2015).
Frolov A. N., “Linear orderings of low degree,” Sib. Math. J., vol. 51, no. 5, 913–925 (2010).
Alaev P. E., Thurber J., and Frolov A. N., “Computability on linear orderings enriched with predicates,” Algebra and Logic, vol. 48, no. 5, 313–320 (2009).
Frolov A. N., “Δ0 2 -Copies of linear orderings,” Algebra and Logic, vol. 45, no. 3, 201–209 (2006).
Downey R. G., Kastermans B., and Lempp S., “On computable self-embeddings of computable linear orderings,” J. Symb. Log., vol. 74, no. 4, 1352–1366 (2009).
Moses M., “The block relation in computable linear orders,” Notre Dame J. Formal Logic, no. 3, 289–305 (2011).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2018 Morozov A.S.
The author was supported by the Russian Foundation for Basic Research (Grant 14–01–00376).
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, vol. 59, no. 3, pp. 587–595, May–June, 2018
Rights and permissions
About this article
Cite this article
Morozov, A.S. A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains. Sib Math J 59, 463–469 (2018). https://doi.org/10.1134/S0037446618030096
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446618030096