Meta-logic programming for a synonymy logic

In order to give a suitable framework for a synonymy-based logic programming, we argue about the possibility of reducing fuzzy logic programming to classical logical programming. More precisely, we show that given a fuzzy program in a language L, we can translate it into an equivalent classical program in a (meta-)language $$ {\text{L}}_{m} $$ in which every predicate name in L becomes a constant in $$ {\text{L}}_{m} . $$ This enables us to admit in $$ {\text{L}}_{m} $$ meta-relations among predicates and therefore, in particular, the synonymy.