constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
A partial order in the antithesis interpretation of constructive mathematics in intuitionistic logic.
An antithesis partial order is a partial order equipped with an irreflexive and symmetric relation and a relation such that for all , , and ,
and implies that
and implies that
implies that
implies that or
In addition, we have the following concepts:
An antithesis partial order is strong if is a cotransitive relation.
An antithesis partial order is linear if for all and , implies .
An antithesis partial order is total if is a total relation.
An antithesis partial order is affirmative if is a denial inequality.
An antithesis partial order is refutative if is a tight relation.
Created on January 3, 2025 at 01:47:28. See the history of this page for a list of all contributions to it.