Extensions and Limits of the Specker-Blatter Theorem
Eldar Fischer, Johann A. Makowsky

TL;DR
This paper investigates the Specker-Blatter Theorem's applicability to structures with constants and higher-arity relations, extending its scope and identifying its limitations in logical definability and counting functions.
Contribution
It proves the theorem holds for CMSOL with hard-wired constants and demonstrates its failure for certain ternary relations in First Order Logic, expanding understanding of counting functions.
Findings
The theorem holds for CMSOL with hard-wired constants.
The theorem does not hold for structures with a ternary relation in FOL.
Certain restricted partition functions are proven to be MC-finite.
Abstract
The original Specker-Blatter Theorem (1983) was formulated for classes of structures of one or several binary relations definable in Monadic Second Order Logic MSOL. It states that the number of such structures on the set is modularly C-finite (MC-finite). In previous work we extended this to structures definable in CMSOL, MSOL extended with modular counting quantifiers. The first author also showed that the Specker-Blatter Theorem does not hold for one quaternary relation (2003). If the vocabulary allows a constant symbol , there are possible interpretations on for . We say that a constant is {\em hard-wired} if is always interpreted by the same element . In this paper we show: 1. The Specker-Blatter Theorem also holds for CMSOL when hard-wired constants are allowed. The proof method of Specker and Blatter does not work in this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
