Scholarly Works

Feasible Proofs of Szpilrajn's Theorem - A...

Journal article

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

Authors

Soltys M

Journal

J. Autom. Lang. Comb., Vol. 16, , pp. 37–48

Publication Date

January 1, 2011

DOI

10.25596/jalc-2011-037

Associated Experts

Michael Soltys

Adjunct Professor, Faculty of Engineering

View published work (Non-McMaster Users)

Contact the Experts team

Get technical help

or

Provide website feedback