Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
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

2011

DOI

10.25596/jalc-2011-037