The Lattice of Computably Enumerable Vector Spaces

DOI10.1007/978-3-319-50062-1_23zbMATH Open1485.03173OpenAlexW2557840999MaRDI QIDQ2970969FDOQ2970969

Authors: R. D. Dimitrov, Valentina 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

Recommendations

• Finite vector spaces and certain lattices
• Subspaces of computable vector spaces
• Lattice representations for computability theory
• A computably enumerable vector space with the strong antibasis property
• Completeness for vector lattices
• Enumerations in computable structure theory
• Lattice embeddings into the recursively enumerable degrees
• Ordinal envelopes of vector lattices
• scientific article; zbMATH DE number 4110929
• Embedding finite lattices into the computably enumerable degrees -- a status survey

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Dependence relations in computably rigid computable vector spaces
• Infinite dimensional proper subspaces of computable vector spaces
• Quasimaximality and principal filters isomorphism between \({\mathcal E}^*\) and \({\mathcal L}^*(V_\infty)\)
• A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)
• Degrees of convex dependence in recursively enumerable vector spaces
• A computably enumerable vector space with the strong antibasis property

This page was built for publication: The Lattice of Computably Enumerable Vector Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970969)