ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CC be a class of finite relational structures. We denote by fC(n)f_C(n) the number of structures in CC over the labeled set {0,…,n−1}\{0, \dots, n-1 \}. For any class CC definable in monadic second-order logic with unary and binary relation symbols, Specker and Blatter showed that, for every m∈Nm \in \mathbb{N}, the function fC(n)f_C(n) is ultimately periodic modulo mm.

Question Does the Blatter-Specker Theorem hold for ternary relations.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.