scientific article; zbMATH DE number 1303202

MaRDI QIDQ4249725zbMATH OpenFDO

Authors Rodney G. Downey, Jeffrey Remmel

Publication date 29 June 2000

zbMATH Keywords

natural coding techniquesrecursive algebra

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Theory of numerations, effectively presented structures (03D45)

Review text

The paper reviews natural coding techniques used in recursive algebra. The successful reader of this fairly technical paper will be highly rewarded. For the entire collection see [Zbl 0905.03002].

Cited in

(10)

• Turing degrees of hypersimple relations on computable structures
• Turing degrees and automorphism groups of substructure lattices
• Orbits of maximal vector spaces
• The Lattice of Computably Enumerable Vector Spaces
• Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
• Independence in computable algebra
• Computations with finite closure systems and implications
• Cohesive powers of structures
• On the learnability of vector spaces
• A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\)

This page was built for publication:

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