Extended fuzzy constructive logic
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XII, Tome 407 (2012), pp. 35-76
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

A logical system is introduced which is similar to the “fuzzy constructive logic” earlier developed by the author, however this new system gives larger possibilities for establishing the truth of predicate formulas and logical deductions in the framework of this logic. The notions of strong and weak FCL$^*$-validity of predicate formulas are defined. It is proved that every formula deducible in the constructive (intuitionistic) predicate calculus is strongly FCL$^*$-valid. From other hand it is proved that some formulas not deducible in the mentioned calculus are not weakly FCL$^*$-valid. A definition is given for the semantics of the traditional constructive logic on the base of the developed logical apparatus. Theorems are proved showing differences between the extended fuzzy constructive logic and the traditional constructive logic.
@article{ZNSL_2012_407_a2,
     author = {I. D. Zaslavsky},
     title = {Extended fuzzy constructive logic},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {35--76},
     year = {2012},
     volume = {407},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a2/}
}
TY  - JOUR
AU  - I. D. Zaslavsky
TI  - Extended fuzzy constructive logic
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2012
SP  - 35
EP  - 76
VL  - 407
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a2/
LA  - ru
ID  - ZNSL_2012_407_a2
ER  - 
%0 Journal Article
%A I. D. Zaslavsky
%T Extended fuzzy constructive logic
%J Zapiski Nauchnykh Seminarov POMI
%D 2012
%P 35-76
%V 407
%U http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a2/
%G ru
%F ZNSL_2012_407_a2
I. D. Zaslavsky. Extended fuzzy constructive logic. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part XII, Tome 407 (2012), pp. 35-76. http://geodesic.mathdoc.fr/item/ZNSL_2012_407_a2/

[1] A. S. Esenin-Volpin, “Analiz potentsialnoi osuschestvimosti”, Logicheskie issledovaniya, Sbornik statei, Izd-vo AN SSSR, M., 1959, 218–262 | MR

[2] I. D. Zaslavskii, “O konstruktivnoi istinnosti suzhdenii i nekotorykh netraditsionnykh sistemakh konstruktivnoi logiki”, Matematicheskie voprosy kibernetiki i vychislitelnoi tekhniki, Trudy VTs AN Arm. SSR i EGU, 8, 1975, 99–153 | MR

[3] I. D. Zaslavskii, “Nechetkaya konstruktivnaya logika”, Zap. nauchn. semin. POMI, 358, 2008, 130–152 | MR

[4] B. A. Kushner, Lektsii po konstruktivnomu matematicheskomu analizu, Nauka, M., 1973 | MR

[5] A. I. Maltsev, Algoritmy i rekursivnye funktsii, 2-e izd., Nauka, M., 1986 | MR | Zbl

[6] S. N. Manukyan, “O perechislimykh predikatakh i sekventsialnykh ischisleniyakh nechetkoi logiki”, 9-ya Vsesoyuznaya konferentsiya po matematicheskoi logike, Tezisy dokladov, Leningrad, 1988, 100

[7] S. N. Manukyan, “O predstavlenii nechetkikh rekursivno perechislimykh mnozhestv”, 11-ya Mezhrespublikanskaya konferentsiya po matematicheskoi logike, Tezisy dokladov, Kazan, 1992, 94

[8] S. N. Manukyan, “O strukture nechetkikh rekursivno perechislimykh mnozhestv”, Matematicheskie voprosy kibernetiki i vychislitelnoi tekhniki, Trudy Instituta problem informatiki i avtomatizatsii, 17, 1997, 86–91

[9] S. N. Manukyan, “Nekotorye algebry rekursivno perechislimykh mnozhestv i ikh prilozheniya k nechetkoi logike”, Zap. nauchn. semin. POMI, 304, 2003, 75–98 | MR | Zbl

[10] A. A. Markov, “Konstruktivnaya logika”, Uspekhi matem. nauk, 5:3(37) (1950), 187–188 | MR

[11] A. A. Markov, “Ob odnom printsipe konstruktivnoi matematicheskoi logiki”, Trudy 3-go Vsesoyuznogo matem. s'ezda, v. 2, 1956, 146–147

[12] A. A. Markov, “O konstruktivnoi matematike”, Trudy MIAN SSSR, 67, 1962, 8–14 | MR | Zbl

[13] A. A. Markov, O logike konstruktivnoi matematiki, Znanie, M., 1972

