constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
In constructive mathematics, a generalisation of the notion of an ring with apartness which also allows for the denial inequality of rings to be used for the inequality relation.
A ring is an inequality ring or a ring with inequality if it comes with an irreflexive symmetric relation such that
for all , implies that or
for all , implies that
for all , implies that or
Some discussion about rings with inequality occurred in:
Last revised on January 2, 2025 at 14:48:12. See the history of this page for a list of all contributions to it.