Counting siblings in universal theories
Abstract
We show that if a countable structure M in a finite relational language is not cellular, then there is an age-preserving N ⊃eq M such that 20 many structures are bi-embeddable with N. The proof proceeds by a case division based on mutual algebraicity.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.