1 results
DEGREE OF SATISFIABILITY IN HEYTING ALGEBRAS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 09 January 2024, pp. 1-19
-
- Article
-
- You have access
- HTML
- Export citation
-
We investigate degree of satisfiability questions in the context of Heyting algebras and intuitionistic logic. We classify all equations in one free variable with respect to finite satisfiability gap, and determine which common principles of classical logic in multiple free variables have finite satisfiability gap. In particular we prove that, in a finite non-Boolean Heyting algebra, the probability that a randomly chosen element satisfies
$x \vee \neg x = \top $ is no larger than 
$\frac {2}{3}$. Finally, we generalize our results to infinite Heyting algebras, and present their applications to point-set topology, black-box algebras, and the philosophy of logic.
