Book contents
- Frontmatter
- Contents
- Introduction
- Speakers and Titles
- Thread algebra and risk assessment services
- Covering definable manifolds by open definable subsets
- Isomorphisms and definable relations on computable models
- Independence for types in algebraically closed valued fields
- Simple groups of finite Morley rank
- Towards a logic of type-free modality and truth
- Structural analysis of Aronszajn trees
- Proof analysis in non-classical logics
- Paul Bernays' later philosophy of mathematics
- Proofnets for S5: Sequents and circuits for modal logic
- Recursion on the partial continuous functionals
- A transactional approach to the logic of truth
- On some problems in computable topology
- Monotone inductive definitions and consistency of New Foundations
- LECTURE NOTES IN LOGIC
Structural analysis of Aronszajn trees
Published online by Cambridge University Press: 18 December 2009
Book contents
- Frontmatter
- Contents
- Introduction
- Speakers and Titles
- Thread algebra and risk assessment services
- Covering definable manifolds by open definable subsets
- Isomorphisms and definable relations on computable models
- Independence for types in algebraically closed valued fields
- Simple groups of finite Morley rank
- Towards a logic of type-free modality and truth
- Structural analysis of Aronszajn trees
- Proof analysis in non-classical logics
- Paul Bernays' later philosophy of mathematics
- Proofnets for S5: Sequents and circuits for modal logic
- Recursion on the partial continuous functionals
- A transactional approach to the logic of truth
- On some problems in computable topology
- Monotone inductive definitions and consistency of New Foundations
- LECTURE NOTES IN LOGIC
Summary
Abstract. In this paper I will survey some recent developments in the combinatorics of Aronszajn trees. I will cover work on coherent and Lipschitz trees, the basis problem for uncountable linear orderings, subtree bases for Aronszajn trees, and the existence of minimal Aronszajn types.
- Type
- Chapter
- Information
- Logic Colloquium 2005 , pp. 85 - 106Publisher: Cambridge University PressPrint publication year: 2007