A Note on Products and Degree of Types
β Scribed by J. Wierzejewski
- Publisher
- John Wiley and Sons
- Year
- 1977
- Tongue
- English
- Weight
- 213 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let vt(d, 2) be the largest order of a vertex-transitive graph of degree d and diameter 2. It is known that vt(d, 2)=d 2 +1 for d=1, 2, 3, and 7; for the remaining values of d we have vt(d, 2) d 2 &1. The only known general lower bound on vt(d, 2), valid for all d, seems to be vt(d, 2) w(d+2)Γ2x W(d
## Abstract We investigate stationarity of types over models in simple theories. In particular, we show that in simple theories with finite SUβrank, any complete type over a model having CantorβBendixson rank is stationary. (Β© 2008 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)
We consider some nonprincipal filters of the Medvedev lattice. We prove that the filter generated by the nonzero closed degrees of difficulty is not principal and we compare this filter, with respect to inclusion, with some other filters of the lattice. All the filters considered in this paper are d