SIMILARITY LOGIC AND TRANSLATIONS
The paper gives a slight extension of classical predicate logic. The main idea is to introduce a congruence of terms and formulas and to specify a \textit{relaxed modus ponens}, that is, a rule of the form \[ \frac{\alpha, \alpha'\Rightarrow \beta, \alpha\equiv \alpha'}{\beta} \] where \(\equiv\) is a congruence between formulas. Then the authors consider a translation \(\tau\) of one logic into another and consider one special congruence when \(\alpha\equiv\alpha'\) iff \(\tau(\alpha)=\tau(\alpha')\). Furthermore, they introduce a special fuzzy equality relation that is transitive with respect to the minimum operation. Cuts of such fuzzy equality are fuzzy equivalences, and so the above relaxed modus ponens may also apply. The paper, unfortunately, contains flaws in English (some sentences even make no sense). Though the above idea is reasonable, there is no significant result in the paper.
This page was built for publication: SIMILARITY LOGIC AND TRANSLATIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819222)
