scientific article
From MaRDI portal
Publication:3690803
zbMath0573.03015MaRDI QIDQ3690803
Anil Nerode, Jeffery B. Remmel
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Recursive equivalence types of sets and structures, isols (03D50) Theory of numerations, effectively presented structures (03D45)
Related Items
On speedable and levelable vector spaces, Recursive unary algebras and trees, Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures, Structural interactions of the recursively enumerable T- and W-degrees, Classification of degree classes associated with r.e. subspaces, Recursion theory and ordered groups, The undecidability of the lattice of r. e. closed subsets of an effective topological space, Formal spaces and their effective presentations, On the learnability of vector spaces, Turing degrees of hypersimple relations on computable structures, The Lattice of Computably Enumerable Vector Spaces, Hamiltonian paths in infinite graphs, Generic objects in recursion theory. II: Operations on recursive approximation spaces, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, Splitting theorems in recursion theory, Recursive versus recursively enumerable binary relations, EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
