Milliken's Tree Theorem and Its Applications: a Computability-Theoretic Perspective

Idioma: inglés

Editorial: American Mathematical Society, US, 2024

1470467313 / 9781470467319

  • Tapa blanda
  • Nuevo
Ver todos los detalles

Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK

Vendedor de 5 estrellas

Vendedor de AbeBooks desde 11 de junio de 2025

Ver los artículos de este vendedor
Tapa blanda

Condición: Nuevo

EUR 81,13

Envío por EUR 75,65 
Se envía de Reino Unido a Estados Unidos de America

Cantidad disponible: 2 disponibles

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and consequences. In this sense, Milliken's tree theorem is paradigmatic of structural Ramsey theory, which seeks to identify the common combinatorial and logical features of partition results in general. Its investigation in this area has consequently been extensive.Motivated by a question of Dobrinen, we initiate the study of Milliken's tree theorem from the point of view of computability theory. The goal is to understand how close it is to being algorithmically solvable, and how computationally complex are the constructions needed to prove it. This kind of examination enjoys a long and rich history, and continues to be a highly active endeavor. Applied to combinatorial principles, particularly Ramsey's theorem, it constitutes one of the most fruitful research programs in computability theory as a whole. The challenge to studying Milliken's tree theorem using this framework is its unusually intricate proof, and more specifically, the proof of the Halpern-La¨uchli theorem, which is a key ingredient.Our advance here stems from a careful analysis of the Halpern-Läuchli theorem which shows that it can be carried out effectively (i.e., that it is computably true). We use this as the basis of a new inductive proof of Milliken's tree theorem that permits us to gauge its effectivity in turn. The key combinatorial tool we develop for the inductive step is a fast-growing computable function that can be used to obtain a finitary, or localized, version of Milliken's tree theorem. This enables us to build solutions to the full Milliken's tree theorem using effective forcing. The principal result of this is a full classification of the computable content of Milliken's tree theorem in terms of the jump hierarchy, stratified by the size of instance. As usual, this also translates into the parlance of reverse mathematics, yielding a complete understanding of the fragment of second-order arithmetic required to prove Milliken's tree theorem.We apply our analysis also to several well-known applications of Milliken's tree theorem, namely Devlin's theorem, a partition theorem for Rado graphs, and a generalized version of the so-called tree theorem of Chubb, Hirst, and McNicholl. These are all certain kinds of extensions of Ramsey's theorem for different structures, namely the rational numbers, the Rado graph, and perfect binary trees, respectively. We obtain a number of new results about how these principles relate to Milliken's tree theorem and to each other, in terms of both their computability-theoretic and combinatorial aspects. In particular, we establish new structural Ramsey-theoretic properties of the Rado graph theorem and the generalized Chubb-Hirst-McNicholl tree theorem using Zucker's notion of big Ramsey structure.

N° de ref. del artículo LU-9781470467319

Título
Milliken's Tree Theorem and Its Applications: a Computability-Theoretic Perspective
Autor
Paul-Elliot Angles D'Auriac, Peter A. Cholak, Damir D. Dzhafarov, Benoit Monin, Ludovic Patey
Editorial
American Mathematical Society, US
Año de publicación
2024
Estado
New
Encuadernación
Paperback
Idioma
inglés
ISBN 10
1470467313
ISBN 13
9781470467319
Peso del artículo
272 gramos

Rarewaves.com UK

London, Reino Unido

Vendedor de 5 estrellas

Vendedor de AbeBooks desde 11 de junio de 2025

Tarifas de envío de Reino Unido a Estados Unidos de America

ArtículoDe 60 a 60 días hábilesDe 60 a 60 días hábiles
Primer artículoEUR 75,65EUR 116,38
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Información empresarial del vendedor

RAREWAVES.COM LIMITED

Elsley Court, 20-22 Great Titchfield Street
London, Reino Unido W1W 8BE