✦ LIBER ✦

Specialising Aronszajn trees by countable approximations

✍ Scribed by Heike Mildenberger; Saharon Shelah

Book ID: 105842061
Publisher: Springer
Year: 2003
Tongue: English
Weight: 248 KB
Volume: 42
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-002-0168-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Specialising Aronszajn trees by countabl

Specialising Aronszajn trees by countable approximations

✍ Heike Mildenberger; Saharon Shelah 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 248 KB

Approximating Countable Markov Chains.by

Approximating Countable Markov Chains.by David Freedman

✍ Review by: A. O. Pittenger 📂 Article 📅 1974 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 377 KB

Approximating Countable Markov Chains.by

Approximating Countable Markov Chains.by David Freedman

✍ Review by: David Kendall 📂 Article 📅 1973 🏛 Blackwell Publishing ⚖ 429 KB

Approximation of analytic by Borel sets

Approximation of analytic by Borel sets and definable countable chain conditions

✍ A. S. Kechris; S. Solecki 📂 Article 📅 1995 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 623 KB

Lexicographic preferences representable

Lexicographic preferences representable by real-branching trees with countable height: A dichotomy result

✍ Giarlotta, Alfio; Watson, Stephen 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 227 KB

On approximating planar metrics by tree

On approximating planar metrics by tree metrics

✍ Goran Konjevod; R. Ravi; F.Sibel Salman 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 92 KB

We combine the results of Bartal [Proc. 37th FOCS, 1996, pp. 184-193] on probabilistic approximation of metric spaces by tree metrics, with those of Klein, Plotkin and Rao [Proc. 25th STOC, 1993, pp. 682-690] on decompositions of graphs without small K s,s minors (such as planar graphs) to show that