Three characterizing numbers of partition logics (Q1909437)

Partition logics are a family of newly proposed extended logics. They possess quite strong expressibility as well as rather good model-theoretic features. The background of introducing partition quantifiers is mathematical; however, they have found themselves in applications to computer science. We further study in the framework of model-theoretic logics some fundamental properties, such as the well-ordering number, Hanf number and Löwenheim number, of their representatives: \(L(P^{1.1})\) and \(L(Q^{1.1})\).