On the Boolean algebras of definable sets in weakly o‐minimal theories

Mathematical Logic Quarterly 50 (3):241-248 (2004)
  Copy   BIBTEX


We consider the sets definable in the countable models of a weakly o-minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic , in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o-minimal theory is p-ω-categorical



    Upload a copy of this work     Papers currently archived: 79,912

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles


Added to PP

34 (#357,953)

6 months
1 (#479,283)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references