Recursion theory on algebraic structures with independent sets

DOI10.1016/0003-4843(80)90016-9zbMath0471.03037OpenAlexW2049650104MaRDI QIDQ3924186

Jeffery B. Remmel

Publication date: 1980

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(80)90016-9

zbMATH Keywords

closure operationsclosure systemslattices of recursively enumerable substructures of recursively presented structuresweakly recursively presented Boolean algebras

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Related Items

Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures, Bases of supermaximal subspaces and Steinitz systems. I, Classification of degree classes associated with r.e. subspaces, Maximal theories, The lattice of recursively enumerable substructures of an effective closure system, On the lattices of NP-subspaces of a polynomial time vector space over a finite field, Complexity-theoretic algebra. II: Boolean algebras, Invariance in ℰ* and ℰ_{Π}, Degree invariance in the Π₁⁰classes, First-order theories of abstract dependence relations, More undecidable lattices of Steinitz exchange systems