The Lattice of Computably Enumerable Vector Spaces (Q2970969)

From MaRDI portal

Revision as of 15:41, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The Lattice of Computably Enumerable Vector Spaces	scientific article

Statements

scholarly article

0 references

The Lattice of Computably Enumerable Vector Spaces (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-50062-1_23

0 references

0 references

Valentina S. Harizanov

0 references

Computability and Complexity

0 references

publication date

4 April 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

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

0 references

0 references

Combinatorial theory.

0 references

Quasi-simple relations in copies of a given recursive structure

0 references

Decidable subspaces and recursively enumerable subspaces

0 references

Countable vector spaces with recursive operations Part I<sup>1</sup>

0 references

Quasimaximality and principal filters isomorphism between \({\mathcal E}^*\) and \({\mathcal L}^*(V_\infty)\)

0 references

A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)

0 references

Dependence relations in computably rigid computable vector spaces

0 references

Isomorphisms of Non-Standard Fields and Ash’s Conjecture

0 references

Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra

0 references

ON A QUESTION OF A. RETZLAFF

0 references

0 references

Bases of supermaximal subspaces and Steinitz systems. I

0 references

A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES

0 references

Co-immune subspaces and complementation in<i>V</i><sub>∞</sub>

0 references

The Degrees of R.E. Sets Without the Universal Splitting Property

0 references

Automorphisms of supermaximal subspaces

0 references

Bases of Supermaximal Subspaces and Steinitz Systems II

0 references

Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures

0 references

Maximal theories

0 references

Orbits of Creative Subspaces

0 references

Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures''

0 references

On the Universal Splitting Property

0 references

0 references

Automorphisms and Recursive Structures

0 references

More undecidable lattices of Steinitz exchange systems

0 references

Automorphisms of substructure lattices in recursive algebra

0 references

A note on r-maximal subspaces of \(V_{\infty}\)

0 references

Recursive properties of relations on models

0 references

Models of arithmetic and recursive functions

0 references

Forcing, arithmetic, division rings

0 references

Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces

0 references

Degrees coded in jumps of orderings

0 references

Degrees of recursively enumerable sets which have no maximal supersets

0 references

Sub-arithmetical ultrapowers: A survey

0 references

\(\Delta_{1}\) ultrapowers are totally rigid

0 references

Recursively enumerable vector spaces

0 references

Rigid constructive modules

0 references

Turing reducibility as algebraic embeddability

0 references

0 references

Permutations and implicit definability

0 references

0 references

0 references

Determining Automorphisms of the Recursively Enumerable Sets

0 references

Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2970969

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2970969&oldid=36313643"