Mathematics – Logic
Scientific paper
2012-02-26
Mathematics
Logic
Scientific paper
We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent theories. Another way to say this is: we have to look at small enough neighborhood and use reasonably definable types to analyze a type. We note the results understable without reading. First, a parallel to the "stability spectrum", the "recounting of types", that is assume lambda = lambda^{< lambda} is large enough, M a saturated model of T of cardinality lambda, let bold S_{aut}(M) be the number of complete types over M up to being conjugate, i.e. we identify p,q when some automorphism of M maps p to q . Whereas for independent T the number is 2^lambda, for dependent T the number is <= lambda moreover it is <= | alpha |^{|T|} when lambda = aleph_alpha. Second, for stable theories "lots of indiscernibility exists" a "too good indiscernible existence theorem" saying, e.g. that if the type tp (d_beta ; {d_beta : beta < alpha}) is increasing for alpha < kappa = cf(kappa) and kappa > 2^{|T|} then
No associations
LandOfFree
Dependent dreams: recounting types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dependent dreams: recounting types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependent dreams: recounting types will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-261832