Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2018, Volume 30, Issue 4, Pages 106–114
DOI: https://doi.org/10.4213/dm1542 (Mi dm1542) 		 
This article is cited in 3 scientific papers (total in 3 papers)

On some implicitly precomplete classes of monotone functions in $P_k$

M. V. Starostin

Lomonosov Moscow State University
Full-text PDF (173 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1542
Abstract: The paper is concerned with the completeness problem in implicit expressibility in a multi-valued logics $P_k$. For each $k\geq 2$ and any nontrivial order relation on the set $\{0,1,\dots,k-1\}$ we find two implicitly precomplete classes of functions which are monotone with respect to this order
Keywords: many-valued logics, implicit expressibility, maximal classes, monotone function.
Received: 01.06.2018
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 1, Pages 45–51
DOI: https://doi.org/10.1515/dma-2020-0005
Bibliographic databases:
Document Type: Article
UDC: 519.716.32+510.644
Language: Russian
Citation: M. V. Starostin, “On some implicitly precomplete classes of monotone functions in $P_k$”, Diskr. Mat., 30:4 (2018), 106–114; Discrete Math. Appl., 30:1 (2020), 45–51
Citation in format AMSBIB
\Bibitem{Sta18}
\by M.~V.~Starostin
\paper On some implicitly precomplete classes of monotone functions in $P_k$
\jour Diskr. Mat.
\yr 2018
\vol 30
\issue 4
\pages 106--114
\mathnet{http://mi.mathnet.ru/dm1542}
\crossref{https://doi.org/10.4213/dm1542}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3884632}
\elib{https://elibrary.ru/item.asp?id=36447996}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 1
\pages 45--51
\crossref{https://doi.org/10.1515/dma-2020-0005}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000513931900004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85080962831}
Linking options:
  • https://www.mathnet.ru/eng/dm1542
  • https://doi.org/10.4213/dm1542
  • https://www.mathnet.ru/eng/dm/v30/i4/p106
    • 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
    		Дискретная математика
    Statistics & downloads:
    Abstract page:287
    Full-text PDF :52
    References:32
    First page:21
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024