Skip to main content
Log in

A note on weak dividing

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Dolich A. (2004). Weak dividing, chain conditions and simplicity. Arch. Math. Logic 43: 265–283

    Article  MathSciNet  Google Scholar 

  2. Kim, B.: Simple first order theories. Ph.D. Thesis, University of Notre Dame (1996)

  3. Kim B. (1998). Forking in simple unstable theories. J. Lond. Math. Soc. 57(2): 257–267

    Article  Google Scholar 

  4. Kim B. (2001). Stability and simplicity in there. J. Lond. Math. Soc. 66(2): 822–836

    Google Scholar 

  5. Kim B. and Pillay A. (1997). Simple theories. Ann. Pure Appl. Logic 88: 149–164

    Article  MathSciNet  Google Scholar 

  6. Shelah S. (1980). Simple unstable theories. Ann. Math. Logic 19: 177–203

    Article  MathSciNet  Google Scholar 

  7. Wagner F.O. (2000). Simple Theories. Kluwer Academic Publishers, Dordrecht

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Byunghan Kim.

Additional information

The first author was supported by a Korea Research Foundation grant (KRF-2004-042-A00025).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, B., Shi, N. A note on weak dividing. Arch. Math. Logic 46, 51–60 (2007). https://doi.org/10.1007/s00153-006-0026-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-006-0026-y

Keywords

Navigation