Fabian Egidy

The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably hard for tautologies and holds for many other sets.