Lattice of definability (of reducts) for integers with successor

DOI10.1070/IM9107MaRDI QIDQ5033990

A. L. Semenov, S. F. Soprunov

Publication date: 24 February 2022

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

zbMATH Keywords

definabilityreductsSvenonius theorem

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transitivity of permutation groups on unordered sets
• Presburgerness of predicates regular in two number systems
• Lattice of definability in the order of rational numbers
• A survey of homogeneous structures
• Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
• The 42 reducts of the random ordered graph
• The 116 reducts of (ℚ, <, a)
• THERE ARE NO INTERMEDIATE STRUCTURES BETWEEN THE GROUP OF INTEGERS AND PRESBURGER ARITHMETIC
• A combinatorial version of the Svenonius theorem on definability
• The Lattice of Definability. Origins, Recent Developments, and Further Directions
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor

This page was built for publication: Lattice of definability (of reducts) for integers with successor