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

From MaRDI portal
Publication:2118170




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.









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)