arXiv · 2507.08463
A model-thoeretic version of Tarski's theorem
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.
Explore related subjects
Keep this discovery
Jana Maříková. 2025-07-11. A model-thoeretic version of Tarski's theorem. https://arxiv.org/abs/2507.08463
Cite the original work for its findings. Save a collection to share your selection of sources.