Our website is made possible by displaying online advertisements to our visitors.
Please consider supporting us by disabling your ad blocker.

Responsive image


Setoid

In mathematics, a setoid (X, ~) is a set (or type) X equipped with an equivalence relation ~. A setoid may also be called E-set, Bishop set, or extensional set.[1]

Setoids are studied especially in proof theory and in type-theoretic foundations of mathematics. Often in mathematics, when one defines an equivalence relation on a set, one immediately forms the quotient set (turning equivalence into equality). In contrast, setoids may be used when a difference between identity and equivalence must be maintained, often with an interpretation of intensional equality (the equality on the original set) and extensional equality (the equivalence relation, or the equality on the quotient set).

  1. ^ Alexandre Buisse, Peter Dybjer, "The Interpretation of Intuitionistic Type Theory in Locally Cartesian Closed Categories—an Intuitionistic Perspective", Electronic Notes in Theoretical Computer Science 218 (2008) 21–32.

Previous Page Next Page








Responsive image

Responsive image