£125.54

Springer Well-Quasi Orders in Computation, Logic and Reasoning

Name: Springer Well-Quasi Orders in Computation, Logic and Reasoning
Brand: Springer
Price: 125.54 GBP
Availability: InStock

Architecture & Microprocessors

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

£126 today · previous high £126 · all-time low £123

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 48 days • 48 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 48 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £123 (35 days, 72.9%)

Price range: £123 - £126

Price levels: 3 different prices over 48 days

Description

This academic text from Springer provides a deep look into the theory of well-quasi orders (wqos) to connect the fields of logic, mathematics, and computer science. By exploring wqos as a unifying concept, the book offers insights into finiteness and termination proofs that are applicable across various mathematical disciplines. The content covers a wide range of mathematical areas, including proof theory, automata theory, formal languages, and descriptive set theory. Readers will find detailed information regarding the application of wqos in commutative algebra, braid groups, graph theory, and analytic combinatorics. It is a valuable resource for those studying the theory of relations, reverse mathematics, and subrecursive hierarchies. Whether you are researching combinatorial methods or looking for ways to bridge gaps between computation and logic, this volume serves as a comprehensive guide to understanding how well-quasi orders function as a central concept in modern mathematical research.

Key Features

Bridges the gaps between logic, mathematics, and computer science through the study of well-quasi orders.

Provides a unifying concept for proving finiteness and termination in diverse mathematical contexts.

Covers essential topics including proof theory, automata theory, formal languages, and descriptive set theory.

Explores connections to commutative algebra, braid groups, graph theory, and analytic combinatorics.

Includes technical discussions on the theory of relations, reverse mathematics, and subrecursive hierarchies.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3030302318
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 26 August 2021
Listed Since: 07 December 2020

Barcode

No barcode data available

Springer Well-Quasi Orders in Computation, Logic and Reasoning

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

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)

Proof And Computation II: From Proof Theory And Univalent Mathematics To Program Extraction And Verification

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

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

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

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

Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)

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)

Combinators, λ-Terms and Proof Theory: 42 (Synthese Library, 42)

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)

A First Course in Mathematical Logic and Set Theory

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)

A Bridge to Higher Mathematics (Textbooks in Mathematics)

Residuated Lattices: An Algebraic Glimpse at Substructural Logics

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

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