Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory: 53 (Trends in Logic, 53) - Image 1

£127.59

Springer Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory: 53 (Trends in Logic, 53)

Name: Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory: 53 (Trends in Logic, 53)
Brand: Springer
Price: 127.59 GBP
Availability: InStock

Architecture & Microprocessors

This is the most expensive it has ever been. Walk away.

£128 today · previous high £128 · all-time low £110

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 31 days • 31 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 31 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £121 (27 days, 87.1%)

Price range: £110 - £128

Price levels: 3 different prices over 31 days

Description

This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students. From the Back Cover This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students. About the Author 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 Full Professor 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.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3030302288
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 03 January 2020
Listed Since: 01 August 2019

Barcode

No barcode data available

Springer Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory: 53 (Trends in Logic, 53)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Truth, Existence and Explanation: FilMat 2016 Studies in the Philosophy of Mathematics: 334 (Boston Studies in the Philosophy and History of Science, 334)

Logic of Mathematics: A Modern Course of Classical Logic: 22 (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)

An Introduction to Mathematical Proofs (Textbooks in Mathematics)

Gentzens Problem: Mathematische Logik im nationalsozialistischen Deutschland

An Algebraic Introduction to Mathematical Logic: 22 (Graduate Texts in Mathematics, 22)

A First Course in Mathematical Logic and Set Theory

An Outline of Mathematical Logic: Fundamental Results and Notions Explained with all Details: 70 (Synthese Library, 70)

An Introduction to Mathematical Proofs (Textbooks in Mathematics)

Residuated Lattices: An Algebraic Glimpse at Substructural Logics

Set Theory for Beginners: A Rigorous Introduction to Sets, Relations, Partitions, Functions, Induction, Ordinals, Cardinals, Martin’s Axiom, and Stationary Sets

Introduction to Mathematical Logic: Set Theory Computable Functions Model Theory (Undergraduate Texts in Mathematics)

Gödel's Incompleteness Theorems: A Guided Tour Through Kurt Gödel’s Historic Proof

A Bridge to Higher Mathematics (Textbooks in Mathematics)

Substructural Logics: A Primer: 13 (Trends in Logic, 13)

A Modern Perspective on Type Theory: From its Origins until Today: 29 (Applied Logic Series, 29)

A Modern Perspective on Type Theory: From its Origins until Today: 29 (Applied Logic Series, 29)

Computational Logic and Set Theory: Applying Formalized Logic to Analysis

Kurt Gödel: The Princeton Lectures on Intuitionism (Sources and Studies in the History of Mathematics and Physical Sciences)

An Invitation to Mathematical Logic: 301 (Graduate Texts in Mathematics, 301)

Set Theory An Introduction To Independence Proofs: 102 (Studies in Logic and the Foundations of Mathematics): Volume 102

An Invitation to Mathematical Logic: 301 (Graduate Texts in Mathematics, 301)

Kurt Gödel: The Princeton Lectures on Intuitionism (Sources and Studies in the History of Mathematics and Physical Sciences)

Proof Techniques: The All in One Textbook (Haneul Choi Mathematics Textbooks)