Counting siblings in universal theories
Logic
2022-09-14 v3
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.
Cite
@article{arxiv.1910.11230,
title = {Counting siblings in universal theories},
author = {Samuel Braunfeld and Michael C. Laskowski},
journal= {arXiv preprint arXiv:1910.11230},
year = {2022}
}
Comments
26 pages; v3 to appear in Journal of Symbolic Logic