Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata (Q2819397)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata |
scientific article; zbMATH DE number 6630810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata |
scientific article; zbMATH DE number 6630810 |
Statements
29 September 2016
0 references
Feasible proofs of Szpilrajn's theorem -- a proof-complexity framework for concurrent automata (English)
0 references
