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

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.

Revised version accepted for publication in Archive for Mathematical Logic

References in corpus (2)

• Stationarily ordered types and the number of countable models
• Around Rubin's "Theories of linear order"

Cited by in corpus (1)

• Weakly o-minimal types