Jump to content

Kleene equality

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 21:47, 18 January 2024 (Added isbn. | Use this bot. Report bugs. | Suggested by Abductive | Category:Computability theory | #UCB_Category 41/100). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics, Kleene equality,[1] or strong equality, () 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 and , means that for every :[2]

  • and are both defined and
  • or and are both undefined.

References

  1. ^ "Kleene equality in nLab". ncatlab.org.
  2. ^ Cutland 1980, p. 3.
  1. Cutland, Nigel (1980). Computability, an introduction to recursive function theory. Cambridge University Press. p. 251. ISBN 978-0-521-29465-2.