Abstract
AbstractWe show that if a countable structure M in a finite relational language is not cellular, then there is an age-preserving $N \supseteq M$ such that $2^{\aleph _0}$ many structures are bi-embeddable with N. The proof proceeds by a case division based on mutual algebraicity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have