We introduce an axiomatic extension of Höhle’s Monoidal Logic called Semi–divisible Monoidal Logic, and prove that it is complete by showing that semi–divisibility is preserved in MacNeille completion. Moreover, we introduce Strong semi– divisible Monoidal Logic and conjecture that a predicate formula α is derivable in Strong Semi–divisible Monadic logic if, and only if its double negation ¬¬α ...

m-dependent stationary infinitely divisible sequences are characterized as a certain generalized finite moving average sequence or equivalently via the structure of their Lévy measure. This characterization is used to find necessary and sufficient conditions for the weak convergence of centered and normalized partial sums of m-dependent stationary infinitely divisible sequences. Partial sum con...

J.BSTllCT A set of examples is described which suggests that members of a certain class of Markov processes have infinitely divisible limit distributions. A counter example rilles out such a possibility and raises the question of what further restrictions are required to guarantee infinitely divisible limits. Some related examples illustrate the same occurrence of infinitely divisible limit dis...

Combinatorial designs have been used to construct digital fingerprint codes. Here, a new constructive algorithm for an anticollusion fingerprint code based on group-divisible designs is presented. These codes are easy to construct and available for a large number of individuals, which is important from a business point of view. Group-divisible designs have not been used previously as a tool for...

We study the possible cardinalities of the divisible part of G/K when the cardinality of K is known and when, for all countable subgroups C of G, the divisible part of G/C is countable.

Let M be an o–minimal expansion of a real closed field. It is known that a definably connected abelian group is divisible. In this note, we show that a definably compact definably connected group is divisible.