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, 2022, Volume 61, Number 4, Pages 469–482
DOI: https://doi.org/10.33048/alglog.2022.61.406 (Mi al2723) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Complexity of the problem of being equivalent to Horn formulas. II

N. T. Kogabaev

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Full-text PDF (997 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.33048/alglog.2022.61.406
Abstract: We calculate the complexity of the existence problem for a Horn sentence equivalent to a given one. It is proved that for a signature consisting of one unary function symbol and any finite number of unary predicate symbols, the problem is computable. For a signature with at least two unary function symbols, it is stated that the problem mentioned is an $m$-complete $\Sigma^0_1$-set.
Keywords: Horn formula, $m$-reducibility, $\Sigma^0_1$-set.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation FWNF-2022-0011
Russian Foundation for Basic Research 20-01-00300
Received: 16.02.2022
Revised: 29.03.2023
Document Type: Article
UDC: 510.53
Language: Russian
Citation: N. T. Kogabaev, “Complexity of the problem of being equivalent to Horn formulas. II”, Algebra Logika, 61:4 (2022), 469–482
Citation in format AMSBIB
\Bibitem{Kog22}
\by N.~T.~Kogabaev
\paper Complexity of the problem of being equivalent to Horn formulas.~II
\jour Algebra Logika
\yr 2022
\vol 61
\issue 4
\pages 469--482
\mathnet{http://mi.mathnet.ru/al2723}
\crossref{https://doi.org/10.33048/alglog.2022.61.406}
Linking options:
  • https://www.mathnet.ru/eng/al2723
  • https://www.mathnet.ru/eng/al/v61/i4/p469
    Cycle of papers
    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
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:102
    Full-text PDF :21
    References:24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024