منابع مشابه
Additivity of the Dp-rank
The main result is the prove of the linearity of the dp-rank. We also prove that the study of theories of finite dp-rank cannot be reduced to the study of its dp-minimal types and discuss the possible relations between dp-rank and VC-density.
متن کاملOn a common generalization of Shelah's 2-rank, dp-rank, and o-minimal dimension
In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multiorder property, generalizing the order property, and use this to create op-rank, which generalizes 2-rank. From this we build opdimension. We show that op-dimension bounds dp-rank, that opdimension is sub-additive, and ...
متن کاملFreud, Rank and, the problem of anxiety
Anxiety has always been a phenomenon of great importance among psychoanalysts. Freud, as the founder of psychoanalysis, took much notice of this phenomenon from the beginning of his career, and he was always trying to give a comprehensive explanation for this problem. Therefore, throughout his career, he modified his theories about anxiety frequently, and even one time, he changed his whole the...
متن کاملthe effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)
cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...
The Additivity of Crossing Numbers
It has long been conjectured that the crossing numbers of links are additive under the connected sum of links. This is a difficult problem in knot theory and has been open for more than 100 years. In fact, we do not even know that Cr(K1#K2) = Cr(K1) or Cr(K1#K2) = Cr(K2) holds in general, here K1#K2 is the connected sum of K1 and K2 and Cr(K) stands for the crossing number of the link K. The be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2013
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-2013-05782-0