Extensions and limits of the Specker-Blatter theorem
From MaRDI portal
Publication:6642890
DOI10.1017/jsl.2024.17MaRDI QIDQ6642890
Publication date: 25 November 2024
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
combinatorial countingfinite model theorySpecker-Blatter theoremmonadic second order logic with modular counting
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Enumeration in graph theory (05C30) Model theory of finite structures (03C13) Sequences (mod (m)) (11B50) Applications of model theory (03C98)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic uses of the Feferman-Vaught theorem
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- Elements of finite model theory.
- The \(r\)-Stirling numbers
- The Specker-Blatter theorem does not hold for quaternary relations
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The Specker-Blatter Theorem Revisited
- The first order properties of products of algebraic systems
- Shift Register Synthesis (Modulo m)
- Über die Ergänzungssätze zu den allgemeinen Reciprocitätsgesetzen.
- Modular Counting and Substitution of Structures
- Model Theory Makes Formulas Large
This page was built for publication: Extensions and limits of the Specker-Blatter theorem