The Lattice of Computably Enumerable Vector Spaces
From MaRDI portal
Publication:2970969
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
Cites work
- scientific article; zbMATH DE number 3833945 (Why is no real title available?)
- scientific article; zbMATH DE number 3833946 (Why is no real title available?)
- scientific article; zbMATH DE number 3914305 (Why is no real title available?)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 1302877 (Why is no real title available?)
- scientific article; zbMATH DE number 1303202 (Why is no real title available?)
- A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
- A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)
- A note on r-maximal subspaces of \(V_{\infty}\)
- Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
- Automorphisms and Recursive Structures
- Automorphisms of substructure lattices in recursive algebra
- Automorphisms of supermaximal subspaces
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Bases of Supermaximal Subspaces and Steinitz Systems II
- Bases of supermaximal subspaces and Steinitz systems. I
- Co-immune subspaces and complementation inV∞
- Combinatorial theory.
- Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- Countable vector spaces with recursive operations Part I1
- Decidable subspaces and recursively enumerable subspaces
- Degrees coded in jumps of orderings
- Degrees of recursively enumerable sets which have no maximal supersets
- Dependence relations in computably rigid computable vector spaces
- Determining Automorphisms of the Recursively Enumerable Sets
- Forcing, arithmetic, division rings
- Isomorphisms of non-standard fields and Ash's conjecture
- Maximal theories
- Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
- Models of arithmetic and recursive functions
- More undecidable lattices of Steinitz exchange systems
- ON A QUESTION OF A. RETZLAFF
- On the Universal Splitting Property
- Orbits of Creative Subspaces
- Permutations and implicit definability
- Quasi-simple relations in copies of a given recursive structure
- Quasimaximality and principal filters isomorphism between \({\mathcal E}^*\) and \({\mathcal L}^*(V_\infty)\)
- Recursive properties of relations on models
- Recursively enumerable vector spaces
- Rigid constructive modules
- Sub-arithmetical ultrapowers: A survey
- The Degrees of R.E. Sets Without the Universal Splitting Property
- Turing reducibility as algebraic embeddability
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
- \(\Delta_{1}\) ultrapowers are totally rigid
Cited in
(6)- A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)
- A computably enumerable vector space with the strong antibasis property
- Degrees of convex dependence in recursively enumerable vector spaces
- Infinite dimensional proper subspaces of computable vector spaces
- Quasimaximality and principal filters isomorphism between \({\mathcal E}^*\) and \({\mathcal L}^*(V_\infty)\)
- Dependence relations in computably rigid computable vector spaces
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)
