Modular Counting and Substitution of Structures
Ernst P. Specker · Combinatorics Probability Computing · 2005
The aim of this paper is to point to a difference between binary and hyperary structures. The modular counting functions of a class of structures defined by a sentence of second-order monadic logic with equality, based on binary relations, are ultimately periodic. However, this is not the case for sentences based on quaternary relations.