// Workers AI · dad joke modeWhat did Kleene equality say to its date? You're equal to my heart.

In mathematics, Kleene equality, or strong equality, ($\simeq$) is an equality operator on partial functions, that states that on a given argument either both functions are undefined, or both are defined and their values on that arguments are equal.

For example, if we have partial functions $f$ and $g$, $f\simeq g$ means that for every $x$:

• $f(x)$ and $g(x)$ are both defined and $f(x)=g(x)$
• or $f(x)$ and $g(x)$ are both undefined.

Some authors are using "quasi-equality", which is defined like this: $(y_{1}\sim y_{2}):\Leftrightarrow ((y_{1}\downarrow \lor y_{2}\downarrow )\longrightarrow y_{1}=y_{2}),$ where the down arrow means that the term on the left side of it is defined. Then it becomes possible to define the strong equality in the following way: $(f\simeq g):\Leftrightarrow (\forall x.(f(x)\sim g(x))).$

References

• Cutland, Nigel (1980). Computability, an introduction to recursive function theory. Cambridge University Press. p. 251. ISBN 978-0-521-29465-2.