The lattice of definability: origins, recent developments, and further directions
From MaRDI portal
Publication:6132481
DOI10.1134/s1064562423700370MaRDI QIDQ6132481
Publication date: 17 August 2023
Published in: Doklady Mathematics (Search for Journal in Brave)
quantifier eliminationautomorphismsdecidabilitydefinabilityreductsSvenonius theoremdefinability space
Interpolation, preservation, definability (03C40) Quantifier elimination, model completeness, and related topics (03C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonmaximal decidable structures
- Invariant subgroups of \(^ V V\)
- Transitivity of permutation groups on unordered sets
- Presburgerness of predicates regular in two number systems
- The definable criterion for definability in Presburger arithmetic and its applications.
- Reducts of random hypergraphs
- A survey of homogeneous structures
- Finite quantifier hierarchies in relational algebras
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- Definibility in normal theories
- The affine and projective groups are maximal
- The 42 reducts of the random ordered graph
- REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS
- Definitions and Nondefinability in GeometryThis paper was adapted from and expands on material in <strong>[23</strong>. A shorter version was presented to the October 2008 congress, <em>Giuseppe Peano and His School between Mathematics, Logic, and Interlingua</em>, in Turin. Some of the text in Section 2 was adapted from <strong>[46</strong>, Chap. 2].]
- Weakly maximal decidable structures
- The 116 reducts of (ℚ, <, a)
- What are logical notions?
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- Reducts of the random graph
- Additive reducts of real closed fields
- Reducts of some structures over the reals
- A combinatorial version of the Svenonius theorem on definability
- Decidability of Definability
- Universal graphs and universal functions
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Some results in the effective descriptive set theory
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Reducts of (C, +, ·) which contain +
- On direct products of theories
- A list of arithmetical structures complete with respect to the first-order definability
This page was built for publication: The lattice of definability: origins, recent developments, and further directions
