Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21--25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17--22, 2016 (Q5236465)
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: Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahr |
scientific article; zbMATH DE number 7114686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der
Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21--25, 2015
and the Dagstuhl seminar 16031 on well quasi-orders in computer
science, Schloss Dagstuhl, Germany, January 17--22, 2016 |
scientific article; zbMATH DE number 7114686 |
Statements
Well-Quasi Orders in Computation, Logic, Language and Reasoning (English)
0 references
8 October 2019
0 references
0.8136033415794373
0 references
0.7937788367271423
0 references
0.770296573638916
0 references
0.7592282891273499
0 references
0.7486817240715027
0 references
