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, 1993, Volume 32, Number 1, Pages 34–44 (Mi al2216)  
This article is cited in 3 scientific papers (total in 3 papers)

On the number of nonequivalent computable indexings of a fixed family of sets

S. L. Bereznyuk
Full-text PDF (1043 kB) Citations (3)
Received: 27.10.1992
English version:
Algebra and Logic
DOI: https://doi.org/10.1007/BF02260928
Bibliographic databases:
Document Type: Article
UDC: 510.57
Language: Russian
Citation: S. L. Bereznyuk, “On the number of nonequivalent computable indexings of a fixed family of sets”, Algebra Logika, 32:1 (1993), 34–44
Citation in format AMSBIB
\Bibitem{Ber93}
\by S.~L.~Bereznyuk
\paper On the number of nonequivalent computable indexings of a fixed
family of sets
\jour Algebra Logika
\yr 1993
\vol 32
\issue 1
\pages 34--44
\mathnet{http://mi.mathnet.ru/al2216}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1289036}
Linking options:
  • https://www.mathnet.ru/eng/al2216
  • https://www.mathnet.ru/eng/al/v32/i1/p34
    • 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
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:19
    Full-text PDF :7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024