Does weak quasi-o-minimality behave better than weak o-minimality?(Article)
- aFaculty of Mathematics, University of Belgrade, Studentski trg 16, Belgrade, 11000, Serbia
- bInstytut Matematyczny, Uniwersytet Wrocławski, pl. Grunwaldzki 2/4, Wrocław, 50-384, Poland
- cMathematical Institute SANU, Knez Mihailova 36, Belgrade, Serbia
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. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
Funding details
| Funding sponsor | Funding number | Acronym |
|---|---|---|
| 174026 | ||
| Narodowe Centrum Nauki | 2016/22/E/ST1/00450 | NCN |
-
1
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.
-
2
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.
- ISSN: 09335846
- Source Type: Journal
- Original language: English
- DOI: 10.1007/s00153-021-00778-3
- Document Type: Article
- Publisher: Springer Science and Business Media Deutschland GmbH
Moconja, S.; Instytut Matematyczny, Uniwersytet Wrocławski, pl. Grunwaldzki 2/4, Wrocław, Poland;
© Copyright 2022 Elsevier B.V., All rights reserved.