Sibirskii Matematicheskii Zhurnal
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


Sibirsk. Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskii Matematicheskii Zhurnal, 2016, Volume 57, Number 6, Pages 1320–1332
DOI: https://doi.org/10.17377/smzh.2016.57.610 (Mi smj2826) 		 
This article is cited in 9 scientific papers (total in 9 papers)

The tabularity problem over the minimal logic

L. L. Maksimovaab, V. F. Yunab

a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (290 kB) Citations (9)
References:
PDF
HTML
DOI: https://doi.org/10.17377/smzh.2016.57.610
Abstract: We prove that the problem of tabularity over Johansson's minimal logic J is decidable. Describing all pretabular extensions of the minimal logic, we find that there are seven of them and show that they are all recognizable over J. We find axiomatizations and semantic characterizations of all seven pretabular logics.
Keywords: minimal logic, tabularity, pretabular logic, decidability, recognizable logic.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation НШ-860.2014.1
The authors were partially supported by the State Maintenance Problem for the Leading Scientific Schools (Grant NSh-860.2014.1).
Received: 21.10.2015
English version:
Siberian Mathematical Journal, 2016, Volume 57, Issue 6, Pages 1034–1043
DOI: https://doi.org/10.1134/S0037446616060100
Bibliographic databases:
Document Type: Article
UDC: 510.64
Language: Russian
Citation: L. L. Maksimova, V. F. Yun, “The tabularity problem over the minimal logic”, Sibirsk. Mat. Zh., 57:6 (2016), 1320–1332; Siberian Math. J., 57:6 (2016), 1034–1043
Citation in format AMSBIB
\Bibitem{MakYun16}
\by L.~L.~Maksimova, V.~F.~Yun
\paper The tabularity problem over the minimal logic
\jour Sibirsk. Mat. Zh.
\yr 2016
\vol 57
\issue 6
\pages 1320--1332
\mathnet{http://mi.mathnet.ru/smj2826}
\crossref{https://doi.org/10.17377/smzh.2016.57.610}
\elib{https://elibrary.ru/item.asp?id=27380121}
\transl
\jour Siberian Math. J.
\yr 2016
\vol 57
\issue 6
\pages 1034--1043
\crossref{https://doi.org/10.1134/S0037446616060100}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000391768100010}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85007107679}
Linking options:
  • https://www.mathnet.ru/eng/smj2826
  • https://www.mathnet.ru/eng/smj/v57/i6/p1320
    • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Сибирский математический журнал Siberian Mathematical Journal
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024