Live briefing
Everything about Setoid
Mathematical construction of a set with an equivalence relation
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. Wikipedia →
đź§ Start here: a 6-step reading path
- Read the overview: SetoidA 5-minute orientation
- Go sideways: Intuitionistic type theoryA closely related topic
- Go sideways: Constructivism (philosophy of mathematics)A closely related topic
đź“– Definitions
Noun A set together with an equivalence relation.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Intuitionistic type theory Intuitionistic type theory (also known as constructive type theory, or Martin-Löf type theory (MLTT)) is a type theory and an alternative foundation of…
- Constructivism (philosophy of mathematics) In philosophy of mathematics, constructivism asserts that it is necessary to find (or "construct") a specific example of a mathematical object in order…
- Constructive set theory Axiomatic constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. The same first-order language…
- Partial equivalence relation In mathematics, a partial equivalence relation (often abbreviated as PER, in older literature also called restricted equivalence relation) is a homogeneous…
- Homotopy type theory In mathematical logic and computer science, homotopy type theory (HoTT) includes various lines of development of intuitionistic type theory, based on the…
- Extensionality In logic, extensionality, or extensional equality, refers to principles that judge objects to be equal if they have the same external properties. It stands…
- Apartness relation In constructive mathematics, an apartness relation is a constructive form of inequality, and is often taken to be more basic than equality. An apartness…
- Quotient type In the field of type theory in computer science, a quotient type is a data type that respects a user-defined equality relation. A quotient type defines…