Abstract
We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also prove that weak quasi-o-minimality of a theory with respect to one definable linear order implies weak quasi-o-minimality with respect to any other such order.
Similar content being viewed by others
References
Belegradek, O., Peterzil, Y., Wagner, F.: Quasi-o-minimal structures. J. Symb. Logic 65(3), 1115–1132 (2000)
Kudaibergenov, KZh.: Weakly quasi-o-minimal models. Sib. Adv. Math. 20(4), 285–292 (2010)
Macpherson, D., Marker, D., Steinhorn, C.: Weakly o-minimal structures and real closed fields. Trans. Am. Math. Soc. 352(12), 5435–5483 (2000)
Mekler, A., Rubin, M., Steinhorn, C.: Dedekind completeness and the algebraic complexity of o-minimal structures. Can. J. Math. 44(4), 843–855 (1992)
Moconja, S., Tanović, P.: Monotone theories. arXiv preprint. arXiv:1811.05228v3 (2019)
Moconja, S., Tanović, P.: Stationarily ordered types and the number of countable models. Ann. Pure Appl. Logic 171(3), 102765 (2020). https://doi.org/10.1016/j.apal.2019.102765
Onshuus, A., Steinhorn, C.: On linearly ordered structures of finite rank. J. Math. Log. 9(2), 201–239 (2009)
Ramakrishnan, J., Steinhorn, C.: Definably extending partial orders in totally ordered structures. MLQ Math. Log. Q. 60(3), 205–210 (2014)
Simon, P.: On dp-minimal ordered structures. J. Symb. Logic 76(2), 448–460 (2011)
Tanović, P., Moconja, S., Ilić, D.: Around Rubin’s “Theories of linear order’’. J. Symb. Logic (2020). https://doi.org/10.1017/jsl.2020.68
Acknowledgements
The present paper is a considerably modified version of the preprint named Monotone theories [5]. It was written according to numerous comments and suggestions from the Referee, to whom we are greatly grateful as her/his help significantly improved the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
The first author was supported by the Narodowe Centrum Nauki grant no. 2016/22/E/ST1/00450, and by the Ministry of Education, Science and Technological Development of Serbia through University of Belgrade, Faculty of Mathematics.
The second author was supported by the Ministry of Education, Science and Technological Development of Serbia through Mathematical Institute of the Serbian Academy of Sciences and Arts.
Rights and permissions
About this article
Cite this article
Moconja, S., Tanović, P. Does weak quasi-o-minimality behave better than weak o-minimality?. Arch. Math. Logic 61, 81–103 (2022). https://doi.org/10.1007/s00153-021-00778-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-021-00778-3