Authors: Moconja, Slavko
Tanović, Predrag 
Affiliations: Mathematics 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Does weak quasi-o-minimality behave better than weak o-minimality?
Journal: Archive for Mathematical Logic
Issue Date: 29-May-2021
Rank: ~M22
ISSN: 0933-5846
DOI: 10.1007/s00153-021-00778-3
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.
Keywords: Binary reduct | Definable linear orders | Linearly ordered structures | Weak quasi-o-minimality
Publisher: Springer Link

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.