We introduce and study some local versions of o-minimality, requiring that every definable set decomposes as the union of finitely many isolated points and intervals in a suitable neighbourhood of every point. Motivating examples are the expansions of the ordered reals by sine, cosine and other periodic functions.

We prove that, if V is an effectively given commutative valuation domain such that its value group is dense and archimedean, then the theory of all V-modules is decidable.

We propose a notion of -minimality for partially ordered structures. Then we study -minimal partially ordered structures such that is a Boolean algebra. We prove that they admit prime models over arbitrary subsets and we characterize -categoricity in their setting. Finally, we classify -minimal Boolean algebras as well as -minimal measure spaces.

For arbitrary finite group $G$ and countable Dedekind domain $R$ such that the residue field $R/P$ is finite for every maximal $R$ -ideal $P$ , we show that the localizations at every maximal ideal of two $RG$ -lattices are isomorphic if and only if the two lattices satisfy the same first order sentences. Then we investigate generalizations of the above results to arbitrary $R$ -torsion-free $RG$ -modules and we apply the previous results to show the decidability of the theory of (...) ${\vec Z}C(2)^2$ -lattices. Eventually, we show that ${\vec Z} [i] C(2)^2$ -lattices have undecidable theory. (shrink)

We show undecidability for lattices over a group ring ${\vec Z} \, G$ where $G$ has a cyclic subgroup of order $p^3$ for some odd prime $p$ . Then we discuss the decision problem for ${\vec Z} \, G$ -lattices where $G$ is a cyclic group of order 8, and we point out that a positive answer implies – in some sense – the solution of the “wild $\Leftrightarrow$ undecidable” conjecture.

Let G be a finite group, T denote the theory of Z[G]-lattices . It is shown that T is undecidable when there are a prime p and a p-subgroup S of G such that S is cyclic of order p4, or p is odd and S is non-cyclic of order p2, or p = 2 and S is a non-cyclic abelian group of order 8 . More precisely, first we prove that T is undecidable because it interprets the word problem (...) for finite groups; then we lift undecidability from T to T. (shrink)

Let G be a finite group. For every formula ø in the language of groups, let K denote the class of groups H such that ø is a normal abelian subgroup of H and the quotient group H;ø is isomorphic to G. We show that if G is nilpotent and its order is not square-free, then there exists a formula ø such that the theory of K is undecidable.

We consider the decision problem for modules over a group ring ℤ[G], where G is a cyclic group of prime order. We show that it reduces to the same problem for a class of certain abelian structures, and we obtain some partial decidability results for this class.

Let G be a finite group. We prove that the theory af abelian-by-G groups is decidable if and only if the theory of modules over the group ring ℤ[G] is decidable. Then we study some model theoretic questions about abelian-by-G groups, in particular we show that their class is elementary when the order of G is squarefree.

We extend the analysis of the decision problem for modules over a group ring ℤ[G] to the case when G is a cyclic group of squarefree order. We show that separated ℤ[G]-modules have a decidable theory, and we discuss the model theoretic role of these modules within the class of all ℤ[G]-modules. The paper includes a short analysis of the decision problem for the theories of modules over ℤ[ζm], where m is a positive integer and ζm is a primitive mth (...) root of 1. (shrink)

We consider R-torsionfree modules over group rings RG, where R is a Dedekind domain and G is a finite group. In the first part of the paper [4] we compared the theory T of all R-torsionfree RG-modules and the theory T0 of RG-lattices , and we realized that they are almost always different. Now we compare their behaviour with respect to decidability, when RG-lattices are of finite, or wild representation type.

The study of pairs of modules (over a Dedekind domain) arises from two different perspectives, as a starting step in the analysis of tuples of submodules of a given module, or also as a particular case in the analysis of Abelian structures made by two modules and a morphism between them. We discuss how these two perspectives converge to pairs of modules, and we follow the latter one to obtain an alternative approach to the classification of pairs of torsionfree objects. (...) Then we restrict our attention to pairs of free modules. Our main results are that the theory of pairs of free Abelian groups is co-recursively enumerable, and that a few remarkable extensions of this theory are decidable. (shrink)

We provide algebraic conditions ensuring the decidability of the theory of modules over effectively given Prüfer (in particular Bézout) domains whose localizations at maximal ideals have dense value groups. For Bézout domains, these conditions are also necessary.

Discrete weakly o-minimal structures, although not so stimulating as their dense counterparts, do exhibit a certain wealth of examples and pathologies. For instance they lack prime models and monotonicity for definable functions, and are not preserved by elementary equivalence. First we exhibit these features. Then we consider a countable theory of weakly o-minimal structures with infinite definable discrete subsets and we study the Boolean algebra of definable sets of its countable models.

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 , 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 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. (shrink)

A module is weakly minimal if and only if every pp-definable subgroup is either finite or of finite index. We study weakly minimal modules over several classes of rings, including valuation domains, Prüfer domains and integral group rings.

Let G be the direct sum of the noncyclic groupof order four and a cyclic groupwhoseorderisthe power pn of some prime p. We show that ℤ2G-lattices have a decidable theory when the cyclotomic polynomia equation image is irreducible modulo 2ℤ for every j ≤ n. More generally we discuss the decision problem for ℤ2G-lattices when G is a finite group whose Sylow 2-subgroups are isomorphic to the noncyclic group of order four.

On the basis of the Klingler–Levy classification of finitely generated modules over commutative noetherian rings we approach the old problem of classifying finite commutative rings R with a decidable theory of modules. We prove that if R is wild, then the theory of all R-modules is undecidable, and verify decidability of this theory for some classes of tame finite commutative rings.

In the first centenary of Cantor's death, we discuss how to introduce his life, his works and his theories about mathematical infinity to today's students. Keywords: proper and improper infinite, cardinal number, countable set, continuum, continuum hypothesis. Sunto Nel primo centenario della scomparsa di Cantor, si discute come presentare la sua vita, le sue opere e le sue teorie sull’infinito agli studenti di oggi. Parole chiave: infinito proprio e improprio, numero cardinale, numerabile, continuo, ipotesi del continuo.

We consider R-torsionfree modules over group rings RG, where R is a Dedekind domain and G is a finite group. In the first part of the paper [4] we compared the theory T of all R-torsionfree RG-modules and the theory T0 of RG-lattices , and we realized that they are almost always different. Now we compare their behaviour with respect to decidability, when RG-lattices are of finite, or wild representation type.

We provide a first order axiomatization of the expansion of the complex field by the exponential function restricted to the subring of integers modulo the first order theory of (Z, +, ·).

We propose a definition of weak o-minimality for structures expanding a Boolean algebra. We study this notion, in particular we show that there exist weakly o-minimal non o-minimal examples in this setting.