Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Cameo of a Consummate Computabilist Read chapter Read first chapter

2017 | OriginalPaper | Chapter

On Constructive Nilpotent Groups

Authors : Nazif G. Khisamiev, Ivan V. Latkin

Published in: Computability and Complexity

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The purpose of this paper to review the results on the constructive nilpotent groups, not claiming to be complete. We consider both the fundamental questions, which are general in the computable algebra, such as the problems of existence, uniqueness, and extension of constructivizations (computable copies), and the questions that arise from the study of the effectiveness of the basic theorems, constructions and structural properties within the class of nilpotent groups.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Strength and Weakness in Computable Structure Theory
next chapter Computable Model Theory over the Reals
Literature
1.
Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 144. North-Holland Publishing Co., Amsterdam (2000)MATH
2.
3.
Chandler, B., Magnus, W.: The History of Combinatorial Group Theory: A Case Study in the History of Ideas. Springer, Berlin, Heidelberg, New York (1982)CrossRefMATH
4.
5.
Dobritsa, V.P.: Computability of certain classes of construktive algebras (Russian). Sibirsk. Math. Zh. 18, 570–579 (1977). [translated in: Siberian Math. J. 18, 406–413 (1977)]
6.
Dobritsa, V.P.: On construktivizable abelian groups (Russian). Sibirsk. Math. Zh. 22, 208–213, 239 (1981)MATH
7.
Dobritsa, V.P.: Some construktivizations of abelian groups (Russian). Sibirsk. Math. Zh. 24, 18–25 (1983). [translated in: Siberian Math. J. 24, 167–173 (1983)]MathSciNet
8.
Dobritsa, V.P.: Computable classes of constructive models. In: Ershov Yu, L., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol. 1. Studies in Logic and the Foundations of Mathematics, vol. 138, pp. 183–233. Elsevier, New York (1998)CrossRef
9.
Dobritsa, V.P., Khisamiev, N.G., Nurtazin, A.T.: Construktive periodic abelian groups (Russian). Sibirsk. Math. Zh. 19, 1260–1265 (1978). [translated in: Siberian Math. J. 19, 886-890 (1978)]MATH
10.
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)CrossRefMATH
11.
Downey, R.G., Goncharov, S.S., Kach, A.M., Knight, J.F., Kudinov, O.V., Melnikov, A.G., Turetsky, D.: Decidability and computability of certain torsion-free abelian groups. Notre Dame J. Formal Logic 51(1), 85–96 (2010)MathSciNetCrossRefMATH
12.
13.
Downey, R.G., Montalbàn, A.: The isomorphism problem for torsion-free abelian groups is analytic complete. J. Algebra 320, 2291–2300 (2008)MathSciNetCrossRefMATH
14.
Dzgoev, V.D.: Constructivizations of direct products of algebraic systems (Russian). Algebra i Logika 21, 138–148 (1982). [translated in: Algebra and Logic, 21, 88–96 (1982)]MathSciNetCrossRefMATH
15.
Ershov, Y.: Existence of constructivizations (Russian). Dokl. Akad. Nauk SSSR 204, 1041–1044 (1972). [translated in: Soviet Math.-Dokl. 13, 779–783 (1972)]MathSciNet
16.
Ershov, Y.L.: Constructive models (Russian). Izbr. Vopr. Alg. i Log. [Selected Questions in Algebra and Logic], Sbornik posvjascen. pamjati A. I. Malceva, [A collection dedicated to the memory of A. I. Malceva], Izdat. Nauk Sibirsk. Otdel., Novosibirsk, pp. 111–130 (1973)
17.
Ershov, Y.L.: Theory of Numerations (Russian). Monographs in Mathematics Logic and Foundations of Mathematics. Nauka, Moscow (1977)
18.
Ershov, Y.L.: Theorie der Numerierungen. III. Z. Math. Logik Grundlag. Math. 23, 289–371 (1977). [translated from Russian and edited by G. Asser and H. D. Hecker]MathSciNetCrossRefMATH
19.
Ershov, Y.L.: Decision Problems and Constructivizable Models (Russian). Mathematical Logic and Foundations of Matimatics. Nauka, Moskva (1980)MATH
20.
Ershov, Y.L., Goncharov, S.S.: Constructive Models, Siberian School of Algebra and Logic.(Russian). Nauch. Kniga, Novosibirsk (1996). [translated in: Consultants Bureau, New York, 2000]
21.
Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B., Marek, V.W. (eds.): Handbook of Recursive Mathematics, vol. 1 Recursive Model Theory. Studies in Logic and the Foundations of Mathematics, vol. 139. North-Holland, Amsterdam (1998)MATH
22.
Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B., Marek, V.W. (eds.): Handbook of Recursive Mathematics, vol. 2, Recursive Algebra, Analysis and Combinatorics. Studies in Logic and the Foundations of Mathematics, vol. 139. North Holland, Amsterdam (1998)MATH
23.
Ershov, Y.L., Palutin, E.A.: Mathematical Logic (Russian), 2nd edn. Nauka, Moscow (1987). [English translation of 1st edn. translated by V. Shokurov (MIR Publishers, Moscow 1984)]
24.
Faermark, D.S.: Algorithm to determine the identity of words in the nilpotent products of groups defined by a finite number of generators, defining relations (Russian). Dokl. Akad. Nauk SSSR 137, 291–294 (1961). [translated in: Soviet Math. Dokl. 3 (1961)]MathSciNetMATH
25.
26.
Fuchs, L.: Innite Abelian Groups, vol. I, II. Academic Press, New York (1973). Pure and Applied Mathematics, vol. 36
27.
Goncharov, S.S.: Autostability of models, abelian groups (Russian). Algebra i Logika 19, 23–44 (1980). [translated in: Algebra and Logic, 19, 13-27 (1980)]MathSciNetMATH
28.
Goncharov, S.S.: Groups with a finite number of constructivizations (Russian). Dokl. Akad. Nauk SSSR 256, 269–272 (1981). [translated in: Soviet Math. Dokl. 23, 58–61 (1981)]MathSciNetMATH
29.
Goncharov, S.S., Drobotun, B.N.: On the algorithmic dimention of nilpotent groups (Russian). Sibirsk. Math. Zh. 30, 52–60, 225 (1989). [translated in: Siberian Math. J. 30, 210–217 (1989)]MATH
30.
31.
Goncharov, S.S., Molokov, A.V., Romanovskiĭ, N.S.: Nilpotent groups of finite algorithmic dimention. Sibirsk. Math. Zh. 30, 82–88 (1989). [translated in: Siberian Math. J. 30, 63–68 (1989)]MATH
32.
Griffor, E.R. (ed.): Handbook of Computability Theory. Studies in Logic and the Foundations of Mathematics, vol. 140. North- Holland Publishing Co., Amsterdam (1999)MATH
33.
Gödel, K.: Über formal unentscheibare Sätze der Principia mathematica und verwandter Systeme I. Monatsh. Math. Phys. 38, 173–198 (1931). [translated as: On formally undecidable propositions of Principia Mathematica and related systems I, (translated by B. Meltzer, with an introduction by R. B. Braithwaite), (Basic Books, NY, 1963, reprinted Dover, NY, 1992); also in: From Frege to Gödel: A Source Book in logic, 1879–1931, J. van Heijeroot, (ed.), (Harvard Univ. Press, Cambridge, Mass. And Oxford Univ. Press, London, 1967, pp. 592–617]MathSciNetCrossRefMATH
34.
35.
Hall, P.: Nilpotent Groups, Queen Mary College Math. Notes, Queen Mary Coll. (Univ. London), London (1969)
36.
Hilbert, D.: Mathematische probleme. Archiv. f. Math. und Phys. Ser. 3, 1, 44–63, 213–237 (1901)
37.
Hirschfeldt, D.R., Khoussainov, B., Shore, R.A., Slinko, A.M.: Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Logic 115, 71–113 (2002)MathSciNetCrossRefMATH
38.
39.
Kargapolov, M.I., Merzljakov, Y.I.: Fundamentals of the Theory of Groups, Translations of Osnovy Theorii Grupp, 2nd edn. Nauka, Moscow (1977). [translated by Burns, R.G., Springer, Grad. Texts in Math. 62 (1979), 4th. Edn., Fismatlit. Nauka, Moscow (1996)]
40.
Kharlampovich, O.: The word problem for solvable groups and lie algebras. In: Baumslag, G., Miller III, C.F. (eds.) Algorithms and Classification in Combinatorial Group Theory, vol. 23, pp. 61–67. Mathematical Sciences Research Institute Publications, Hampton (1992)CrossRef
41.
Khisamiev, N.G.: Construktive periodic abelian groups (Russian). In: Proceedings of 5th Kazakhstan Conference on Mathematics and Mechanics, Alma-Ata, Extended Abstracts, part 2, vol. 253 (1974)
42.
Khisamiev, N.G.: The periodic part of a strongly construktivizable abelian group (Russian). Teor. I Priklad. Zad. Mat. I Mech. Alma-Ata, Nauka Kazakh. SSR 318, 299–303 (1977)
43.
Khisamiev, N.G.: Criterion for construktivizable of a direct sum of cyclic p-groups (Russian). Izv. Akad. Nauk. Kazakh. SSR, Ser. Fiz.-Mat. 86, 51–55 (1981)MATH
44.
Khisamiev, Z.G., Khisamiev, N.G.: Nonconstruktivizability of the reduced part of a strongly constructive torsion-free abelian group (Russian). Algebra I Logika 24, 108–118, 123 (1985)MathSciNetCrossRefMATH
45.
Khisamiev, N.G.: Theory of abelian groups with constructive models (Russian). Sibirsk. Math. Zh. 27, 128–143 (1986). [translated in: Siberian Math. J. 27, 572–585 (1986)]MathSciNetMATH
46.
Khisamiev, N.G.: Hierarchies of torsion-free Abelian groups (Russian). Algebra i Logika 25(2), 205–226, 244 (1986). [translated in: Algebra and Logic, 25,2, 128–142 (1986)]MathSciNetCrossRefMATH
47.
Khisamiev, N.G.: Non construktivizability of certain ordered fields of real numbers (Russian). Sibirsk. Math. Zh. 28, 193–195 (1987). [translated in: Siberian Math. J. 28, 845–847 (1987)]MathSciNet
48.
Khisamiev, N.G.: The arithmetic hierarchy of Abelian Groups (Russian). Sibirsk. Math. Zh. 29, 144–159 (1988). [translated in: Siberian Math. J. 29, 987–999 (1988)]MathSciNetMATH
49.
Khisamiev, N.G.: Constructive abelian groups. In: Ershov, Y.L., Goncharov, S.S., Nerode, A., Remmel, J.B., Marek, V.M. (eds.) Handbook of Recursive Mathematics, vol. 2. Studies in Logic and the Foundations of Mathematics, vol. 139, pp. 1177–1231. Elsevier, New York (1998)
50.
Khisamiev, N.G.: Constructivizability criterion for an abelian group (russian). Algebra i Logika 38, 743–760 (1999). [translated in: Algebra and Logic, 38, 410–419 (1999)]MathSciNetCrossRefMATH
51.
Khisamiev, N.G.: On a class of strongly decomposable abelian groups. Algebra i Logika 41(4), 493–509, 511, 512 (2002). [translated in: Algebra and Logic, 41(4), 274–283 (2002)]MathSciNetCrossRefMATH
52.
Khisamiev, N.G.: On positive, constructive groups (Russian). Sibirsk. Mat. Zh. 53(5), 1133–1146 (2012). [translated in: Siberian Math. J. 53(5), 906–917 (2012)]MathSciNet
53.
Khisamiev, N.G., Krykpaeva, A.A.: Effectively completely decomposable abelian groups. Sibersk. Mat. Zh. 38(6), 1413–1426 (1997). [translated in: Siberian Math. J. 38(6), 1227–1229 (1997)]MathSciNetMATH
54.
Khisamiev, N.G., Latkin, I.V.: Computability of nilpotent product of computable torsion free Abelian groups (Russian), Abstracts of the International Conference “Actual problems of mathematics and mathematical modeling”, dedicated to the 50th anniversary of the Institute of Mathematics and Mechanics, Almaty, 1–5 June, pp. 185–186 (2015)
55.
Khisamiev, N.G., Nurizinov, M.K., Tyulyubergenev, R.K.: Computable torsion-free nilpotent groups of finite dimension. Sibersk. Mat. Zh. 55(3), 580–591 (2014). [translated in: Siberian Math. J. 55(3), 471–481 (2014)]MathSciNetMATH
56.
Khisamiev, N.G., Nurizinov, M.K., Tyulyubergenev, R.K.: On constructive nilpotent groups. KazNU Bull. Math. Mech. Comput. Sci. Ser. 2(82), 94–106 (2015)MATH
57.
Latkin, I.V.: Constructivizable group, nilpotent product which does not constructivizable (Russian). In: 8-Union Conference on Mathematical Logic - Moscou, p. 101 (1986)
58.
Latkin, I.V.: Algorithmic complexity of the problem of occurrence in commutants, the members of the lower central series (Russian). Sibirsk. Math. Zh. 28(5), 102–110 (1987). [translated in: Siberian J. Math. 5, 772–779 (1987)]MathSciNetMATH
59.
Latkin, I.V.: Arithmetic hierarchy of torsion-free nilpotent groups. Algebra i Logika 35(3), 308–313 (1996). [translated in: Algebra and Logic, 35(3), 172–175 (1996)]MathSciNetCrossRefMATH
60.
Latkin, I.V.: Thesis for the degree of Candidate of Physico-Mathematical Sciences. Novosibirsk State University, Russian (2001)
61.
Latkin, I.V.: On constructivizability of the tensor product of modules (Russian). Siberian Math. J. 43(2), 414–418 (2002). [translated in: Siberian Math. J. 43, 330–333 (2002)]MathSciNetCrossRefMATH
62.
Latkin, I.V.: Constructive nilpotent groups with a non-constructivizable center (Russian). Bull. East Kazak. State Techn. Univ. 23(1), 82–84 (2004)
63.
Logic notebook (Russian), Novosibirsk, Inst. Math. SB USSR Acad. Sci. (1986)
64.
Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Berlin, Heidelberg, New York (1977)MATH
65.
66.
Magnus, W., Karrass, A., Solitar, D.: Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations. Interscience Publishers, A division of Wiley & Sons Inc, Interscience, New York, London, Sydney (1966)MATH
67.
Maltsev, A.I.: Torsion-free abelian groups of finite rank (Russian). Math. Sb. (N.S.) 4, 67–68 (1938)
68.
Maltsev, A.I.: On homomorphisms onto finite groups (Russian). Uchen. Zapiski Ivanovsk Ped. instituta 18(5), 49–60 (1958). [translated in: Transl., II Ser., Am. Math. Soc., vol. 119, pp. 67–79 (1983)]
69.
Maltsev, A.I.: Constructive algebras I (Russian). Uspekhi Mat. Nauk 16, 3–60 (1961). [translated in: Constructive algebras I, Russian Math. Surveys, 16: 3 77–129; also in: Metamathematics of Algebraic Systems, Collected Papers: 1936–1967, translated and edited by B. F. Wells III, Stud. Logic Found. Math., 66 (1971), Ch. 18, 148–200]MathSciNet
70.
Maltsev, A.I.: On recursive abelian groups (Russian). Dokl. Akad. Nauk SSSR 146, 1009–1012 (1962). [translated in: Soviet Math. Dokl., 3 (1962) 1431-1434; also in: Metamathematics of Algebraic Systems Collected Papers: 1936-1967, translated and edited by B. F. Wells III, Stud. Logic Found. Math., 66 (1971), Ch. 24, 282-286]MathSciNet
71.
Maltsev, A.I.: Algorithms and Recursive Functions (Russian) Izdat. Nauka, Moscow (1965). [translated by Boron, L.F., Sanchis, L.E., Stilwell, J., Iseki, K. (Wolters NoordHoff Publishing, Groningen, 1970)]
72.
Maltsev, A.I.: Algebraic Systems (Russian). In: Smirnov, V.D., Taiclin, M. (eds.) Izdat. Nauka, Moscow (1970). [translated by Seckler, B.D., Doohovskoy, A.P., Grundlehren Math. Wiss. 192 (1973)]
73.
Miller III, C.F.: Decision problems for groups survey and reflections. In: Baumslag, G., Miller III, C.F. (eds.) Algorithms and Classification in Combinatorial Group Theory. Mathematics Sciences Research Institute Publications, vol. 23, pp. 1–59. Springer, Heidelberg (1992)CrossRef
74.
75.
Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory (Russian). Trudy Math. Inst. Steklov. 44, 3–143 (1955)
76.
Nurtazin, A.T.: Computable classes and algebraic criteria of autostability, summary of scientific thesis (Russian), Math. Inst. Siberian Branch of SSSR Acad. Sci. Novosibirsk (1974)
77.
Nurtazin, A.T.: On constructive groups (Russian). In: Proceedings of 4th All-Union Conference on Mathematical Logic (Kishinev), vol. 106 (1976)
78.
Rabin, M.O.: Computable algebra, general theory and theory of computable fields. Trans. Amer. Math. Soc. 95(2), 341–360 (1960)MathSciNetMATH
79.
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability, Ist. edn. McGraw-Hill, New York, Toronto, Ontario, London (1967), 2nd edn. MIT Press, Cambridge, London (1987)
80.
Roman’kov, V., Khisamiev, N.: On constructible matrix or ordered groups. In: Proceedings of Workshop Computability and Models, Kazakhstan University, Almaty, pp. 44–47(2002)
81.
Roman’kov, V.A., Khisamiev, N.G.: Constructive matrix, orderable groups. Algebra i Logika 43(3), 353–363 (2004). [translated in: Algebra and Logic, 43(3), 261–290 (2004)]MathSciNetMATH
82.
Roman’kov, V.A., Khisamiev, N.G.: Constructible matrix groups. Algebra i Logika 43(5), 603–613 (2004). [translated in: Algebra and Logic, 43(5), 339–345 (2004)]MathSciNetMATH
83.
84.
Smith, R.L.: Two theorems on autostability in p-groups, in Logic Year 1979–1980. In: Lerman, M., Soar, R.I. (eds.) Proceedings of Seminars and Conference on Mathematics and Logic University Connecticut, Storrs, CT, 1979/80. Lecture Notes in Mathematics, vol. 859, pp. 302–311. Springer, Heidelberg (1981)
85.
86.
Uspenskiĭ, V.A.: The systems of enumeramerable sets and their enumerations (Russian). Docl. Akad. Nauk SSSR. 105(6), 1155–1158 (1955)
87.
88.
Wussing, H.: Die Genesis des Abstrakten Gruppenbegriff. VEB Deutcher Verlag Wiss, Berlin (1969)MATH
Metadata
Title
On Constructive Nilpotent Groups
Authors
Nazif G. Khisamiev
Ivan V. Latkin
Copyright Year
2017
Book
Computability and Complexity

Print ISBN: 978-3-319-50061-4

Electronic ISBN: 978-3-319-50062-1

Copyright Year: 2017

DOI
https://doi.org/10.1007/978-3-319-50062-1_21

Premium Partner

    Image Credits