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, 2012, Volume 51, Number 2, Pages 216–238 (Mi al531)  
This article is cited in 1 scientific paper (total in 1 paper)

Recognition complexity of theories and their computational expressivity

I. V. Latkin

East Kazakhstan State Technical University named after D. Serikbayev, Ust-Kamenogorsk, Kazakhstan
Full-text PDF (260 kB) Citations (1)
References:
PDF
HTML
Abstract: Computational complexity of a theory for a class $\mathfrak B$ of Boolean algebras is evaluated. We introduce a concept of computational expressivity for a theory, which is close in meaning to its computational complexity, but, as distinct from the latter, also fits well with undecidable theories.
Keywords: Boolean algebra, theory, computational expressivity of theories.
Received: 03.05.2011
Revised: 11.03.2012
English version:
Algebra and Logic, 2012, Volume 51, Issue 2, Pages 144–159
DOI: https://doi.org/10.1007/s10469-012-9178-5
Bibliographic databases:
Document Type: Article
UDC: 510.52+510.58
Language: Russian
Citation: I. V. Latkin, “Recognition complexity of theories and their computational expressivity”, Algebra Logika, 51:2 (2012), 216–238; Algebra and Logic, 51:2 (2012), 144–159
Citation in format AMSBIB
\Bibitem{Lat12}
\by I.~V.~Latkin
\paper Recognition complexity of theories and their computational expressivity
\jour Algebra Logika
\yr 2012
\vol 51
\issue 2
\pages 216--238
\mathnet{http://mi.mathnet.ru/al531}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2986581}
\zmath{https://zbmath.org/?q=an:06115030}
\transl
\jour Algebra and Logic
\yr 2012
\vol 51
\issue 2
\pages 144--159
\crossref{https://doi.org/10.1007/s10469-012-9178-5}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000307243000005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84864742792}
Linking options:
  • https://www.mathnet.ru/eng/al531
  • https://www.mathnet.ru/eng/al/v51/i2/p216
    • 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:288
    Full-text PDF :89
    References:53
    First page:24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024