Les corps algébriquement clos, réels clos et pseudo-finis n'ont, pour chaque entier n, qu'un nombre fini d'extensions de degré n; nous montrons qu'ils partagent cette propriété avec tous les corps qui, comme eux, satisfont une propriété très rudimentaire de préservation de la dimension, de nature modèle-théorique. Ce résultat est atteint en montrant qu'une certaine action du groupe GLn d'un tel corps n'a qu'un nombre fini d'orbites. /// La korpoj algebre fermataj, reale fermataj kaj pseudofinataj ne havas, pri ciu integro n, (...) pli ol finitan nombron de sternejoj kun grado n; ni montras ke ili kunpartigas tiu ci propecon kun ciu tiel korpoj kiuj kontentigas kiel ili unu tre simplan modelteorian propecon de konserveco de la amplekso. Pri atingi la resultaton, ni montras ke kelka ago de la grupo GLn de tiel korpo havas sole finitan nombron de orbitoj. (shrink)

We show that every infinite computable partial ordering has either an infinite Δ 0 2 chain or an infinite Π 0 2 antichain. Our main result is that this cannot be improved: We construct an infinite computable partial ordering that has neither an infinite Δ 0 2 chain nor an infinite Δ 0 2 antichain.

We investigate effective categoricity of computable equivalence structures . We show that is computably categorical if and only if has only finitely many finite equivalence classes, or has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are relatively computably categorical, that is, have computably enumerable Scott families of existential formulas. Since all computable equivalence structures are relatively categorical, (...) we further investigate when they are categorical. We also obtain results on the index sets of computable equivalence structures. (shrink)

The theorem of the title is proven, solving an old question of Remmel. The method of proof uses an algebraic technique of Remmel-Vaught combined with a complex tree of strategies argument where the true path is needed to figure out the final isomorphism.

Makkai [10] produced an arithmetical structure of Scott rank $\omega _{1}^{\mathit{CK}}$. In [9]. Makkai's example is made computable. Here we show that there are computable trees of Scott rank $\omega _{1}^{\mathit{CK}}$. We introduce a notion of "rank homogeneity". In rank homogeneous trees, orbits of tuples can be understood relatively easily. By using these trees, we avoid the need to pass to the more complicated "group trees" of [10] and [9]. Using the same kind of trees, we obtain one of rank (...) $\omega _{1}^{\mathit{CK}}$ that is "strongly computably approximable". We also develop some technology that may yield further results of this kind. (shrink)

We show that if T is a trivial uncountably categorical theory of Morley Rank 1 then T is model complete after naming constants for a model.

There exists a countable structure of Scott rank where and where the -theory of is not ω-categorical. The Scott rank of a model is the least ordinal β where the model is prime in its -theory. Most well-known models with unbounded atoms below also realize a non-principal -type; such a model that preserves the Σ1-admissibility of will have Scott rank . Makkai [M. Makkai, An example concerning Scott heights, J. Symbolic Logic 46 301–318. [4]] produces a hyperarithmetical model of Scott (...) rank whose -theory is ω-categorical. A computable variant of Makkai’s example is produced in [W. Calvert, S.S. Goncharov, J.F. Knight, J. Millar, Categoricity of computable infinitary theories, Arch. Math. Logic . [1]; J. Knight, J. Millar, Computable structures of rank J. Math. Logic . [2]]. (shrink)