On definability of types of finite Cantor-Bendixson rank

Mathematical Logic Quarterly 57 (3):256-260 (2011)
  Copy   BIBTEX

Abstract

We prove that every type of finite Cantor-Bendixson rank over a model of a first-order theory without the strict order property is definable and has a unique nonforking extension to a global type. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

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

Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.
Quantifier-eliminable locally finite graphs.Shawn Hedman & Wai Yan Pong - 2011 - Mathematical Logic Quarterly 57 (2):180-185.
Ordered Groups, Computability and Cantor-Bendixson Rank.Waseet Kazmi - 2023 - Bulletin of Symbolic Logic 29 (4):664-664.
Definability of groups in ℵ₀-stable metric structures.Itaï Ben Yaacov - 2010 - Journal of Symbolic Logic 75 (3):817-840.
Rank, join, and Cantor singletons.Jim Owings - 1997 - Archive for Mathematical Logic 36 (4-5):313-320.

Analytics

Added to PP
2013-12-01

Downloads
12 (#317,170)

6 months
3 (#1,723,834)

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

On constants and the strict order property.Predrag Tanović - 2006 - Archive for Mathematical Logic 45 (4):423-430.

Add more references