On computability of ideal lattices

DOI10.1007/978-3-032-31348-5_10MaRDI QIDQ7411957zbMATH OpenFDO

Authors Nikolay Bazhenov, Mustafa Manat, Stanislav Yun

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-31348-5_10

zbMATH Keywords

computable structureeffective domainideal latticeindex setlattice

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algorithmic complexity of algebraic systems
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Classical recursion theory. Vol. II
• Computability of distributive lattices
• Computable isomorphisms of distributive lattices
• Computable structure theory. A unified approach
• Computable structures and the hyperarithmetical hierarchy
• Computable trees, prime models, and relative decidability
• Countable retracing functions and _2⁰ predicates
• Degree spectra and computable dimensions in algebraic structures
• Formal concept analysis. Mathematical foundations. Transl. from the German by Cornelia Franzke
• Higher recursion theory
• scientific article; zbMATH DE number 1002913 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Ideal presentations and numberings of some classes of effective quasi-Polish spaces
• Lattice Theory: Foundation
• Lattice Theory: Special Topics and Applications
• On computable automorphisms in formal concept analysis
• On degree spectra of topological spaces
• On effective presentations of formal concept lattices
• Overt choice
• Study of a universal formal context

This page was built for publication: On computability of ideal lattices

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