Orbits of Maximal Vector Spaces
详细信息    查看全文
  • 作者：R. D. Dimitrov ; V. Harizanov
  • 关键词：infinite ; dimensional vector space over field of rationals ; quasimaximal set ; equivalence classes ; principal filter ; orbit ; lattice
  • 刊名：Algebra and Logic
  • 出版年：2016
  • 出版时间：January 2016
  • 年：2016
  • 卷：54
  • 期：6
  • 页码：440-477
  • 全文大小：683 KB
  • 参考文献：1.A. I. Mal’tsev, “On recursive Abelian groups,” Dokl. Akad. Nauk SSSR, 146, No. 5, 1009–1012 (1962).MathSciNet MATH
    2.J. C. Dekker, “Countable vector spaces with recursive operations. I,” J. Symb. Log., 34, 363–387 (1969).MathSciNet CrossRef MATH
    3.G. Metakides and A. Nerode, “Recursively enumerable vector spaces,” Ann. Math. Log., 11, 147–171 (1977).MathSciNet CrossRef MATH
    4.R. G. Downey and J. B. Remmel, “Computable algebras and closure systems: Coding properties,” in Handbook of Recursive Mathematics, Stud. Log. Found. Math., 139, Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (eds.), Elsevier, Amsterdam (1998), pp. 997–1039.
    5.A. S. Morozov, “Groups of computable automorphisms, in Handbook of Recursive Mathematics, Stud. Log. Found. Math., 138, Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (eds.), Elsevier, Amsterdam (1998), pp. 311–345.
    6.A. Nerode and J. B. Remmel, A survey of lattices of r.e. substructures, in Recursion Theory, Proc. Symp. Pure Math., 42, A. Nerode and R. Shore (eds.), Am. Math. Soc., Providence, RI (1985), pp. 323–375.
    7.C. J. Conidis, “Infinite dimensional proper subspaces of computable vector spaces,” J. Alg., 406, 346–375 (2014).MathSciNet CrossRef MATH
    8.R. G. Downey, D. R. Hirschfeldt, A. M. Kach, S. Lempp, J. R. Mileti, and A. Montalb´an, “Subspaces of computable vector spaces,” J. Alg., 314, No. 2, 888–894 (2007).
    9.R. M. Friedberg, “Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication,” J. Symb. Log., 23, No. 3, 309–316 (1958).MathSciNet CrossRef MATH
    10.D. A. Martin, “Classes of recursively enumerable sets and degree of unsolvability,” Z. Math. Log. Grund. Math., 12, No. 4, 295–310 (1966).CrossRef MATH
    11.C. F. Kent, “Constructive analogues of the group of permutations of the natural numbers,” Trans. Am. Math. Soc., 104, No. 2, 347–362 (1962).MathSciNet CrossRef MATH
    12.R. I. Soare, Recursively Enumerable Sets and Degrees, Perspect. Math. Log., Omega Ser., Springer-Verlag, Heidelberg (1987).
    13.R. I. Soare, “Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets,” Ann. Math. (2), 100, 80–120 (1974).
    14.I. Kalantari and A. Retzlaff, “Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces,” J. Symb. Log., 42, 481–491 (1977).MathSciNet CrossRef MATH
    15.J. Remmel, “On r. e. and co-r. e. vector spaces with nonextendible bases,” J. Symb. Log., 45, 20–34 (1980).MathSciNet CrossRef MATH
    16.D. R. Guichard, “Automorphisms of substructure lattices in recursive algebra,” Ann. Pure Appl. Log., 25, 47–58 (1983).MathSciNet CrossRef MATH
    17.G. R. Hird, “Recursive properties of relations on models,” Ann. Pure Appl. Log., 63, No. 3, 241–269 (1993).MathSciNet CrossRef MATH
    18.R. G. Downey and G. R. Hird, “Automorphisms of supermaximal subspaces,” J. Symb. Log., 50, 1–9 (1985).MathSciNet CrossRef MATH
    19.R. D. Dimitrov, “Quasimaximality and principal filters isomorphism between ε* and \( \mathfrak{L} \) *(V ∞ ),” Arch. Math. Log., 43, No. 3, 415–424 (2004).MathSciNet CrossRef MATH
    20.R. D. Dimitrov, “A class of Σ3 0 modular lattices embeddable as principal filters in \( \mathfrak{L} \) *(V ∞ ),” Arch. Math. Log., 47, No. 2, 111–132 (2008).MathSciNet CrossRef MATH
    21.R. Dimitrov, V. Harizanov, R. Miller, and K. J. Mourad, “Isomorphisms of non-standard fields and Ash’s conjecture,” in Lect. Notes Comput. Sci., 8493, A. Beckmann et al. (eds.), Springer, Berlin (2014), pp. 143–152.
    22.R. D. Dimitrov, “Cohesive powers of computable structures,” Annuaire Univ. Sofia, Fac. Math. Inform., 99, 193–201 (2009).
    23.S. B. Cooper, Computability Theory, Chapman and Hall/CRC Math. Ser., Chapman and Hall/CRC, Boca Raton, FL (2004).
    24.S. S. Goncharov and Yu. L. Ershov, Constructive Models, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1999).
    25.H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).MATH
    26.R. D. Dimitrov, “Extensions of certain partial automorphisms of \( \mathfrak{L} \) *(V ∞ ),” Annuaire Univ. Sofia, Fac. Math. Inform., 99, 183–191 (2009).
    27.E. Artin, Geometric Algebra, Intersci. Tracts Pure Appl. Math., 3, Intersci. Publ., New York (1957).
  • 作者单位：R. D. Dimitrov (1)
    V. Harizanov (2)

    1. Department of Mathematics, Western Illinois University, Macomb, IL, 61455, USA
    2. Department of Mathematics, George Washington University, Washington, DC, 20052, USA
  • 刊物类别：Mathematics and Statistics
  • 刊物主题：Mathematics
    Algebra
    Mathematical Logic and Foundations
    Russian Library of Science
  • 出版者：Springer New York
  • ISSN：1573-8302
文摘
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.