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, 2017, Volume 56, Number 5, Pages 559–581
DOI: https://doi.org/10.17377/alglog.2017.56.503 (Mi al816) 		 
This article is cited in 8 scientific papers (total in 8 papers)

Strong decidability and strong recognizability

L. L. Maksimovaab, V. F. Yunab

a Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090 Russia
b Novosibirsk State University, ul. Pirogova 1, Novosibirsk, 630090 Russia
Full-text PDF (215 kB) Citations (8)
References:
PDF
HTML
DOI: https://doi.org/10.17377/alglog.2017.56.503
Abstract: Extensions of Johansson's minimal logic J are considered. It is proved that families of negative and nontrivial logics and a series of other families are strongly decidable over J. This means that, given any finite list $Rul$ of axiom schemes and rules of inference, we can effectively verify whether the logic with axioms and schemes, $J+Rul$, belongs to a given family. Strong recognizability over J is proved for known logics Neg, Gl, and KC as well as for logics LC and NC and all their extensions.
Keywords: minimal logic, Johansson algebra, decidability, strong decidability, recognizable logic, admissible rule.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation НШ-6848.2016.1
Supported by the Grants Council (under RF President) for State Aid of Leading Scientific Schools, grant NSh-6848.2016.1.
Received: 08.02.2016
English version:
Algebra and Logic, 2017, Volume 56, Issue 5, Pages 370–385
DOI: https://doi.org/10.1007/s10469-017-9459-0
Bibliographic databases:
Document Type: Article
UDC: 510.64
Language: Russian
Citation: L. L. Maksimova, V. F. Yun, “Strong decidability and strong recognizability”, Algebra Logika, 56:5 (2017), 559–581; Algebra and Logic, 56:5 (2017), 370–385
Citation in format AMSBIB
\Bibitem{MakYun17}
\by L.~L.~Maksimova, V.~F.~Yun
\paper Strong decidability and strong recognizability
\jour Algebra Logika
\yr 2017
\vol 56
\issue 5
\pages 559--581
\mathnet{http://mi.mathnet.ru/al816}
\crossref{https://doi.org/10.17377/alglog.2017.56.503}
\transl
\jour Algebra and Logic
\yr 2017
\vol 56
\issue 5
\pages 370--385
\crossref{https://doi.org/10.1007/s10469-017-9459-0}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000416984900003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85035778626}
Linking options:
  • https://www.mathnet.ru/eng/al816
  • https://www.mathnet.ru/eng/al/v56/i5/p559
    • This publication is cited in the following 8 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:218
    Full-text PDF :25
    References:38
    First page:12
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024