Produktbild: Well-Quasi Orders in Computation, Logic, Language and Reasoning
Band 53

Well-Quasi Orders in Computation, Logic, Language and Reasoning A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory

Aus der Reihe Trends in Logic

175,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

26.08.2021

Abbildungen

X, 391 p. 103 illus., 4 illus. in color.

Herausgeber

Peter M. Schuster + weitere

Verlag

Springer

Seitenzahl

391

Maße (L/B/H)

23,5/15,5/2,2 cm

Gewicht

610 g

Auflage

21001 Auflage 1st ed. 2020

Sprache

Englisch

ISBN

978-3-030-30231-3

Beschreibung

Portrait


Peter Schuster
is an Associate Professor of Mathematical Logic at the University of Verona. After completing both his doctorate and habilitation in mathematics at the University of Munich, he was a Lecturer at the University of Leeds and member of the Leeds Logic Group. Apart from constructive mathematics in general, his principal research interests are in the computational content of classical proofs in abstract algebra and related fields, in which maximum or minimum principles are invoked.



Monika Seisenberger
is an Associate Professor of Computer Science at Swansea University. After completing a PhD in the Graduate Programme “Logic in Computer Science” at the LMU Munich she took up a position as research assistant at Swansea University, where she was subsequently appointed lecturer and later programme director. Her research focuses on logic, and on theorem proving and verification.



Andreas Weiermann
is a FullProfessor of Mathematics at Ghent University. After completing both his doctorate and habilitation in mathematics at the University of Münster, he held postdoctoral positions in Münster and Utrecht and became first an Associate Professor and later Full Professor in Ghent. His research interests include proof theory, theoretical computer science and discrete mathematics.



Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

26.08.2021

Abbildungen

X, 391 p. 103 illus., 4 illus. in color.

Herausgeber

Verlag

Springer

Seitenzahl

391

Maße (L/B/H)

23,5/15,5/2,2 cm

Gewicht

610 g

Auflage

21001 Auflage 1st ed. 2020

Sprache

Englisch

ISBN

978-3-030-30231-3

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Well-Quasi Orders in Computation, Logic, Language and Reasoning

  • Well, Better, and in-between.- The Categorical Structure of Well-Quasi Orders.- On Kriz's Theorem.- On the Width of FAC Orders, a Somewhat Rediscovered Notion.- Preliminary Well-quasi Orders in the Study of Hierarchies and Reducibilities.- The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings.- Well-Quasi Orders and Regularity.- Well Quasi Ordering and Embeddability of Relational Structures.- A Functional Interpretation of Zorn's Lemma and its Application in Well-Quasi-Order Theory.- The Reverse Mathematics of wqos and bqos.- Well-partial Ordering and the Maximal Order Type.- TBC.- The Worlds of Well-Partial-Orders and Ordinal Notation systems.- Bounds for the Strength of the Graph Minor Theorem.