Abstract
We show that if a countable structure in a finite relational language is not cellular, then there is an age-preserving such that many structures are bi-embeddable with . The proof proceeds by a case division based on mutual algebraicity.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.