A model-thoeretic version of Tarski's theorem
Logic
2025-07-14 v1
Abstract
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
Cite
@article{arxiv.2507.08463,
title = {A model-thoeretic version of Tarski's theorem},
author = {Jana Maříková},
journal= {arXiv preprint arXiv:2507.08463},
year = {2025}
}