首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 625 毫秒
1.
AssumeG is a superstable group ofM-rank 1 and the division ring of pseudo-endomorphisms ofG is a prime field. We prove a relative Vaught’s conjecture for Th(G). When additionallyU(G) =ω, this yields Vaught’s conjecture for Th(G). Research supported by KBN grant 2 P03A 006 09.  相似文献   

2.
Summary We prove here: Theorem. LetT be a countable complete superstable non -stable theory with fewer than continuum many countable models. Then there is a definable groupG with locally modular regular generics, such thatG is not connected-by-finite and any type inG eq orthogonal to the generics has Morley rank. Corollary. LetT be a countable complete superstable theory in which no infinite group is definable. ThenT has either at most countably many, or exactly continuum many countable models, up to isomorphism.Supported by NSF grant DMS 90-06628  相似文献   

3.
We are working in a monster model ℭ of a rosy theory T. We prove the following theorems, generalizing the appropriate results from the finite Morley rank case and o-minimal structures. If R is a ⋁-definable integral domain of positive, finite Ut-rank, then its field of fractions is interpretable in ℭ. If A and M are infinite, definable, abelian groups such that A acts definably and faithfully on M as a group of automorphisms, M is A-minimal and Ut(M) is finite, then there is an infinite field interpretable in ℭ. If G is an infinite, solvable but non nilpotent-by-finite, definable group of finite Ut-rank and T has NIP, then there is an infinite field interpretable in 〈G, ·〉.  相似文献   

4.
We study the notion of definable type, and use it to define theproduct of types and theheir of a type. Then, in the case of stable and superstable theories, we make a general study of the notion of rank. Finally, we use these techniques to give a new proof of a theorem of Lachlan on the number of isomorphism types of countable models of a superstable theory.  相似文献   

5.
We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

6.
We prove that the following statement is independent of ZFC+┐CH: IFT is a superstable theory of power <2 0,MN are models ofT withQ(M)=Q(N), then there isN′≱N withQ(N)=Q(N′). This generalizes Lachlan’s (1972) result.  相似文献   

7.
Vera Puninskaya 《代数通讯》2013,41(3):1227-1240
It is proved that the theory of a module M over a countable serial ring has few models iff M is ∑-pure—injective iff the theory of M has few types. It is also proved that the theory of a module M over a countable commutative Prüfer ring has few types if and only if M is ∑-pure—injective.  相似文献   

8.
Conditions are found under which homogeneity of a model M implies homogeneity of the modelM eq. One of these conditions is ω-stability of the theory of M. Examples are constructed of superstable theories for which homogeneity is not preserved under such a passage.  相似文献   

9.
We prove that if M is any model of a trivial, weakly minimal theory, then the elementary diagram T(M) eliminates quantifiers down to Boolean combinations of certain existential formulas. M. C. Laskowski has been partially supported by NSF grant DMS-0600217.  相似文献   

10.
A model of countable similarity type and cardinality is expandable if every consistent extension of its complete theory with is satisfiable in and it is compactly expandable if every such extension which additionally is finitely satisfiable in is satisfiable in . In the countable case and in the case of a model of cardinality of a superstable theory without the finite cover property the notions of saturation, expandability and compactness for expandability agree. The question of the existence of compactly expandable models which are not expandable is open. Here we present a test which serves to prove that a compactly expandable model of cardinality of a superstable theory is expandable. It is stated in terms of the existence of a certain elementary submodel whose corresponding theory of pairs of models satisfies a weak elimination of Ramsey quantifiers. Received May 20, 1996  相似文献   

11.
We prove that if T is a stable theory with only a finite number (>1) of countable models, then T contains a type-definable pseudoplane. We also show that for any stable theory T either T contains a type-definable pseudoplane or T is weakly normal (in the sense of [9]).  相似文献   

12.
In this paper we study minimal surfaces in M × ℝ, where M is a complete surface. Our main result is a Jenkins-Serrin type theorem which establishes necessary and sufficient conditions for the existence of certain minimal vertical graphs in M × ℝ. We also prove that there exists a unique solution of the Plateau’s problem in M × ℝ whoseboundaryisaNitschegraphandweconstructaScherk-typesurfaceinthisspace. Thanks to CNPq Agency for financial support.  相似文献   

