Apartness relations between propositions
Zoltan A. Kocsis · Mathematical logic quarterly · 2024
Abstract We classify all apartness relations definable in propositional logics extending intuitionistic logic using Heyting algebra semantics. We show that every Heyting algebra which contains a non‐trivial apartness term satisfies the weak law of excluded middle, and every Heyting algebra which contains a tight apartness term is in fact a Boolean algebra. This answers a question of Rijke regarding the correct notion of apartness for propositions, and yields a short classification of apartness terms that can occur in a Heyting algebra. We also show that Martin‐Löf Type Theory is not able to construct non‐trivial apartness relations between propositions.