Upper Bounds on the Graph Minor Theorem

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

Metadata

Authors/Creators:
  • Krombholz, M
  • Rathjen, M
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:
  • Published: 3 January 2020
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: 28 Oct 2020 16:26
Status: Published
Publisher: Springer International Publishing
Identification Number: https://doi.org/10.1007/978-3-030-30229-0

Download

Accepted Version


Embargoed until: 3 January 2022

Filename: book chapter.pdf

Request a copy

file not available

Share / Export

Statistics