Sibirskii Matematicheskii Zhurnal
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sibirsk. Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
Full-text PDF (435 kB) Citations (3)
References:
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
English version:
Siberian Mathematical Journal, 2009, Volume 50, Issue 3, Pages 481–494
DOI: https://doi.org/10.1007/s11202-009-0054-z
Bibliographic databases:
UDC: 510.5+519.7
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Mor09}
\by A.~S.~Morozov
\paper On effective presentations of formal concept lattices
\jour Sibirsk. Mat. Zh.
\yr 2009
\vol 50
\issue 3
\pages 603--620
\mathnet{http://mi.mathnet.ru/smj1985}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2555885}
\transl
\jour Siberian Math. J.
\yr 2009
\vol 50
\issue 3
\pages 481--494
\crossref{https://doi.org/10.1007/s11202-009-0054-z}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000266951900011}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-67650433338}
Linking options:
  • https://www.mathnet.ru/eng/smj1985
  • https://www.mathnet.ru/eng/smj/v50/i3/p603
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Сибирский математический журнал Siberian Mathematical Journal
    Statistics & downloads:
    Abstract page:572
    Full-text PDF :148
    References:72
    First page:14
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024