Ranks for families of permutation theories
The Bulletin of Irkutsk State University. Series Mathematics, Tome 28 (2019), pp. 85-94 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The notion of rank for families of theories, similar to Morley rank for fixed theories, serves as a measure of complexity for given families. There arises a natural problem of describing a rank hierarchy for a series of families of theories.In this article, we answer the question posed and describe the ranks and degrees for families of theories of permutations with different numbers of cycles of a certain length. A number examples of families of permutation theories that have a finite rank are given, and it is constructed a family of permutation theories having a specified countable rank and degree $n$. It is proved that in the family of permutation theories any theory equals a theory of a finite structure or it is approximated by finite structures, i.e. any permutation theory on an infinite set is pseudofinite. Topological properties of the families under consideration were studied.
Keywords: family of theories, pseudofinite theory, rank, degree.
Mots-clés : permutation
@article{IIGUM_2019_28_a5,
     author = {N. D. Markhabatov},
     title = {Ranks for families of permutation theories},
     journal = {The Bulletin of Irkutsk State University. Series Mathematics},
     pages = {85--94},
     year = {2019},
     volume = {28},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/IIGUM_2019_28_a5/}
}
TY  - JOUR
AU  - N. D. Markhabatov
TI  - Ranks for families of permutation theories
JO  - The Bulletin of Irkutsk State University. Series Mathematics
PY  - 2019
SP  - 85
EP  - 94
VL  - 28
UR  - http://geodesic.mathdoc.fr/item/IIGUM_2019_28_a5/
LA  - en
ID  - IIGUM_2019_28_a5
ER  - 
%0 Journal Article
%A N. D. Markhabatov
%T Ranks for families of permutation theories
%J The Bulletin of Irkutsk State University. Series Mathematics
%D 2019
%P 85-94
%V 28
%U http://geodesic.mathdoc.fr/item/IIGUM_2019_28_a5/
%G en
%F IIGUM_2019_28_a5
N. D. Markhabatov. Ranks for families of permutation theories. The Bulletin of Irkutsk State University. Series Mathematics, Tome 28 (2019), pp. 85-94. http://geodesic.mathdoc.fr/item/IIGUM_2019_28_a5/

[1] Ivanov A. A., “Complete theories of unars”, Algebra and Logic, 23:1 (1984), 36–55 | DOI | MR | Zbl

[2] Marcus L., “The number of countable models of a theory of one unary function”, Fundamenta Mathematicae, CVIII:3 (1980), 171–181 | DOI | MR | Zbl

[3] Markhabatov N. D., Sudoplatov S. V., Ranks for families of all theories of given languages, 2019, arXiv: 1901.09903v1 [math.LO] | MR | Zbl

[4] Morley M., “Categoricity in Power”, Transactions of the American Mathematical Society, 114:2 (1965), 514–538 | DOI | MR | Zbl

[5] Popkov R. A., “Classification of countable models of complete theories of unary predicates with permutation of bounded order”, Algebra and Model Theory $8$, Collection of papers, NSTU, Novosibirsk, 2011, 73–82 | MR

[6] Rosen E., “Some Aspects of Model Theory and Finite Structures”, The Bulletin of Symbolic Logic, 8:3 (2002), 380–403 | DOI | MR | Zbl

[7] Ryaskin A. N., “The number of models of complete theories of unars”, Model Theory and Its Applications, Tr. Inst. Mat. SO AN SSSR, 8, 1988, 162–182 | MR

[8] Shishmarev Yu. E., “On categorical theories of one function”, Mat. Zametki, 11:1 (1972), 89–98 | MR | Zbl

[9] Sudoplatov S. V., Ranks for families of theories and their spectra, 2019, arXiv: 1901.08464v1 [math.LO]

[10] Sudoplatov S. V., Approximations of theories, 2019, arXiv: 1901.08961v1 [math.LO]