|
Sibirskii Matematicheskii Zhurnal, 2009, Volume 50, Number 3, Pages 603–620
(Mi smj1985)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
On effective presentations of formal concept lattices
A. S. Morozov Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
We study the isomorphism types of ordered structures of concepts for computable formal contexts from the point of view of computable model theory. We show that, although these structures could have the cardinality of the continuum or – if they are countable – could have an arbitrary high hyperarithmetical complexity, they are in some sense very close to computable orderings. We give some sufficient conditions for these orderings to have computable presentations. A full description is given of the isomorphism types of discrete concept lattices. We also give some counterexamples.
Keywords:
formal concept analysis, computable formal context, computable formal concept, concept lattice, computable structure.
Received: 15.02.2007
Citation:
A. S. Morozov, “On effective presentations of formal concept lattices”, Sibirsk. Mat. Zh., 50:3 (2009), 603–620; Siberian Math. J., 50:3 (2009), 481–494
Linking options:
https://www.mathnet.ru/eng/smj1985 https://www.mathnet.ru/eng/smj/v50/i3/p603
|
Statistics & downloads: |
Abstract page: | 573 | Full-text PDF : | 148 | References: | 72 | First page: | 14 |
|