Does weak quasi-o-minimality behave better than weak o-minimality?

From MaRDI portal
Publication:2118170

DOI10.1007/S00153-021-00778-3zbMATH Open1504.03021arXiv1811.05228OpenAlexW3164911541MaRDI QIDQ2118170FDOQ2118170


Authors: Slavko Moconja, Predrag Tanović Edit this on Wikidata


Publication date: 22 March 2022

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1811.05228




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Does weak quasi-o-minimality behave better than weak o-minimality?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118170)