Recursion theory on algebraic structures with independent sets

DOI10.1016/0003-4843(80)90016-9MaRDI QIDQ3924186zbMATH OpenOpenAlexFDO

Authors Jeffrey 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)

Cited in

(11)

• First-order theories of abstract dependence relations
• Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures
• 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
• Degree invariance in the \(\Pi ^{0}_{1}\) classes
• More undecidable lattices of Steinitz exchange systems
• Invariance in ℰ* and ℰ_{Π}
• Bases of supermaximal subspaces and Steinitz systems. I
• Complexity-theoretic algebra. II: Boolean algebras

This page was built for publication: Recursion theory on algebraic structures with independent sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3924186)