Finite computable dimension and degrees of categoricity

We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below ${\mathbf{0}}^{″}$, and not above ${\mathbf{0}}^{\prime }$. This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form $[{\mathbf{0}}^{(\alpha )},{\mathbf{0}}^{(\alpha +1)}]$ for any computable ordinal α. We then extend the technique to produce a rigid structure of computable dimension 3 such that if ${\mathbf{d}}_0$, ${\mathbf{d}}_1$, and ${\mathbf{d}}_2$ are the degrees of isomorphisms between distinct representatives of the three computable equivalence classes, then each ${\mathbf{d}}_i<{\mathbf{d}}_0\oplus {\mathbf{d}}_1\oplus {\mathbf{d}}_2$. The resulting structure is an example of a structure that has a degree of categoricity, but not strongly.     

New spectra of strongly minimal theories in finite languages

We describe strongly minimal theories T_n with finite languages such that in the chain of countable models of T_n, only the first n models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation.     

Computability in structures representing a Scott set

Continuing work begun in [10], we utilize a notion of forcing for which the generic objects are structures and which allows us to determine whether these “generic” structures compute certain sets and enumerations. The forcing conditions are bounded complexity types which are consistent with a given theory and are elements of a given Scott set. These generic structures will “represent” this given Scott set, in the sense that the structure has a certain weak saturation property with respect to bounded complexity types in the Scott set. For example, if ? is a nonstandard model of PA, then ? represents the Scott set ? = n∈ω | ?⊧“the nth prime divides a” | a∈?. The notion of forcing yields two main results. The first characterizes the sets of natural numbers computable in all models of a given theory representing a given Scott set. We show that the characteristic function of such a set must be enumeration reducible to a complete existential type which is consistent with the given theory and is an element of the given Scott set. The second provides a sufficient condition for the existence of a structure ? such that ? represents a countable jump ideal and ? does not compute an enumeration of a given family of sets ?. This second result is of particular interest when the family of sets which cannot be enumerated is ? = Rep[Th(?)]. Under this additional assumption, the second result generalizes a result on TA [6] and on certain other completions of PA [10]. For example, we show that there also exist models of completions of ZF from which one cannot enumerate the family of sets represented by the theory. Received: 8 October 1997 / Published online: 25 January 2001     

Chain conditions in dependent groups

In this note we prove and disprove some chain conditions in type definable and definable groups in dependent, strongly dependent and strongly² dependent theories.     

Computably categorical Boolean algebras enriched by ideals and atoms

We describe computably categorical Boolean algebras whose language is enriched by one-place predicates that distinguish a finite set of ideals and atoms with respect to some ideals in this set.     

Spaces of orders and their Turing degree spectra

We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A left order on a group G is a linear order of the domain of G, which is left-invariant under the group operation. Right orders and bi-orders are defined similarly. In particular, we study groups for which the spaces of left orders are homeomorphic to the Cantor set, and their Turing degree spectra contain certain upper cones of degrees. Our approach unifies and extends Sikora’s (2004) [28] investigation of orders on groups in topology and Solomon’s (2002) [31] investigation of these orders in computable algebra. Furthermore, we establish that a computable free group F_n of rank n>1 has a bi-order in every Turing degree.     

The Kierstead's Conjecture and limitwise monotonic functions

In this paper, we prove Kierstead's conjecture for linear orders whose order types are $\sum _{q\in \mathbb{Q}}F(q)$, where F is an extended 0′-limitwise monotonic function, i.e. F can take value ζ. Linear orders in our consideration can have finite and infinite blocks simultaneously, and in this sense our result subsumes a recent result of C. Harris, K. Lee and S.B. Cooper, where only those linear orders with finite blocks are considered. Our result also covers one case of R. Downey and M. Moses' work, i.e. $\zeta ?\eta$. It covers some instances not being considered in both previous works mentioned above, such as $m?\eta +\zeta ?\eta +n?\eta$, for example, where $m,n>0$.     

On the class of flat stable theories

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence relation, flat theories are defined as an appropriate version of superstability. It is shown that in a flat theory every type has finite weight and therefore flat theories are strong. Furthermore, it is shown that under reasonable conditions any type is non-orthogonal to a regular one. Concerning groups in flat theories, it is shown that type-definable groups behave like superstable ones, since they satisfy the same chain condition on definable subgroups and also admit a normal series of definable subgroup with semi-regular quotients.     

Isomorphisms,definable relations,and Scott families of class 2 nilpotent groups

The paper deals in questions on the complexity of isomorphisms and relations on universes of structures, on the number and properties of numberings in various hierarchies of sets, and on the existence of connections between semantic and syntactic properties of the structures and relations for the class of nilpotent groups of class two. Supported by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools via project NSh-4413.2006.1. __________ Translated from Algebra i Logika, Vol. 46, No. 4, pp. 514–524, July–August, 2007.     

