RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Sb.:
Year:
Volume:
Issue:
Page:
Find






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


Mat. Sb. (N.S.), 1977, Volume 102(144), Number 2, Pages 289–301 (Mi msb2684)  

This article is cited in 4 scientific papers (total in 4 papers)

On finite approximability of superintuitionistic logics

S. K. Sobolev


Abstract: Finite approximability is proved for superintuitionistic propositional logics generated by formulas satisfying a certain sufficient condition. As a corollary, one obtains the finite approximability of logics generated by formulas with one variable. A formula with two variables is constructed which generates a logic not finitely approximable. All previously known finitely approximable logics have been generated by formulas in three or more variables (see RZhMat., 1971, 5A64 and 1972, 6A84).
Figures: 1.
Bibliography: 6 titles.

Full text: PDF file (1361 kB)
References: PDF file   HTML file

English version:
Mathematics of the USSR-Sbornik, 1977, 31:2, 257–268

Bibliographic databases:

UDC: 517.11
MSC: Primary 02B05, 02E05, 02C15, 02J05; Secondary 02H15, 02C99, 02J99
Received: 10.05.1976

Citation: S. K. Sobolev, “On finite approximability of superintuitionistic logics”, Mat. Sb. (N.S.), 102(144):2 (1977), 289–301; Math. USSR-Sb., 31:2 (1977), 257–268

Citation in format AMSBIB
\Bibitem{Sob77}
\by S.~K.~Sobolev
\paper On finite approximability of superintuitionistic logics
\jour Mat. Sb. (N.S.)
\yr 1977
\vol 102(144)
\issue 2
\pages 289--301
\mathnet{http://mi.mathnet.ru/msb2684}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=453501}
\zmath{https://zbmath.org/?q=an:0352.02020|0386.03010}
\transl
\jour Math. USSR-Sb.
\yr 1977
\vol 31
\issue 2
\pages 257--268
\crossref{https://doi.org/10.1070/SM1977v031n02ABEH003624}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=A1977FY72200009}


Linking options:
  • http://mi.mathnet.ru/eng/msb2684
  • http://mi.mathnet.ru/eng/msb/v144/i2/p289

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Chagrov A., Zakharyaschev M., “The Undecidability of the Disjunction Property of Propositional Logics and Other Related Problems”, J. Symb. Log., 58:3 (1993), 967–1002  crossref  mathscinet  zmath  isi
    2. Zakharyaschev M., “Canonical Formulas for K4 .3. the Finite Model Property”, J. Symb. Log., 62:3 (1997), 950–975  crossref  mathscinet  zmath  isi
    3. A.S.. Kechris, “1996–1997 Winter Meeting of the Association for Symbolic Logic”, Bull. symb. log, 3:03 (1997), 367  crossref
    4. Camillo Fiorentini, “All intermediate logics with extra axioms in one variable, except eight, are not strongly ω-complete”, J. symb. log, 65:04 (2000), 1576  crossref
  • Математический сборник (новая серия) - 1964–1988 Sbornik: Mathematics (from 1967)
    Number of views:
    This page:161
    Full text:70
    References:11

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020