The Mathematics of Coordinated Inference: A Study of Generalized Hat Problems: 33 (Developments in Mathematics, 33) - Image 1

£39.62

Springer The Mathematics of Coordinated Inference: A Study of Generalized Hat Problems: 33 (Developments in Mathematics, 33)

Name: The Mathematics of Coordinated Inference: A Study of Generalized Hat Problems: 33 (Developments in Mathematics, 33)
Brand: Springer
Price: 39.62 GBP
Availability: InStock

Mathematical Logic

About as cheap as it gets. The only time it was cheaper was 3 months ago.

£40 today · all-time low £39 (Feb 2026) · usually £40

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

Historical

Generating forecast...

Price Distribution

Price distribution over 73 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £40 (49 days, 67.1%)

Price range: £39 - £40

Price levels: 2 different prices over 73 days

Description

Two prisoners are told that they will be brought to a room and seated so that each can see the other. Hats will be placed on their heads; each hat is either red or green. The two prisoners must simultaneously submit a guess of their own hat color, and they both go free if at least one of them guesses correctly. While no communication is allowed once the hats have been placed, they will, however, be allowed to have a strategy session before being brought to the room. Is there a strategy ensuring their release? The answer turns out to be yes, and this is the simplest non-trivial example of a “hat problem.” This book deals with the question of how successfully one can predict the value of an arbitrary function at one or more points of its domain based on some knowledge of its values at other points. Topics range from hat problems that are accessible to everyone willing to think hard, to some advanced topics in set theory and infinitary combinatorics. For example, there is a method of predicting the value f(a) of a function f mapping the reals to the reals, based only on knowledge of f's values on the open interval (a – 1, a), and for every such function the prediction is incorrect only on a countable set that is nowhere dense. The monograph progresses from topics requiring fewer prerequisites to those requiring more, with most of the text being accessible to any graduate student in mathematics. The broad range of readership includes researchers, postdocs, and graduate students in the fields of set theory, mathematical logic, and combinatorics. The hope is that this book will bring together mathematicians from different areas to think about set theory via a very broad array of coordinated inference problems.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3319376055
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 23 August 2016
Listed Since: 22 July 2016

Barcode

No barcode data available

Springer The Mathematics of Coordinated Inference: A Study of Generalized Hat Problems: 33 (Developments in Mathematics, 33)

About as cheap as it gets. The only time it was cheaper was 3 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Knowledge Representation Techniques: A Rough Set Approach: 202 (Studies in Fuzziness and Soft Computing, 202)

Ultrafilters Across Mathematics (Contemporary Mathematics): International Congress Ultramath 2008: Applications of Ultrafilters and Ultraproducts in Mathematics, June 1-7, 2008, Pisa, Italy

Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science)

Inhibitory Rules in Data Analysis: A Rough Set Approach: 163 (Studies in Computational Intelligence, 163)

Mathematics via Problems: Part 3: Combinatorics: 29 (MSRI Mathematical Circles Library)

Combinatorial Set Theory: With a Gentle Introduction to Forcing (Springer Monographs in Mathematics)

Incomplete Information: Rough Set Analysis: 13 (Studies in Fuzziness and Soft Computing, 13)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Finite and Infinite Combinatorics in Sets and Logic: 411 (Nato Science Series C:, 411)

The Practice of Mathematics: An Introduction to Proof Techniques and Number Systems

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Rough Set and Knowledge Technology: 5th International Conference, RSKT 2010, Beijing, China, October 15-17, 2010, Proceedings: 6401 (Lecture Notes in Computer Science, 6401)

Reflections on the Foundations of Mathematics: Univalent Foundations, Set Theory and General Thoughts: 407 (Synthese Library, 407)

Springer - Reflections on the Foundations of Mathematics 407

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

The Forcing Method in Set Theory: An Introduction via Boolean Valued Logic: 168 (UNITEXT, 168)

Philosophical Logic: Current Trends in Asia: Proceedings of AWPL-TPLC 2016 (Logic in Asia: Studia Logica Library)

A Bridge to Higher Mathematics: 43 (Textbooks in Mathematics)

Foundations of Mathematics (Contemporary Mathematics): Logic at Harvard Essays in Honor of W. Hugh Woodin's 60th Birthday March 27-29, 2015 Harvard University, Cambridge, MA

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

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

Special Topics in Mathematics for Computer Scientists: Sets, Categories, Topologies and Measures

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

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