Give how beliefs and disbeliefs are provability and disprovability, I'm curious whether there'll be something in proof compression that provides efficient summarization. Perhaps if we know exactly the conclusions to be proved are known this can be simplified. I don't know, just speculating.
Give how beliefs and disbeliefs are provability and disprovability, I'm curious whether there'll be something in proof compression that provides efficient summarization. Perhaps if we know exactly the conclusions to be proved are known this can be simplified. I don't know, just speculating.