Krombholz, M and Rathjen, M (2020) Upper Bounds on the Graph Minor Theorem. In: Schuster, P, Seisenberger, M and Weiermann, A, (eds.) Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory. Springer International Publishing , pp. 145-159. ISBN 978-3030302283
Abstract
Lower bounds on the proof-theoretic strength of the graph minor theorem were found over 30 years ago by [4], but upper bounds have always been elusive. We present recently found upper bounds on the graph minor theorem and other theorems appearing in the Graph Minors series. Further, we give some ideas as to how the lower bounds on some of these theorems might be improved.
Metadata
Item Type: | Book Section |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © Springer Nature Switzerland AG 2020. This is an author produced version of a book chapter published in Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Philosophy |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Pure Mathematics (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 28 Oct 2020 16:26 |
Last Modified: | 03 Jan 2022 01:38 |
Status: | Published |
Publisher: | Springer International Publishing |
Identification Number: | 10.1007/978-3-030-30229-0 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:165666 |