Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.3844

Unstable structures definable in o-minimal theories

Assaf Hasson·Alf Onshuus
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let M be an o-minimal structure with elimination of imaginaries, N an unstable structure definable in M. Then there exists X, interpretable in N, such that X with all the structure induced from N is o-minimal. In particular X is linearly ordered. As part of the proof we show: Theorem 1: If the M-dimenson of N is 1 then any 1-N-type is either strongly stable or finite by o-minimal. Theorem 2: If N is N-minimal then it is 1-M-dimensional.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Assaf Hasson, Alf Onshuus. 2007-04-29. Unstable structures definable in o-minimal theories. https://arxiv.org/abs/0704.3844

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Choice principles in countable partition models

We study the countable partition model over a set of atoms of arbitrary uncountable cardinality $κ$. Its supports are partitions of the atoms into countably many blocks, and a permutation fixes a support when it preserves each block setwise. This model was proposed by Bruce and studied by Banerjee. We prove that dependent choice holds for every $κ$, although the filter of subgroups is not closed under countable intersections. Choice for well-orderable families holds exactly when $κ<\aleph_{ω_1}$; when $κ\ge\aleph_{ω_1}$, an $ω_1$-indexed family witnesses its failure. The Hartogs and Lindenbaum numbers of the set of atoms are both $ω_1$. The proofs use permutations matching blocks of equal cardinality and establish shift completeness of the filter. Together with Banerjee's failure of $\mathsf{DC}_{ω_1}$, these results determine which dependent choice principles hold in the model.

math.LO↗
arXiv2026

Finite Combinatorics and Fragments of Arithmetic

In fragments of first order arithmetic, definable maps on finite domains could behave very differently from finite maps. Here combinatorial properties of $Σ_{n+1}$-definable maps on finite domains are compared in the absence of $BΣ_{n+1}$. It is shown that $\mathrm{GPHP}(Σ_{n+1})$ (the $Σ_{n+1}$-instance of Kaye's General Pigeonhole Principle) lies strictly between $\mathrm{CARD}(Σ_{n+1})$ and $\mathrm{WPHP}(Σ_{n+1})$ (Weak Pigeonhole Principle for $Σ_{n+1}$-maps), and also that $\mathrm{FRT}(Σ_{n+1})$ (Finite Ramsey's Theorem for $Σ_{n+1}$-maps) does not imply $\mathrm{WPHP}(Σ_{n+1})$.

math.LO↗
arXiv2026

Computational techniques for sheaf cohomology of locally profinite sets

We compute the sheaf cohomology with constant $\mathbb{Z}_2$ coefficients of a concrete class of locally profinite sets of independent interest. We introduce $k$-sheer partitions to aid in constructions. It is also shown that questions of intermediate cohomology degrees can be reduced to questions about top cohomology degrees by exhibiting nontrivial top cocycles as pointwise limits of coboundaries.

math.LO↗