Algebra i logika
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



Algebra Logika:
Year:
Volume:
Issue:
Page:
Find






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


Algebra i logika, 1995, Volume 34, Number 6, Pages 667–680 (Mi al2332)  

This article is cited in 2 scientific papers (total in 2 papers)

Recursively incompatible algorithmic problems on 1-constructivizable distributive lattices with relative complements

S. T. Fedoryaev

Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Received: 29.06.1994
English version:
Algebra and Logic
DOI: https://doi.org/10.1007/BF00739333
Bibliographic databases:
Document Type: Article
UDC: 510.53:510.67
Language: Russian
Citation: S. T. Fedoryaev, “Recursively incompatible algorithmic problems on 1-constructivizable distributive lattices with relative complements”, Algebra Logika, 34:6 (1995), 667–680
Citation in format AMSBIB
\Bibitem{Fed95}
\by S.~T.~Fedoryaev
\paper Recursively incompatible algorithmic problems on
1-constructivizable distributive lattices with relative
complements
\jour Algebra Logika
\yr 1995
\vol 34
\issue 6
\pages 667--680
\mathnet{http://mi.mathnet.ru/al2332}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1400708}
Linking options:
  • https://www.mathnet.ru/eng/al2332
  • https://www.mathnet.ru/eng/al/v34/i6/p667
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:46
    Full-text PDF :7
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024