Does weak quasi-o-minimality behave better than weak o-minimality?
Logic
2021-06-01 v4
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.
Cite
@article{arxiv.1811.05228,
title = {Does weak quasi-o-minimality behave better than weak o-minimality?},
author = {Slavko Moconja and Predrag Tanović},
journal= {arXiv preprint arXiv:1811.05228},
year = {2021}
}
Comments
Revised version accepted for publication in Archive for Mathematical Logic