Lattice of relational algebras definable in integers with successor

2012/01/21 by A. L. Semenov, Semenov, A. L., S. F. Soprunov +1
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topology and Set Theory #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge

paper · pdf · doi:10.48550/arxiv.1201.4439

openalex publication_date 2012/01/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Svenonius theorem reduces the problem of first-order definability to the problem of relationship between groups of permutations. In the present paper we use this approach to describe the lattice of definable relations for the structure of integer numbers with the successor relation.

Related

• On a lattice of relational spaces (reducts) for the order of integers
• First Steps in Relational Lattice
• Relational Algebra as non-Distributive Lattice
• The equational theory of the natural join and inner union is decidable
• The Profile of relations