A list of arithmetical structures complete with respect to the first-order definability
A 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 +, x are definable in it. A list of such structures is presented. Although structures with Pascal's triangles module n are preferred a little, an effort was made to collect as many simply formulated results as possible. (C) 2001 Elsevier Science B.V. All rights reserved.
arithmetical structures pascal's triangle module n elementary definability undecidable theories