Functional properties of four-valued paralogics

Natalia Tomova, Antonina Nepeivoda

Аннотация


Functional properties of four-valued paralogics


Полный текст:

PDF (English)

Литература


Bochvar D.A., Finn V.K. On many-valued logics which allow the formalization of antinomy analysis. Studies of Math. Linguistics, Mathematical Logic and Information Languages. Moscow, 1972, pp. 238–295 (in Russian).

Bürgisser P., Clausen M., Shokrollahi A. Algebraic Complexity Theory. Springer, 1997.

Karpenko A.S. A maximal paraconsistent logic: The combination of two three-valued isomorphs of classical propositional logic. Frontiers of Paraconsistent Log., D. Batens et

al. (eds.), Baldock Research Studies Press, 2000, pp. 181–187.

Karpenko A., Tomova N. Bochvar’s Three-Valued Logic and Literal Paralogics: Their Lattice and Functional Equivalence. Logic and Logical Philosophy 26(2), pp. 207–235, 2017.

Lewin R.A., Mikenberg I.F. Literal-paraconsistent and literal-paracomplete matrices. Math. Log. Quart. 52(5), pp. 478–493, 2006.

Lisitsa A., Nemytykh A. P. Reachability Analysis in Verification via Supercompilation. Int. J. Found. Comp. Science 19(4), pp. 953–970, 2008.

Nepeivoda A. Ping-pong protocols as prefix grammars: Modelling and verification via program transformation. J. Log. and Alg. Methods of Programming 85(5), pp. 782–804, 2016.

Turchin V. F. The Concept of a Supercompiler. ACM Transactions on Programming Languages and Systems 8(3), pp. 292–325, 1986.


Ссылки

  • На текущий момент ссылки отсутствуют.


Bookmark and Share


(c) 2018 Natalia Tomova, Antonina Nepeivoda

Лицензия Creative Commons
Это произведение доступно по лицензии Creative Commons «Attribution-NonCommercial» («Атрибуция — Некоммерческое использование») 4.0 Всемирная.