The lattice of definability: origins, recent developments, and further directions
From MaRDI portal
Publication:6132481
Recommendations
Cites work
- A combinatorial version of the Svenonius theorem on definability
- A list of arithmetical structures complete with respect to the first-order definability
- A survey of homogeneous structures
- Additive reducts of real closed fields
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Decidability of definability
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Definibility in normal theories
- 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,
- Finite quantifier hierarchies in relational algebras
- 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 1995184 (Why is no real title available?)
- scientific article; zbMATH DE number 2174391 (Why is no real title available?)
- scientific article; zbMATH DE number 3300553 (Why is no real title available?)
- scientific article; zbMATH DE number 3020851 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- scientific article; zbMATH DE number 3085803 (Why is no real title available?)
- Invariant subgroups of \(^ V V\)
- Nonmaximal decidable structures
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
- On direct products of theories
- On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation
- Presburgerness of predicates regular in two number systems
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- Reducts of (C, +, ·) which contain +
- Reducts of random hypergraphs
- Reducts of some structures over the reals
- Reducts of structures and maximal-closed permutation groups
- Reducts of the random graph
- Some results in the effective descriptive set theory
- The 116 reducts of (ℚ, <, a)
- The 42 reducts of the random ordered graph
- The affine and projective groups are maximal
- The definable criterion for definability in Presburger arithmetic and its applications.
- Transitivity of permutation groups on unordered sets
- Universal graphs and universal functions
- Weakly maximal decidable structures
- What are logical notions?
Cited in
(3)
This page was built for publication: The lattice of definability: origins, recent developments, and further directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132481)