Unsatisfiable Formulae of Gödel Logic with Truth Constants and , \prec , \Delta Are Recursively Enumerable

Dusan Guller. Unsatisfiable Formulae of Gödel Logic with Truth Constants and , \prec , \Delta Are Recursively Enumerable. In Ying Tan, Yuhui Shi, Fernando Buarque de Lima Neto, Alexander F. Gelbukh, Swagatam Das, Andries P. Engelbrecht, editors, Advances in Swarm and Computational Intelligence - 6th International Conference, ICSI 2015, held in conjunction with the Second BRICS Congress, CCI 2015, Beijing, China, June 25-28, 2015, Proceedings, Part III. Volume 9142 of Lecture Notes in Computer Science, pages 242-250, Springer, 2015. [doi]

Abstract

Abstract is missing.