We use the ultramean construction to prove linear compactness theorem. We also extend the Rudin-Keisler ordering to maximal probability charges and characterize it by embeddings of power ultrameans.

In this paper, we investigate the relation between L-projections and conditional expectations on subalgebras of the Fourier Stieltjes algebra B(G), and we will show that compactness of G plays an important role in this relation.

Norm and essential norm of differences of differentiation composition operators between Bloch spaces have been estimated in this paper. As a result, we find characterizations for boundedness and compactness of these operators.

This contribution is concerned with the compactness of fuzzy logics, where we concentrate on the three standard fuzzy logics—Łukasiewicz logic, Gödel logic, and product logic.

Pitch spelling addresses the question of how to derive traditional score notation from 12-tone pitch numbers or MIDI format. This paper proposes a pitch spelling algorithm that is based on only one principle: compactness in the Euler-lattice. The algorithm was evaluated on the first book of Bach’s Well-tempered Clavier and had a success rate of 98.98 %. The algorithm is compared with other mode...

We present Shelah’s famous theorem in a version for modules, together with a self-contained proof and some examples. This exposition is based on lectures given at CRM in