summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1c2.md
blob: 86f6ffc0b43a87ebf1b876764d1b6c377713d413 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
+++
title = "Ordering the predicates to normalise them"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["2e1c1"]
forwardlinks = ["2e1c3"]
zettelid = "2e1c2"
+++

Maybe you can just order all the connectives under some defined strict
order ($R< Q < P$):

``` c
if (R) { x = 3; }
else if (Q) { x = 2; }
else if (P) { x = 1; }
else { x = 4; }
```

The problem is, this does not behave the same as the original property,
it will be hard to prove that the two statements that produced this code
will behave the same as each other if this representation is equivalent
in some way.

The original behaviour of the code disappears.