Modular Counting and Substitution of Structures

Authors:
E. Specker
Affiliations:
Eidgenössische Technische Hochschule Zürich, ETH Zentrum, HG, Rämistrasse 101, CH-8092 Zürich (e-mail: specker@math.ethz.ch)
Venue:
Combinatorics, Probability and Computing
Year:
2005

Citing 3
Cited 1

Recurrence relations for the number of labeled structures on a finite set

Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
The Specker--Blatter theorem does not hold for quaternary relations

Journal of Combinatorial Theory Series A
The specker-blatter theorem revisited

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Application of logic to integer sequences: a survey

WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.