VOLUME 16

2011

NUMBER 1

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

Michael Soltys

Pages 37–48

Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX

BibTeX:

@article{JALC-2011-037,
  author  = {Michael Soltys},
  title   = {Feasible Proofs of Szpilrajn's Theorem -- A Proof-Complexity Framework for Concurrent Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {16},
  number  = {1},
  pages   = {37--48},
  year    = {2011},
  url     = {https://doi.org/10.25596/jalc-2011-037},
  doi     = {10.25596/jalc-2011-037}
}