Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata

Michael Soltys. Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata. Journal of Automata, Languages and Combinatorics, 16(1):27-38, 2011.

Abstract

Abstract is missing.