Algorithms of the recognition of the tabularity and pretabularity in the extensions of the intuitionistic calculus
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 6 (2006) no. 3, pp. 49-58 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In the given work the algorithms allowing to carry out automatic recognition of tabular and pretabular properties at superintuitionistic and positive propositional logics and programs realizing these algorithms are described.
@article{VNGU_2006_6_3_a3,
     author = {L. L. Maksimova and P. A. Schreiner},
     title = {Algorithms of the recognition of the tabularity and pretabularity in the extensions of the intuitionistic calculus},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {49--58},
     year = {2006},
     volume = {6},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2006_6_3_a3/}
}
TY  - JOUR
AU  - L. L. Maksimova
AU  - P. A. Schreiner
TI  - Algorithms of the recognition of the tabularity and pretabularity in the extensions of the intuitionistic calculus
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2006
SP  - 49
EP  - 58
VL  - 6
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/VNGU_2006_6_3_a3/
LA  - ru
ID  - VNGU_2006_6_3_a3
ER  - 
%0 Journal Article
%A L. L. Maksimova
%A P. A. Schreiner
%T Algorithms of the recognition of the tabularity and pretabularity in the extensions of the intuitionistic calculus
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2006
%P 49-58
%V 6
%N 3
%U http://geodesic.mathdoc.fr/item/VNGU_2006_6_3_a3/
%G ru
%F VNGU_2006_6_3_a3
L. L. Maksimova; P. A. Schreiner. Algorithms of the recognition of the tabularity and pretabularity in the extensions of the intuitionistic calculus. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 6 (2006) no. 3, pp. 49-58. http://geodesic.mathdoc.fr/item/VNGU_2006_6_3_a3/

[1] P. A. Shrainer, “Avtomaticheskoe raspoznavanie interpolyatsionnogo svoistva u nekotorykh superintuitsionistskikh propozitsionalnykh logik”, Vestnik NGU, 3:4 (2003), 85–92

[2] L. L. Maksimova, Razreshimye svoistva superintuitsionistskikh i modalnykh logik, Dis. ... dokt. fiz.-matem. nauk, Novosibirsk, 1983

[3] L. L. Maksimova, “Neyavnaya opredelimost i pozitivnye logiki”, Algebra i logika, 42:1 (2003), 65–93 | MR | Zbl

[4] L. Maksimova, A. Voronkov, “Complexity of Some Problems in Modal and Intuitionistic Calculi”, Computer Science Logic, Springer, 2003, 397–412 | DOI | MR | Zbl

[5] L. Maksimova, “Complexity of interpolation and related problems in positive calculi”, The Journal of Symbolic Logic, 67:1 (2002), 28–55 | DOI | MR

[6] L. L. Maksimova, “Predtablichnye superintuitsionistskie logiki”, Algebra i logika, 11:5 (1972), 643–681

[7] T. Hosoi, “On intermediate logics”, J. Fac. Sci. Univ. Tokyo, 14 (1967), 293–312 | MR

[8] J. M. Dunn, R. K. Meyer, “Algebraic completeness results for Dummets $LC$ and its extensions”, Zeitschr. math. Log. und Grundl. Math., 17 (1971), 225–230 | DOI | MR | Zbl

[9] T. Hosoi, H. Ono, “The intermediate logics of the second slice”, J. Fac. Sci. Univ. Tokyo, 17 (1970), 457–461 | MR | Zbl

[10] L. L. Maksimova, “Teorema Kreiga v superintuitsionistskikh logikakh i amalgamiruemye mnogoobraziya psevdobulevykh algebr”, Algebra i logika, 16:6 (1977), 643–681 | MR | Zbl

[11] A. V. Kuznetsov, “Nekotorye svoistva struktury mnogoobrazii psevdobulevykh algebr”, Vsesoyuznyi algebraicheskii kollokvium (Kishinev, 1971), 258–259

[12] Kh. Raseva, Sikorskii R., Matematika metamatematiki, Nauka, M., 1972 | MR

[13] M. I. Verkhozina, “Promezhutochnye pozitivnye logiki”, Algoritmicheskie voprosy algebraicheskikh sistem, Irkutsk, 1978, 13–25

[14] L. L. Maksimova, “Predtablichnye rasshireniya logiki $S4$ Lyuisa”, Algebra i logika, 14:1 (1975), 28–55 | MR | Zbl

[15] L. L. Esakia, V. Yu. Meskhi, “Five critical systems”, Theoria, 40 (1977), 52–60 | MR