Abstract
A weak variant of Robinson's arithmetic Q where the binary operations of addition and multiplication are replaced by ternary relations (not necessarily defining total crisp functions) is formulated and investigated over the mathematical fuzzy logic BL∀. Essential undecidability of this fuzzy arithmetic is proved by a careful analysis of the classical proof of essential undecidability of arithmetic.
Get full access to this article
View all access options for this article.