Abstract
Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference18 articles.
1. On the extension of the intuitionist propositional calculus to the classical calculus, and the minimal calculus to the intuitionist calculus (in Russian);Yankov;Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya,1968
2. The justification of the basic laws of logic;Russell;Journal of Philosophical Logic,2015
3. [14] Pitts, A. M. , On an interpretation of second order quantification in first order intuitionistic propositional logic, this Journal, vol. 57 (1992), pp. 33–521992.