Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.08463 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916838708871168 |
|---|---|
| author | Maříková, Jana |
| author_facet | Maříková, Jana |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_08463 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A model-thoeretic version of Tarski's theorem Maříková, Jana Logic 03C07 (05C70, 28E15) 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. |
| title | A model-thoeretic version of Tarski's theorem |
| topic | Logic 03C07 (05C70, 28E15) |
| url | https://arxiv.org/abs/2507.08463 |