On a proof of Erd\"s--Monk theorem

\v Zarko Mijajlovi\'c

Abstract: We prove an elementary proposition of combinatorial analysis, which with some use of model theory of Boolean algebras gives immediately the Erdös-Monk theorem. We shall proove also a generalization of this theorem.

Classification (MSC2000): 04A20; 26A12

Full text of the article:

• Compressed PostScript file (43 kilobytes)
• PDF file (122 kilobytes)