Isomorphisms,definable relations,and Scott families for integral domains and commutative semigroups

In the present article, we prove the following four assertions: (1) For every computable successor ordinal α, there exists a Δ _α ⁰ -categorical integral domain (commutative semigroup) which is not relatively Δ _α ⁰ -categorical (i.e., no formally Σ _α ⁰ Scott family exists for such a structure). (2) For every computable successor ordinal α, there exists an intrinsically Σ _α ⁰ -relation on the universe of a computable integral domain (commutative semigroup) which is not a relatively intrinsically Σ _α ⁰ -relation. (3) For every computable successor ordinal α and finite n, there exists an integral domain (commutative semigroup) whose Δ _α ⁰ -dimension is equal to n. (4) For every computable successor ordinal α, there exists an integral domain (commutative semigroup) with presentations only in the degrees of sets X such that Δ _α ⁰ (X) is not Δ _α ⁰ . In particular, for every finite n, there exists an integral domain (commutative semigroup) with presentations only in the degrees that are not n-low.     

A restricted computation model on Scott domains and its partial primitive recursive functionals

The paper builds on both a simply typed term system and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion of partial primitive recursive functional on Scott domains supporting a suitable concept of parallelism. Computability on Scott domains seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (scvr) is not reducible to partial primitive recursion. So extensions and PTWP are studied that are closed under scvr. The twist are certain type 1 G?del recursors for simultaneous partial primitive recursion. Formally, denotes a function , however, is modelled such that is finite, or in other words, a partial sequence. As for PTWP, the concept of type writable variables is introduced, providing the possibility of creating and manipulating partial sequences. It is shown that the PTWP-computable functionals coincide with those definable in plus a constant for sequential minimisation. In particular, the functionals definable in denoted can be characterised by a subclass of PTWP-computable functionals denoted . Moreover, hierarchies of strictly increasing classes in the style of Heinermann and complexity classes are introduced such that . These results extend those for and PTWP [Nig94]. Finally, scvr is employed to define for each type the enumeration functional of all finite elements of . Received January 30, 1996     

Beyond abstract elementary classes: On the model theory of geometric lattices

Based on Crapo's theory of one point extensions of combinatorial geometries, we find various classes of geometric lattices that behave very well from the point of view of stability theory. One of them, $({\mathbf{K}}^3,?)$, is ω-stable, it has a monster model and an independence calculus that satisfies all the usual properties of non-forking. On the other hand, these classes are rather unusual, e.g. in $({\mathbf{K}}^3,?)$ the Smoothness Axiom fails, and so $({\mathbf{K}}^3,?)$ is not an AEC.     

Simple monadic theories and partition width

We study tree‐like decompositions of models of a theory and a related complexity measure called partition width. We prove a dichotomy concerning partition width and definable pairing functions: either the partition width of models is bounded, or the theory admits definable pairing functions. Our proof rests on structure results concerning indiscernible sequences and finitely satisfiable types for theories without definable pairing functions. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Askey-Wilson polynomials and the quantum SU(2) group: Survey and applications

Generalised matrix elements of the irreducible representations of the quantum SU(2) group are defined using certain orthonormal bases of the representation space. The generalised matrix elements are relatively infinitesimal invariant with respect to Lie algebra like elements of the quantised universal enveloping algebra of sl(2). A full proof of the theorem announced by Noumi and Mimachi [Proc. Japan Acad. Sci. Ser. A 66 (1990), 146–149] describing the generalised matrix elements in terms of the full four-parameter family of Askey-Wilson polynomials is given. Various known and new applications of this interpretation are presented.Supported by a NATO-Science Fellowship of the Netherlands Organization for Scientific Research (NWO).     

Chains and antichains in partial orderings

We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is or , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two sets. Our main result is that there is a computably axiomatizable theory K of partial orderings such that K has a computable model with arbitrarily long finite chains but no computable model with an infinite chain. We also prove the corresponding result for antichains. Finally, we prove that if a computable partial ordering has the feature that for every , there is an infinite chain or antichain that is relative to , then we have uniform dichotomy: either for all copies of , there is an infinite chain that is relative to , or for all copies of , there is an infinite antichain that is relative to .     

Topological and Nonstandard Extensions

We introduce a notion of topological extension of a given set X. The resulting class of topological spaces includes the Stone-ech compactification X of the discrete space X, as well as all nonstandard models of X in the sense of nonstandard analysis (when endowed with a natural topology). In this context, we give a simple characterization of nonstandard extensions in purely topological terms, and we establish connections with special classes of ultrafilters whose existence is independent of ZFC.