13.
A new lower bound for the number of fixed points of Hamiltonian automorphisms of closed symplectic manifolds (M,ω) is established. The new estimate extends the previously known estimates to the class of weakly monotone symplectic manifolds. We prove for arbitrary closed symplectic manifolds with rational symplectic class that the cup-length estimate holds true if the Hofer energy of the Hamiltonian automorphism is sufficiently small. For arbitrary energy and on weakly monotone symplectic manifolds we define an analogon to the cup-length based on the quantum cohomology ring of (M,ω) providing a quantum cup-length estimate. Oblatum 12-IX-1997  相似文献   

14.
We prove that natural closure operations on quotient structures of the h-quasiorder of finite and (at most) countable k-labeled forests (k ≥ 3) are definable provided that minimal nonsmallest elements are allowed as parameters. This strengthens our previous result which holds that each element of the h-quasiorder of finite k-labeled forests is definable in the first-order language, and each element of the h-quasiorder of (at most) countable k-labeled forests is definable in the language L ω1ω; in both cases k ≥ 3 and minimal nonsmallest elements are allowed as parameters. Similar results hold true for two other relevant structures: the h-quasiorder of finite (resp. countable) k-labeled trees and k-labeled trees with a fixed label on the root element.  相似文献   

15.
This work is devoted to results obtained in the model theory of regular polygons. We give a characterization of monoids with axiomatizable and model-complete class of regular polygons. We describe monoids with complete class of regular polygons that satisfy some additional conditions. We study monoids whose regular core is represented as a union of finitely many principal right ideals and all regular polygons over which have a stable and superstable theory. We prove the stability of the class of all regular polygons over a monoid provided this class is axiomatizable and model-complete. We also describe monoids for which the class of all regular polygons is superstable and ω-stable provided this class is axiomatizable and model-complete. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 10, No. 4, pp. 107–157, 2004.  相似文献   

16.
We show that if M is a strongly minimal large homogeneous structure in a countable similarity type and the pregeometry of M is locally modular but not modular, then the pregeometry is affine over a division ring. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)  相似文献   

17.
LetT be a complete theory of linear order; the language ofT may contain a finite or a countable set of unary predicates. We prove the following results. (i) The number of nonisomorphic countable models ofT is either finite or 2ω. (ii) If the language ofT is finite then the number of nonisomorphic countable models ofT is either 1 or 2ω. (iii) IfS 1(T) is countable then so isS n(T) for everyn. (iv) In caseS 1(T) is countable we find a relation between the Cantor Bendixon rank ofS 1(T) and the Cantor Bendixon rank ofS n(T). (v) We define a class of modelsL, and show thatS 1(T) is finite iff the models ofT belong toL. We conclude that ifS 1(T) is finite thenT is finitely axiomatizable. (vi) We prove some theorems concerning the existence and the structure of saturated models. Most of the results in this paper appeared in the author’s Master of Science thesis which was prepared at the Hebrew University under the supervision of Professor H. Gaifman.  相似文献   

18.
Let k be an algebraically closed field of characteristic p and G be a finite group of p-rank at least two. We prove that there cannot exist a finite dimensional kG-module of stable constant Jordan type [a] with 2 ≤ a ≤ p − 2. This is a generalisation of a conjecture of Carlson, Friedlander and Pevtsova.  相似文献   

19.
We prove the vanishing of the Koszul homology group H μ(Kos(M)μ), where μ is the minimal number of generators of M. We give a counterexample that the Koszul complex of a module is not always acyclic and show its relationship with the homology of commutative rings.  相似文献   

20.
 Weakly n-dimensional spaces were first distinguished by Karl Menger. In this note we shall discuss three topics concerning this class of spaces: universal spaces, products, and the sum theorem. We prove that there is a universal space for the class of all weakly n-dimensional spaces, present a simpler proof of Tomaszewski’s result about the dimension of a product of weakly n-dimensional spaces, and show that there is an n-dimensional space which admits a pairwise disjoint countable closed cover by weakly n-dimensional subspaces but is not weakly n-dimensional itself. (Received 17 August 2000)  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号