Apartness relations between propositions

09/08/2022
by   Zoltan A. Kocsis, et al.
0

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 E. Rijke on 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 either.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2023

Truth values algebras and proof normalization

We extend the notion of Heyting algebra to a notion of truth values alge...
research
12/29/2021

A Boolean Algebra for Genetic Variants

Beyond identifying genetic variants, we introduce a set of Boolean relat...
research
12/18/2019

Hardness of Network Satisfaction for Relation Algebras with Normal Representations

We study the computational complexity of the general network satisfactio...
research
06/27/2016

Propagators and Solvers for the Algebra of Modular Systems

To appear in the proceedings of LPAR 21. Solving complex problems can ...
research
02/15/2018

Models of Type Theory Based on Moore Paths

This paper introduces a new family of models of intensional Martin-Löf t...
research
03/20/2020

Cartesian bicategories with choice

Relational structures are emerging as ubiquitous mathematical machinery ...
research
01/15/2019

Existence of cube terms in finite finitely generated clones

We study the problem of whether a given finite clone generated by finite...

Please sign up or login with your details

Forgot password? Click here to reset