Computably Rigid Models with Enumerable Submodels

We consider recursive representations for the set of rational numbers with a distinguished dense and codense subset and for some Boolean algebras with a distinguished subalgebra. We show that the rejection of recursiveness of the distinguished submodel opens up the possibility of constructing models without nontrivial automorphisms. The proof is carried out by the priority method.     

On the Loewy Length and the Noetherian Dimension of Artinian Modules

The problem of computing the automorphism groups of an elementary Abelian Hadamard difference set or equivalently of a bent function seems to have attracted not much interest so far. We describe some series of such sets and compute their automorphism group. For some of these sets the construction is based on the nonvanishing of the degree 1-cohomology of certain Chevalley groups in characteristic two. We also classify bent functions f such that Aut(f) together with the translations from the underlying vector space induce a rank 3 group of automorphisms of the associated symmetric design. Finally, we discuss computational aspects associated with such questions.     

Index sets of classes of automatic structures

We obtain exact estimates in the arithmetical and analytical hierarchies of index sets of various classes of automatic models. We also obtain estimates for the existence problems for computable isomorphism and embedding of automatic structures.     

Dynamics of Polynomial Automorphisms of C~N

ＤｙｎａｍｉｃｓｏｆＰｏｌｙｎｏｍｉａｌＡｕｔｏｍｏｒｐｈｉｓｍｓｏｆＣ~Ｎ￥ＺｈａｎｇＷｅｎｊｕｎ（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｋａｉｆｅｎｇ，Ｐ．Ｒ．Ｃｈｉａｎ，４７５００１）Ａｂｓｔｒａｃｔ：Ｔｈｉｓｐａｐｅｒｉｓａｓｓｉｇｎｅｄｔｏｄｉｓ?..     

Estimation of the algorithmic complexity of classes of computable models

