Prikladnaya 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


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




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

Prikladnaya Diskretnaya Matematika, 2011, Number 1(11), Pages 14–25 (Mi pdm264)  
This article is cited in 1 scientific paper (total in 1 paper)

Theoretical Foundations of Applied Discrete Mathematics

Conditions for maximality of subclones

N. G. Parvatov

Tomsk State University, Tomsk, Russia
Full-text PDF (589 kB) Citations (1)
References:
PDF
HTML
Abstract: The following problem is considered here: is a subclone of a clone maximal or not? To solve the problem, $\wedge$-descriptions and extended $\wedge$-descriptions being sets of predicates are proposed for characterizing subclones. Necessary and sufficient conditions are stated for extended $\wedge$-descriptions to characterize the maximal subclone.
Keywords: clon, subclon, precompletely subclon, maximum subclon, completeness problem.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: N. G. Parvatov, “Conditions for maximality of subclones”, Prikl. Diskr. Mat., 2011, no. 1(11), 14–25
Citation in format AMSBIB
\Bibitem{Par11}
\by N.~G.~Parvatov
\paper Conditions for maximality of subclones
\jour Prikl. Diskr. Mat.
\yr 2011
\issue 1(11)
\pages 14--25
\mathnet{http://mi.mathnet.ru/pdm264}
Linking options:
  • https://www.mathnet.ru/eng/pdm264
  • https://www.mathnet.ru/eng/pdm/y2011/i1/p14
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:231
    Full-text PDF :72
    References:44
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024