Book contents
- Frontmatter
- Contents
- Introduction
- Definability and elementary equivalence in the Ershov difference hierarchy
- A unified approach to algebraic set theory
- Brief introduction to unprovability
- Higher-order abstract syntax in type theory
- An introduction to b-minimality
- The sixth lecture on algorithmic randomness
- The inevitability of logical strength: Strict reverse mathematics
- Applications of logic in algebra: Examples from clone theory
- On finite imaginaries
- Strong minimal covers and a question of Yates: The story so far
- Embeddings into the Turing degrees
- Randomness—beyond Lebesgue measure
- The derived model theorem
- Forcing axioms and cardinal arithmetic
- Hrushovski's amalgamation construction
Embeddings into the Turing degrees
Published online by Cambridge University Press: 28 January 2010
Book contents
- Frontmatter
- Contents
- Introduction
- Definability and elementary equivalence in the Ershov difference hierarchy
- A unified approach to algebraic set theory
- Brief introduction to unprovability
- Higher-order abstract syntax in type theory
- An introduction to b-minimality
- The sixth lecture on algorithmic randomness
- The inevitability of logical strength: Strict reverse mathematics
- Applications of logic in algebra: Examples from clone theory
- On finite imaginaries
- Strong minimal covers and a question of Yates: The story so far
- Embeddings into the Turing degrees
- Randomness—beyond Lebesgue measure
- The derived model theorem
- Forcing axioms and cardinal arithmetic
- Hrushovski's amalgamation construction
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium 2006 , pp. 229 - 246Publisher: Cambridge University PressPrint publication year: 2009
- 1
- Cited by