summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1c3b.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/2e1c3b.md')
-rw-r--r--content/zettel/2e1c3b.md19
1 files changed, 19 insertions, 0 deletions
diff --git a/content/zettel/2e1c3b.md b/content/zettel/2e1c3b.md
new file mode 100644
index 0000000..6a87270
--- /dev/null
+++ b/content/zettel/2e1c3b.md
@@ -0,0 +1,19 @@
++++
+title = "Sorting list of if-statements"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["2e1c3a"]
+forwardlinks = []
+zettelid = "2e1c3b"
++++
+
+The sorting of the statements can be done by sorting the list according
+to the expressions inside the predicates, and merging the predicates
+(using $\lor$) for the expressions that are equivalent. Then, it should
+be possible to just sequentially prove the equivalence of each of the
+predicates in the list that have the same symbolic values.
+
+For expressions that do not appear in either of the list, the predicate
+on them should evaluate to being false, which would be the only valid
+reason for it to not appear as one of the possibilities.