Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
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



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






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


Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2011, Volume 8, Pages 365–368 (Mi semr334)  

This article is cited in 1 scientific paper (total in 1 paper)

Glivenko theorem for $N^*$-extensions

S. P. Odintsov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Full-text PDF (132 kB) Citations (1)
References:
Abstract: Logic $N^*$ was defined semantically via combination of Kripke frames for intuitionistic logic with Routley's $*$-operator, which is used to interpret the negation operation. In this notice, we find out the least logic in the class of $N^*$-extensions, which satisfy Glivenko's theorem, and describe the Kripke semantics of this logic.
Keywords: Routley semantics, Glivenko theorem.
Received July 15, 2011, published December 14, 2011
Document Type: Article
UDC: 510.64
MSC: 03B20,03B70
Language: English
Citation: S. P. Odintsov, “Glivenko theorem for $N^*$-extensions”, Sib. Èlektron. Mat. Izv., 8 (2011), 365–368
Citation in format AMSBIB
\Bibitem{Odi11}
\by S.~P.~Odintsov
\paper Glivenko theorem for $N^*$-extensions
\jour Sib. \`Elektron. Mat. Izv.
\yr 2011
\vol 8
\pages 365--368
\mathnet{http://mi.mathnet.ru/semr334}
Linking options:
  • https://www.mathnet.ru/eng/semr334
  • https://www.mathnet.ru/eng/semr/v8/p365
  • 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
    Statistics & downloads:
    Abstract page:331
    Full-text PDF :65
    References:58
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024