Lattice of definability (of reducts) for integers with successor
From MaRDI portal
(Redirected from Lattice of definability (of reducts) for integers with successor)
Recommendations
- The lattice of definability. Origins, recent developments, and further directions
- Lattice of definability in the order of rational numbers
- scientific article; zbMATH DE number 7407017
- scientific article; zbMATH DE number 1533642
- Definability in terms of the successor function and the coprimeness predicate in the set of arbitrary integers
Cites work
- A combinatorial version of the Svenonius theorem on definability
- A survey of homogeneous structures
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- scientific article; zbMATH DE number 4087623 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 2174391 (Why is no real title available?)
- Lattice of definability in the order of rational numbers
- Presburgerness of predicates regular in two number systems
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- The 116 reducts of (ℚ, <, a)
- The 42 reducts of the random ordered graph
- The lattice of definability. Origins, recent developments, and further directions
- Theories of real addition with and without a predicate for integers
- There are no intermediate structures between the group of integers and Presburger arithmetic
- Transitivity of permutation groups on unordered sets
Cited in
(4)
This page was built for publication: Lattice of definability (of reducts) for integers with successor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033990)