Much has been said about intuitionistic and classical logical systems since Gentzen’s seminal work. Recently, Prawitz and others have been discussing how to put together Gentzen’s systems for ...

This is a preview. Log in through your library . Abstract Global properties of canonical derivability predicates (the standard example is Pr() in Peano Arithmetic) are studied here by means of a ...

Computational complexity and proof systems are fundamental areas in theoretical computer science that explore the limits of what can be computed and how efficiently problems can be solved. Recent ...

Modal logic, an extension of classical logic, investigates the modes of truth such as necessity and possibility. Its development has been closely intertwined with advances in proof theory, a field ...