We give a new proof of the following result (originally due to Linial and Post): it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of ...

One of the ways that Pi Mu Epsilon promotes scholarship in mathematics is through the publishing of the Pi Mu Epsilon Journal. The sole purpose of this journal is to present papers and mathematical ...

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 ...