Evaluation trees for proposition algebra
Jan A. Bergstra, Alban Ponse

TL;DR
This paper introduces evaluation trees for proposition algebra, characterizing various valuation congruences through transformations and axiomatizations, enhancing understanding of conditional statement equivalences.
Contribution
It provides a novel tree-based semantics and transformations for different valuation congruences in proposition algebra, with axiomatizations and normalization functions.
Findings
Evaluation trees characterize free valuation congruence.
Transformations on trees characterize other valuation congruences.
Axiomatizations and normalization functions are developed for each congruence.
Abstract
Proposition algebra is based on Hoare's conditional connective, which is a ternary connective comparable to if-then-else and used in the setting of propositional logic. Conditional statements are provided with a simple semantics that is based on evaluation trees and that characterizes so-called free valuation congruence: two conditional statements are free valuation congruent if, and only if, they have equal evaluation trees. Free valuation congruence is axiomatized by the four basic equational axioms of proposition algebra that define the conditional connective. Valuation congruences that identify more conditional statements than free valuation congruence are repetition-proof, contractive, memorizing, and static valuation congruence. Each of these valuation congruences is characterized using a transformation on evaluation trees: two conditional statements are C-valuation congruent if,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