We estimate the algorithmic complexity of the index set of some natural classes of computable models: finite computable models (Σ ₂ ⁰ -complete), computable models with ω-categorical theories (Δ _ω ⁰ -complex Π _ω+2 ⁰ -set), prime models (Δ _ω ⁰ -complex Π _ω+2 ⁰ -set), models with ω ₁-categorical theories (Δ _ω ⁰ -complex Σ _ω+1 ⁰ -set. We obtain a universal lower bound for the model-theoretic properties preserved by Marker’s extensions (Δ _ω ⁰ .     

Cohomologies of regular lattices over the Kleinian 4-group

We calculate explicitly cohomologies of the lattices over the Kleinian 4-group belonging to the regular components of the Auslander–Reiten quiver as well as of their dual modules. We also give a canonical form of cohomology classes under the action of automorphisms. The result is applied to the classification of some crystallographic and Chernikov groups.     

Necessary Isomorphism Conditions for Rogers Semilattices of Finite Partially Ordered Sets

We establish a condition that is necessary for Rogers semilattices of computable numberings of finite families of computably enumerable sets to be isomorphic.     

Splitting properties and jump classes

We show that the promptly simple sets of Maass form a filter in the lattice ℰ of recursively enumerable sets. The degrees of the promptly simple sets form a filter in the upper semilattice of r.e. degrees. This filter nontrivially splits the high degrees (a is high ifa′=0″). The property of prompt simplicity is neither definable in ℰ nor invariant under automorphisms of ℰ. However, prompt simplicity is easily shown to imply a property of r.e. sets which is definable in ℰ and which we have called the splitting property. The splitting property is used to answer many questions about automorphisms of ℰ. In particular, we construct lowd-simple sets which are not automorphic, answering a question of Lerman and Soare. We produce classes invariant under automorphisms of ℰ which nontrivially split the high degrees as well as all of the other classes of r.e. degrees defined in terms of the jump operator. This refutes a conjecture of Soare and answers a question of H. Friedman. During preparation of this paper, the first author was supported by the Heisenberg Programm der Deutschen Forschungsgemeinschaft, West Germany. The second author was partially supported by NSF Grant MSC 77-04013. The third author was partially supported by NSF Grant MSC 80-02937.     

On Holographic Structures

We introduce and study the class of holographic models which can be defined by copying of some of its finite parts by means of automorphisms. We prove this class to differ from the class of countably categorical models. Characterizations of the classes of holographic Boolean algebras, abelian groups, linear orderings, fields, and equivalences are given.

     

Boolean Algebras with Finite Families of Computable Automorphisms

We prove that each computable Boolean algebra has a computable presentation in which for every computable family of automorphisms the set of atoms moved by at least one of its members is finite. This implies that each computable atomic Boolean algebra has a computable presentation in which its every computable family of automorphisms is finite. The priority argument is not used in the proof.     

A Classification of 2-Dimensional Laguerre Planes Admitting 3-Dimensional Groups of Automorphisms in the Kernel

We determine, up to isomorphisms, all 2-dimensional Laguerre planes that admit 3-dimensional groups of automorphisms in the kernel of the action on parallel classes.     

一类推广的Virasoro-like李代数

构造了一类无限维李代数,它是Virasoro-like李代数的推广.研究了这类李代数的两类自同构,这两类自同构均关于映射的合成构成自同构群,一类同构于对称群S3,另一类同构于Klein交换群.得到了这类李代数一些特殊的自同态、中心.证明了这类李代数不是半单李代数.     

Some Properties of Aut（X） and the Subgroup Aut∑（X）

Let Aut. （X） denote the group of homotopy classes of self-homotopy equivalences of X, which induce identity automorphisms of homology group. We describe a decomposition of Aut. （X1 V…VXn） as a product of its simpler subgroups. We consider the subgroup Aut∑（X） of all self homotopy classes α of X such that ∑α=1∑X： ∑X → ∑X, and also give some properties of Aut∑（X）.     

On symmetric algebras of fuzzy sets

In this paper all symmetric algebras of fuzzy sets taking values on a distributive directly nondecomposable lattice with universal bounds 1 and 0, and their classes with respect to automorphisms, are studied. Special attention is devoted to the case where fuzzy sets take values on [0, 1].     

Computability of measurable sets via effective topologies

We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of the computable topological spaces constructed. The authors are supported by grants of NSFC and DFG.     

The categoricity of the group of all computable automorphisms of the rational numbers

We prove that there is a first-order sentence ϕ such that the group of all computable automorphisms of the ordering of the rational numbers is its only model among the groups that are embeddable in the group of all computable permutations. Supported by a Scheme 2 grant from the London Mathematical Society. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 649–662, September–October, 2007.     

Computable Structure and Non-Structure Theorems

In a lecture in Kazan (1977), Goncharov dubbed a number of problems regarding the classification of computable members of various classes of structures. Some of the problems seemed likely to have nice answers, while others did not. At the end of the lecture, Shore asked what would be a convincing negative result. The goal of the present article is to consider some possible answers to Shore's question. We consider structures of some computable language, whose universes are computable sets of constants. In measuring complexity, we identify with its atomic diagram D(), which, via the Gödel numbering, may be treated as a subset of . In particular, is computable if D() is computable. If K is some class, then K^c denotes the set of computable members of K. A computable characterization for K should separate the computable members of K from other structures, that is, those that either are not in K or are not computable. A computable classification (structure theorem) should describe each member of K^c up to isomorphism, or other equivalence, in terms of relatively simple invariants. A computable non-structure theorem would assert that there is no computable structure theorem. We use three approaches. They all give the correct answer for vector spaces over Q, and for linear orderings. Under all of the approaches, both classes have a computable characterization, and there is a computable classification for vector spaces, but not for linear orderings. Finally, we formulate some open problems.     

On computable automorphisms in formal concept analysis

Under study are the automorphism groups of computable formal contexts. We give a general method to transform results on the automorphisms of computable structures into results on the automorphisms of formal contexts. Using this method, we prove that the computable formal contexts and computable structures actually have the same automorphism groups and groups of computable automorphisms. We construct some examples of formal contexts and concept lattices that have nontrivial automorphisms but none of them could be hyperarithmetical in any hyperarithmetical presentation of these structures. We also show that it could be happen that two formal concepts are automorphic but they are not hyperarithmetically automorphic in any hyperarithmetical presentation.