Explaining the undecidability of first-order logic by Timm Lampert, Anderson Nakano

“…We generate such pairs of formulas by mimicking computable sequences for a certain kind of universal Turing machine, namely, splitting Turing machines (STMs), via sequences of inference steps in ATP. …”
Get full text