摘要
Partition logics are a family of newly proposed extended logics. They possess quite strong expressibility as well as rather good model-theoretic features. The introducing background of partition quantifiers is mathematical; however, they have found themselves in applications to computer science. In the following we shall further study the framework of model-theoretic logics, some foundamental properties, such as the well-ordering number,Hanf number and Lwenheim number, of their representatives: L(P<sup>1.1</sup>) and L(Q<sup>1.1</sup>).