[14] P. K. Rashevskii, “O dogmate naturalnogo ryada”, Uspekhi matem. nauk, 28:4(172) (1973), 243–246 | MR | Zbl

[15] G. S. Tseitin, “Odin sposob izlozheniya teorii algoritmov i perechislimykh mnozhestv”, Trudy MIAN SSSR, 72, 1964, 69–98 | MR | Zbl

[16] N. A. Shanin, “O konstruktivnom ponimanii matematicheskikh suzhdenii”, Trudy MIAN SSSR, 52, 1958, 266–311 | MR | Zbl

[17] N. A. Shanin, “Konstruktivnye veschestvennye chisla i konstruktivnye funktsionalnye prostranstva”, Trudy MIAN SSSR, 67, 1962, 15–294 | MR | Zbl

[18] H. B. Enderton, A Mathematical Introduction to Logic, 2nd edition, Harcourt, Academic Press, San Diego, 2001 | MR | Zbl

[19] P. Hajek, Metamathematics of Fuzzy Logic, Kluwer, 1998 | MR | Zbl

[20] A. Heyting, Intuitionism (An Introduction), North-Holl. Publ. Comp., Amsterdam, 1956 | MR | Zbl

[21] S. C. Kleene, “On the interpretation of intuitionistic number theory”, J. Symb. Logic, 10:4 (1945), 100–123 | DOI | MR

[22] S. C. Kleene, Introduction to Metamathematics, D. van Nostrand Comp., Inc., New York–Toronto, 1952 | MR

[23] S. C. Kleene, R. E. Vesley, The foundations of intuituonistic mathematics especially in relation to recursive functions, North-Holl. Publ. Comp., Amsterdam, 1965 | MR | Zbl

[24] H. R. Lewis, C. H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall, Upper Saddle River, New Jersey, 1998

[25] S. N. Manukian, “On some properties of recursively enumerable fuzzy sets”, Proceedings of the Conference “Computer Science and Information Technologies”, CSIT-99 (August 1999), Yerevan, Armenia, 1999, 5–6

[26] S. N. Manukian, “Algorithmic operators on recursively enumerable fuzzy sets”, Proceedings of the Conference “Computer Science and Information Technologies”, CSIT-01 (September 2001), Yerevan, Armenia, 2001, 125–126

[27] S. N. Manukian, “On binary recursively enumerable fuzzy sets”, International Conference “ 21st Days of Weak Arithmetics”, Abstracts (St. Petersburg, Russia, June 2002), St. Petersburg, 2002, 13–15

[28] S. N. Manukian, “Algebras of recursively enumerable sets and their applications to fuzzy logic”, J. Mathem. Sci., 130:2 (2005), 4598–4606 | DOI | MR | Zbl

[29] E. Mendelson, Introduction to Mathematical Logic, D. van Nostrand Comp., Inc., Princeton–Toronto–New York–London, 1963 | MR

[30] V. Novak, Fuzzy sets and their applications, Adam Hilger, Bristol, 1989 | MR | Zbl

[31] V. Novak, I. Perfilieva, J. Mockor, Mathematical Principles of Fuzzy Logic, Kluwer Academic Publishers, 1999 | MR

[32] H. Rogers, Theory of Recursive Functions and Effective Computability, Mc. Graw Hill Book Comp., New York–St. Louis–San Francisco–Toronto–London–Sydney, 1967 | MR

[33] E. Specker, “Nicht konstructiv beweisbare Satze der Analysis”, J. Symb. Logic, 14:3 (1949), 145–158 | DOI | MR | Zbl

[34] G. Takeuti, Proof Theory, North-Holl. Publ. Comp., Amsterdam–London; Amer. Elsevier Publ. Comp., Inc., New York, 1975 | MR | Zbl

[35] G. Takeuti, Satoko Titani, “Intuitionistic fuzzy logic and intuitionistic fuzzy set theory”, J. Symb. Logic, 49:3 (1984), 851–866 | DOI | MR | Zbl

[36] A. S. Troelstra, H. Schwichtenberg, Basic Proof Theory, Cambridge Univ. Press, Cambridge–New York, 2000 | MR | Zbl

[37] J. Yen, R. Langari, Fuzzy Logic, Intelligence, Control, and Information, Prentice Hall, Upper Saddle River, New Jersey, 1999

[38] L. Zadeh, “Fuzzy sets”, Inform. Control, 8 (1965), 338–353 | DOI | MR | Zbl