Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0705.4078

On canonical bases and internality criteria

Rahim Moosa·Anand PIllay
View original source ↗Read source document ↗Export metadata ↓

Abstract

A criterion is given for a type in a finite rank stable theory to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana which give criteria for compact complex analytic spaces to be algebraic (namely Moishezon), in terms of the existence of "generating" families of algebraic subvarieties. A model-theoretic anologue/generalisation of Campana's results is given under the hypothesis that the theory has the "canonical base property" (CBP), a property that is conjectured to hold in all stable finite rank theories and which states that the type of the canonical base over a realisation is almost internal to the minimal types of the theory.

Explore related subjects

math.LOmath.CV

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rahim Moosa, Anand PIllay. 2007-05-28. On canonical bases and internality criteria. https://arxiv.org/abs/0705.4078

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

KEEP EXPLORING

Related papers

arXiv2026

Intuitionistic Linear Logic with Subexponentials: Type Theory, Categorical Models and Realisability

In this paper, we present a typed lambda calculus ${\bf SILL}(λ)_Σ$, a type-theoretic version of multiplicative intuitionistic linear logic with subexponentials, that is, we have many comonadic resource modalities with some interconnections between them given by a subexponential signature $Σ$. We introduce the concept of a $Σ$-assemblage to characterise models of ${\bf SILL}(λ)_Σ$ by expanding the concept of a linear category where one has multiple resource comonads and symmetric lax monoidal comonad morphisms. We also generalise several known results from linear logic and show that every $Σ$-assemblage can be viewed as a symmetric monoidal closed category equipped with a family of monoidal adjunctions and morphisms by modernising and generalising Benton's results by involving the formal theory of comonads in the fashion of Street. We give a stronger 2-categorical characterisation of $Σ$-assemblages and show that the 2-category of $Σ$-assemblages 1,2-fully faithfully embeds into the 2-category of particular families of monoidal adjunctions, their left morphisms and transformations, that is, polymodal expansions of linear-non-linear models. In the final section, we describe realisability models for the particular case of a three-element subexponential signature by describing BCI algebras with extra operators viewed as applicative morphisms and assemblies over them.

math.LO↗
arXiv2026

Dichotomy results for classes of countable graphs

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural dichotomy for such classes: If $\mathcal{G}$ is not an induced subgraph of $\mathcal{P}_4$, then $\mathsf{Free}(\mathcal{G})$ is on top under effective bi-interpretability, implying that the members of $\mathsf{Free}(\mathcal{G})$ exhibit the full range of structural and computational behaviors. In contrast, if $\mathcal{G}$ is an induced subgraph of $\mathcal{P}_4$, then $\mathsf{Free}(\mathcal{G})$ is structurally simple, as witnessed by the fact that every member satisfies the computable embeddability condition. This dichotomy is mirrored in the finite setting when one considers combinatorial and complexity-theoretic properties. Specifically, it is known that $\mathsf{Free}(\mathcal{G})^{fin}$ is complete for graph isomorphism and not a well-quasi-order under embeddability whenever $\mathcal{G}$ is not an induced subgraph of $\mathcal{P}_4$, while in all other cases $\mathsf{Free}(\mathcal{G})^{fin}$ forms a well-quasi-order and the isomorphism problem for $\mathsf{Free}(\mathcal{G})^{fin}$ is solvable in polynomial time.

math.LO↗
arXiv2026

Forcing and cardinal invariants of universally null sets

We study universally null sets in forcing extensions and the cardinal invariants of their ideal $\mathcal{UN}$. We prove that the Miller model contains a nonmeager universally null set of cardinality $\aleph_2=\mathfrak{c}$, answering a question of Brendle and Larson. The proof uses preservation of universal nullity by countable support iterations of Miller forcing and shows that the set of Miller reals added during the iteration is universally null. We also prove that every universally null set in the $\mathbb{PT}_{f,g}$ model has cardinality at most $\aleph_1$, and show that there is consistently a forcing destructible universally null set. For the cardinal invariants, we show that $|X|<\operatorname{cof}(\mathcal{UN})$ for every $X\in\mathcal{UN}$, and that $\operatorname{add}(\mathcal{N})=\mathfrak{c}$ implies $\operatorname{cof}(\mathcal{UN})=\mathfrak{d}_{\mathfrak{c}}$. Finally, we prove the consistency of $\operatorname{add}(\mathcal{UN})<\operatorname{cov}(\mathcal{UN}) <\operatorname{non}(\mathcal{UN})<\operatorname{cof}(\mathcal{UN})$.

math.LO↗