Geodesic
Criterion of parametrical completeness in the 6-element non-chain extension of Intuitionistic logic of A. Heyting
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 3 (2006), pp. 45-50 
Vadim Cebotari. Criterion of parametrical completeness in the 6-element non-chain extension of Intuitionistic logic of A. Heyting. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 3 (2006), pp. 45-50. http://geodesic.mathdoc.fr/item/BASM_2006_3_a3/
@article{BASM_2006_3_a3,
     author = {Vadim Cebotari},
     title = {Criterion of parametrical completeness in the 6-element non-chain extension of {Intuitionistic} logic of {A.~Heyting}},
     journal = {Buletinul Academiei de \c{S}tiin\c{t}e a Republicii Moldova. Matematica},
     pages = {45--50},
     year = {2006},
     number = {3},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/BASM_2006_3_a3/}
}
TY  - JOUR
AU  - Vadim Cebotari
TI  - Criterion of parametrical completeness in the 6-element non-chain extension of Intuitionistic logic of A. Heyting
JO  - Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
PY  - 2006
SP  - 45
EP  - 50
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/BASM_2006_3_a3/
LA  - en
ID  - BASM_2006_3_a3
ER  - 
%0 Journal Article
%A Vadim Cebotari
%T Criterion of parametrical completeness in the 6-element non-chain extension of Intuitionistic logic of A. Heyting
%J Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
%D 2006
%P 45-50
%N 3
%U http://geodesic.mathdoc.fr/item/BASM_2006_3_a3/
%G en
%F BASM_2006_3_a3

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of parametrical completeness in the 6-element non-chain extension of Intuitionistic logic is considered. The conditions permiting to determine the parametrical completeness of an arbitrary system of formulas in mentionted logic are established in terms of 13 parametrical pre-complete classes of formulas.

[1] Brouwer L. E. J., “De onbetrouwbaarheid der logische principes”, Tijdschrift voor wijsbegeerte, 2 (1908), 152–158

[2] Kleene S. C. K., Introduction to metamathematics, Van Nostrand, Princeton, N.J., 1952 | MR

[3] Kuznetsov A. V., “On tools for the discovery of nondeducibity or non expressibility”, Logical Deduction, Nauka, Moscow, 1979, 5–33 (in Russian) | MR

[4] Danil'chenko A. F., “The criterion for becentral completeness in the 3-valued pseudo-Boolean algebra”, XI All-Union algebraic coll., Short communications and reports, Chişinău, 1971, 250–251 (in Russian)

[5] Kuku I. V., “On parametrical completeness for formula systems in the chain logics”, Bull. of the Academy of Sciences of Moldavian S. S. R. The Series of Fizical, Technical and Mathematical Sciences, 1988, no. 3, 9–14 (in Russian) | MR | Zbl

[6] Rasiowa H., Sikorski R., The mathematics of metamathematics, Monografie Mat., 41, PWN, Warszawa, 1963 | MR

[7] Raca M. F., “A criterion for functional completeness in the Intuitionistic Propositional logic”, Soviet Math. Dokl., 12:6 (1971), 1732–1737 (in Russian) | MR | Zbl

[8] Cohn P. M., Universal algebra, New York–Evanston–London, 1965 | MR