The Lattice of Computably Enumerable Vector Spaces

DOI10.1007/978-3-319-50062-1_23zbMath1485.03173OpenAlexW2557840999MaRDI QIDQ2970969

R. D. Dimitrov, Valentina S. Harizanov

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_23

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive properties of relations on models
• Quasimaximality and principal filters isomorphism between \({\mathcal E}^*\) and \({\mathcal L}^*(V_\infty)\)
• Dependence relations in computably rigid computable vector spaces
• Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• A note on r-maximal subspaces of \(V_{\infty}\)
• \(\Delta_{1}\) ultrapowers are totally rigid
• Rigid constructive modules
• A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)
• Automorphisms of substructure lattices in recursive algebra
• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• Maximal theories
• Permutations and implicit definability
• Forcing, arithmetic, division rings
• Models of arithmetic and recursive functions
• Quasi-simple relations in copies of a given recursive structure
• Turing reducibility as algebraic embeddability
• Sub-arithmetical ultrapowers: A survey
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Combinatorial theory.
• Orbits of Creative Subspaces
• ON A QUESTION OF A. RETZLAFF
• More undecidable lattices of Steinitz exchange systems
• Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
• A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
• Automorphisms of supermaximal subspaces
• The Degrees of R.E. Sets Without the Universal Splitting Property
• Co-immune subspaces and complementation inV_∞
• Decidable subspaces and recursively enumerable subspaces
• Bases of supermaximal subspaces and Steinitz systems. I
• Bases of Supermaximal Subspaces and Steinitz Systems II
• Degrees coded in jumps of orderings
• Automorphisms and Recursive Structures
• Determining Automorphisms of the Recursively Enumerable Sets
• Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
• Recursively enumerable vector spaces
• On the Universal Splitting Property
• Isomorphisms of Non-Standard Fields and Ash’s Conjecture
• Countable vector spaces with recursive operations Part I¹
• Degrees of recursively enumerable sets which have no maximal supersets