Mathematical Logic Quarterly 50 (3):241-248 (2004)
Abstract |
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
|
Keywords | Weakly o‐minimal theory p‐ω‐categorical theory Boolean algebra linear order |
Categories | (categorize this paper) |
DOI | 10.1002/malq.200310095 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Analytics
Added to PP index
2013-11-03
Total views
34 ( #332,739 of 2,498,798 )
Recent downloads (6 months)
1 ( #421,542 of 2,498,798 )
2013-11-03
Total views
34 ( #332,739 of 2,498,798 )
Recent downloads (6 months)
1 ( #421,542 of 2,498,798 )
How can I increase my downloads?
Downloads