Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions

[1] SOLOVAY R.M., Provability interpretations of modal logic // Israel J. Math., 1975, 25, p. 287 - 304.10.1007/BF02757006Search in Google Scholar

[2] Post E.L. Introduction to a general theory of elementary propositions // Amer. J. Math., 1921, v. 43, p. 163 - 185.10.2307/2370324Search in Google Scholar

[3] Post E.L. Two-valued iterative systems of mathematical logic. Princeton, 1941.10.1515/9781400882366Search in Google Scholar

[4] KUZNETSOV A. V., On detecting non-deducibility and non-expressibility in: Locical deduction, Nauka, Moscow (1979), 5-33 (in russian)Search in Google Scholar

[5] DANIL'čENCO A. F. Parametric expressibility of functions of three-valued logic // Algebra i Logika, 16 (1977), pp.397-416 (in russian)10.1007/BF01669278Search in Google Scholar

[6] DANIL'čENCO A. F. On parametrical expressibility of the functions of k-valued logic // Colloq. Math. Soc. Janos Bolyai, 28, North-Holland, 1981, pp. 147-159.Search in Google Scholar

[7] BURRIS S., WILLARD R. Finitely many primitive positive clones // Proceedings of the American Mathematical Society, 101, no. 3, 1987, pp. 427-430.10.1090/S0002-9939-1987-0908642-5Search in Google Scholar

[8] MAGARI R., The diagonalizable algebras (the algebraization of the theories which express Theor.: II) // Boll. Unione Mat. Ital., 12 (1975) (suppl. fasc 3) pp. 117-125.Search in Google Scholar

[9] Maksimova, L.L. Continuum of normal extensions of the modal logic of provability with the interpolation property // Sib. Math. J. 30, No.6, 935-944 (1989)Search in Google Scholar