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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., 2010, Volume 17, Number 4, Pages 18–31 (Mi da615)  

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

The closure operator in many-valued logic based on functional equations

S. S. Marchenkov

Lomonosov Moscow State University, Moscow, Russia

Abstract: On the set of many-valued logic functions the FE-closure operator based on functional equations is introduced. It is proved that the FE-closure operator generates a finite classification on the set $P_k$ of $k$-valued logic functions for every $k\ge2$. It is established that the least class in this classification is the class $H_k$ of homogeneous functions. A series of corollaries about finite FE-generating sets in FE-closed classes are deduced. Bibliogr. 24.

Keywords: many-valued logic function, functional equation, FE-closure operator.

Full text: PDF file (278 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2011, 5:3, 383–390

Bibliographic databases:

UDC: 519.716
Received: 04.02.2010

Citation: S. S. Marchenkov, “The closure operator in many-valued logic based on functional equations”, Diskretn. Anal. Issled. Oper., 17:4 (2010), 18–31; J. Appl. Industr. Math., 5:3 (2011), 383–390

Citation in format AMSBIB
\Bibitem{Mar10}
\by S.~S.~Marchenkov
\paper The closure operator in many-valued logic based on functional equations
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 4
\pages 18--31
\mathnet{http://mi.mathnet.ru/da615}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2779081}
\zmath{https://zbmath.org/?q=an:1249.03019}
\transl
\jour J. Appl. Industr. Math.
\yr 2011
\vol 5
\issue 3
\pages 383--390
\crossref{https://doi.org/10.1134/S1990478911030100}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051991016}


Linking options:
  • http://mi.mathnet.ru/eng/da615
  • http://mi.mathnet.ru/eng/da/v17/i4/p18

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. S. S. Marchenkov, “O klassifikatsiyakh funktsii mnogoznachnoi logiki s pomoschyu grupp avtomorfizmov”, Diskretn. analiz i issled. oper., 18:4 (2011), 66–76  mathnet  mathscinet  zmath
    2. Marchenkov S.S., “Fe-klassifikatsiya funktsii mnogoznachnoi logiki”, Vestnik Moskovskogo universiteta. Seriya 15: Vychislitelnaya matematika i kibernetika, 2 (2011), 32–39  mathscinet  elib
    3. S. S. Marchenkov, “Definability in the language of functional equations of a countable-valued logic”, Discrete Math. Appl., 23:5-6 (2013), 451–462  mathnet  crossref  crossref  mathscinet  elib
    4. S. S. Marchenkov, “Positive closed classes in the three-valued logic”, J. Appl. Industr. Math., 8:2 (2014), 256–266  mathnet  crossref  mathscinet  isi
    5. S. S. Marchenkov, “O slozhnosti resheniya sistem funktsionalnykh uravnenii schetnoznachnoi logiki”, Diskretn. analiz i issled. oper., 22:2 (2015), 49–62  mathnet  crossref  mathscinet  elib
    6. I. S. Kalinina, S. S. Marchenkov, “On complexity of problem of satisfiability for systems of countable-valued functional equations”, Russian Math. (Iz. VUZ), 59:8 (2015), 19–24  mathnet  crossref
    7. S. S. Marchenkov, “On FE-precomplete classes in countable-valued logic”, Discrete Math. Appl., 27:2 (2017), 103–107  mathnet  crossref  crossref  mathscinet  isi  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:306
    Full text:83
    References:30
    First page:8

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019