Constructing Types in Differentially Closed Fields that are Analysable in the Constants
Abstract
Analysability of finite U-rank types are explored both in general and in the theory DCF0. The well-known fact that the equation δ(logδ x)=0 is analysable in but not almost internal to the constants is generalized to show that logδ...logδn x=0 is not analysable in the constants in (n-1)-steps. The notion of a canonical analysis is introduced -- namely an analysis that is of minimal length and interalgebraic with every other analysis of that length. Not every analysable type admits a canonical analysis. Using properties of reductions and coreductions in theories with the canonical base property, it is constructed, for any sequence of positive integers (n1,...,n), a type in DCF0 that admits a canonical analysis with the property that the ith step has U-rank ni.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.