On two types of concept lattices in the theory of numberings

DOI10.1007/978-3-031-20350-3_8OpenAlexW4313349415MaRDI QIDQ6111947

Anvar M. Nurakunov, Nikolay Bazhenov, Manat Mustafa

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20350-3_8

zbMATH Keywords

index setformal concept analysisconcept latticecomputable structurenumbering

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Turing's Legacy
• Turing Computability
• Gödel numberings of partial recursive functions
• Classification from a Computable Viewpoint
• Rogers Semilattices of Finite Partially Ordered Sets
• Chains and antichains in
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• The Family of all Recursively Enumerable Classes of Finite Sets

This page was built for publication: On two types of concept lattices in the theory of numberings