This abstract is a contribution to the paper by R. Wojcicki [2]. We use the terminology introduced there, . In this note we show that 1 0 For each n 2 there exists a logic whose degree of uniformity and degree of complexity are both equal to n. 2 0 There is a logic with the degree of uniformity equal to 2 @0 but with the degree of complexity equal to @0.