Abstract
We investigate the definable subsets of Stone algebras, introduce the notion of pseudo o-minimality of partially ordered structures, and prove that the completion of the theory of Stone algebras is pseudo o-minimal. We also give the decomposition theorem of Stone algebras.
Similar content being viewed by others
References
Baldwin, J., Lachlan, H.: On strongly minimal sets. J. Symb. Logic 36, 79–96 (1971)
Lou van den Dries: Tame Topology and o-Minimal Structures. Cambridge University Press, Cambridge (1998)
Pillay, A., Steinhorn, C.: Definable sets in ordered structures III. Trans. AMS 309, 469–476 (1988)
Knight, J., Pillay, A., Steinhorn, C.: Definable sets in ordered structures II. Trans. AMS 295, 593–605 (1986)
Newelski, L., Wencel, R.: Definable sets in Boolean-ordered o-minimal structures I. J. Symb. Logic 66, 1821–1836 (2001)
Wencel, R.: Definable sets in Boolean-ordered o-minimal structures II. J. Symb. Logic 68, 35–51 (2003)
Wencel, R.: Small theories of Boolean-ordered o-minimal structures. J. Symb. Logic 67, 1385–1390 (2002)
Toffalori, C.: Lattice ordered o-minimal structures. Notre Dame J. Form. Logic 39, 447–463 (1998)
Schmitt, P.: The model completion of Stone algebras. Ann. Sci. Univ. Clermont 13, 135–155 (1976)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Social Sciences Foundation of China (No. 14BZX078).
Rights and permissions
About this article
Cite this article
Chen, L., Shi, N. & Wu, G. Definable sets in Stone algebras. Arch. Math. Logic 55, 749–757 (2016). https://doi.org/10.1007/s00153-016-0491-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-016-0491-x