اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBezout domains and lattice-valued modules
130
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let B be a commutative Bezout domain B and let MSpec(B) be the maximal spectrum of B. We obtain a Feferman-Vaught type theorem for the class of B-modules. We analyse the definable sets in terms, on one hand, of the definable sets in the classes of modules over the localizations of B by the maximal ideals of B, and on the other hand, of the constructible subsets of MSpec(B). When B has good factorization, it allows us to derive decidability results for the class B-modules, in particular when B is the ring of algebraic integers or its intersection with real numbers or p-adic numbers.
قيم البحث
اقرأ أيضاً
We provide algebraic conditions ensuring the decidability of the theory of modules over effectively given Prufer (in particular Bezout) domains with infinite residue fields in terms of a suitable generalization of the prime radical relation. For B{e}zout domains these conditions are also necessary.
Let $R$ be a Bezout domain, and let $A,B,Cin R^{ntimes n}$ with $ABA=ACA$. If $AB$ and $CA$ are group invertible, we prove that $AB$ is similar to $CA$. Moreover, we have $(AB)^{#}$ is similar to $(CA)^{#}$. This generalize the main result of Cao and
Li(Group inverses for matrices over a Bezout domain, {it Electronic J. Linear Algebra}, {bf 18}(2009), 600--612).
This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate especially the case of three-valued systems showing how paraconsistent three-valued logics can be obtained from them.
We introduce a class of theories called metastable, including the theory of algebraically closed valued fields (ACVF) as a motivating example. The key local notion is that of definable types dominated by their stable part. A theory is metastable (ove
r a sort $Gamma$) if every type over a sufficiently rich base structure can be viewed as part of a $Gamma$-parametrized family of stably dominated types. We initiate a study of definable groups in metastable theories of finite rank. Groups with a stably dominated generic type are shown to have a canonical stable quotient. Abelian groups are shown to be decomposable into a part coming from $Gamma$, and a definable direct limit system of groups with stably dominated generic. In the case of ACVF, among definable subgroups of affine algebraic groups, we characterize the groups with stably dominated generics in terms of group schemes over the valuation ring. Finally, we classify all fields definable in ACVF.
The notion of a textbf{$boldsymbol{mathcal{C}}$-filtered} object, where $mathcal{C}$ is some (typically small) collection of objects in a Grothendieck category, has become ubiquitous since the solution of the Flat Cover Conjecture around the year 200
0. We introduce the textbf{$boldsymbol{mathcal{C}}$-Filtration Game of length $boldsymbol{omega_1}$} on a module, paying particular attention to the case where $mathcal{C}$ is the collection of all countably presented, projective modules. We prove that Martins Maximum implies the determinacy of many $mathcal{C}$-Filtration Games of length $omega_1$, which in turn imply the determinacy of certain Ehrenfeucht-Fraiss{e} games of length $omega_1$; this allows a significant strengthening of a theorem of Mekler-Shelah-Vaananen cite{MR1191613}. Also, Martins Maximum implies that if $R$ is a countable hereditary ring, the class of textbf{$boldsymbol{sigma}$-closed potentially projective modules}---i.e., those modules that are projective in some $sigma$-closed forcing extension of the universe---is closed under $<aleph_2$-directed limits. We also give an example of a (ZFC-definable) class of abelian groups that, under the ordinary subgroup relation, constitutes an Abstract Elementary Class (AEC) with Lowenheim-Skolem number $aleph_1$ in some models in set theory, but fails to be an AEC in other models of set theory.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
