A list of arithmetical structures complete with respect to the first-order definability

AbstractA structure with base set N is complete with respect to the first-order definability in the class of arithmetical structures if and only if the operations +,× are definable in it. A list of such structures is presented. Although structures with Pascal's triangles modulo n are preferred a little, an effort was made to collect as many simply formulated results as possible