Weak cylindric probability algebras.
Weak generic types and coverings of groups I
We introduce the notion of a weak generic type in a group. We improve our earlier results on countable coverings of groups and types.
Weak Probability Logic With Infinitary Predicates
Weak-join of matriods
Weakly maximal decidable structures
We prove that there exists a structure M whose monadic second order theory is decidable, and such that the first-order theory of every expansion of M by a constant is undecidable.
Weierstrass division theorem in definable germs in a polynomially bounded o-minimal structure
We give some examples of polynomially bounded o-minimal expansions of the ordered field of real numbers where the Weierstrass division theorem does not hold in the ring of germs, at the origin of ℝⁿ, of definable functions.
Well-definable types over subsets
What the finitization problem is not
When a first order T has limit models
We sort out to a large extent when a (first order complete theory) T has a superlimit model in a cardinal λ. Also we deal with related notions of being limit.
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
Cameron introduced the orbit algebra of a permutation group and conjectured that this algebra is an integral domain if and only if the group has no finite orbit. We prove that this conjecture holds and in fact that the age algebra of a relational structure R is an integral domain if and only if R is age-inexhaustible. We deduce these results from a combinatorial lemma asserting that if a product of two non-zero elements of a set algebra is zero then there is a finite common tranversal of their...
Whitehead Modules over Domains.
Wildness in the product groups
Non-abelian Polish groups arising as countable products of countable groups can be tame in arbitrarily complicated ways. This contrasts with some results of Solecki who revealed a very different picture in the abelian case.