Computable ideals in \(I\)-algebras

DOI10.1007/S10469-010-9082-9zbMath1218.03028OpenAlexW1995829430MaRDI QIDQ619312

P. E. Alaev

Publication date: 24 January 2011

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-010-9082-9

zbMATH Keywords

Boolean algebra with distinguished idealsintrinsic computability

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Relatively intrinsically computable relations on Boolean algebras with a distinguished set of atoms

Cites Work

• Unnamed Item
• Recursive linear orders with recursive successivities
• Generic copies of countable structures
• Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra
• Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
• Autostable I-Algebras
• Effective model theory vs. recursive model theory

This page was built for publication: Computable ideals in \(I\)-algebras