This will be either discarded or redone in context of #144.
Following a discussion with @vkuncak, this needs to be done more carefully while identifying what we allow. Specifically, idempotence for sets of formulae can encode graph colouring and introduce NP-completeness.
This will be either discarded or redone in context of #144.
Following a discussion with @vkuncak, this needs to be done more carefully while identifying what we allow. Specifically, idempotence for sets of formulae can encode graph colouring and introduce NP-completeness.