|
This article is cited in 7 scientific papers (total in 7 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.
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
Linking options:
https://www.mathnet.ru/eng/sm2684https://doi.org/10.1070/SM1977v031n02ABEH003624 https://www.mathnet.ru/eng/sm/v144/i2/p289
|
Statistics & downloads: |
Abstract page: | 259 | Russian version PDF: | 100 | English version PDF: | 12 | References: | 35 |
|