A model-thoeretic version of Tarski's theorem

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.

Publication Details

Journal
ArXiv.org
Published
2025-07-11
Primary Topic
Advanced Topology and Set Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A model-thoeretic version of Tarski's theorem

ArXiv.org
Advanced Topology and Set Theory
article

A model-thoeretic version of Tarski's theorem

article en

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.

ArXiv.org
Reduced inequalities
Openalex Percentile: Top 41%
Advanced Topology and Set Theory
Open Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A model-thoeretic version of Tarski's theorem · ArXiv.org (2025) | TGRS Research Map | TGRS