scientific article
From MaRDI portal
Publication:4063426
zbMath0306.02038MaRDI QIDQ4063426
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structure theory of algebraic structures (08A05) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory (03D99) Higher-type and set recursion theory (03D65) Algebraic structures (08Axx)
Related Items (14)
Automorphisms of substructure lattices in recursive algebra ⋮ Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures ⋮ Maximal theories ⋮ Recursion theory and ordered groups ⋮ The undecidability of the lattice of r. e. closed subsets of an effective topological space ⋮ Lower bounds on degrees of game-theoretic structures ⋮ On the lattices of NP-subspaces of a polynomial time vector space over a finite field ⋮ Complexity-theoretic algebra. II: Boolean algebras ⋮ Recursive properties of relations on models ⋮ Degrees of convex dependence in recursively enumerable vector spaces ⋮ Invariance in ℰ* and ℰ_{Π} ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ The given ⋮ A note on r-maximal subspaces of \(V_{\infty}\)
This page was built for publication:
