Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata

zbMATH Open1345.68217MaRDI QIDQ2819397FDOQ2819397

Authors: Michael Soltys 

Publication date: 29 September 2016

Published in: Journal of Automata, Languages and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Partial orders, general (06A06) Complexity of proofs (03F20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819397)