Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
 
Denis R. Hirschfeldt University of Chicago, Chicago, Illinois, USA
Karen Lange Wellesley College, Wellesley, Massachusetts, USA
Richard A. Shore Cornell University, Ithaca, New York, USA
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
eBook ISBN:  978-1-4704-4141-8
Product Code:  MEMO/249/1187.E
List Price: $75.00
MAA Member Price: $67.50
AMS Member Price: $45.00
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
Click above image for expanded view
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
Denis R. Hirschfeldt University of Chicago, Chicago, Illinois, USA
Karen Lange Wellesley College, Wellesley, Massachusetts, USA
Richard A. Shore Cornell University, Ithaca, New York, USA
eBook ISBN:  978-1-4704-4141-8
Product Code:  MEMO/249/1187.E
List Price: $75.00
MAA Member Price: $67.50
AMS Member Price: $45.00
  • Book Details
     
     
    Memoirs of the American Mathematical Society
    Volume: 2492017; 101 pp
    MSC: Primary 03

    Goncharov and Peretyat'kin independently gave necessary and sufficient conditions for when a set of types of a complete theory \(T\) is the type spectrum of some homogeneous model of \(T\). Their result can be stated as a principle of second order arithmetic, which is called the Homogeneous Model Theorem (HMT), and analyzed from the points of view of computability theory and reverse mathematics. Previous computability theoretic results by Lange suggested a close connection between HMT and the Atomic Model Theorem (AMT), which states that every complete atomic theory has an atomic model. The authors show that HMT and AMT are indeed equivalent in the sense of reverse mathematics, as well as in a strong computability theoretic sense and do the same for an analogous result of Peretyat'kin giving necessary and sufficient conditions for when a set of types is the type spectrum of some model.

  • Table of Contents
     
     
    • Chapters
    • 1. Introduction
    • 2. Definitions
    • 3. The Atomic Model Theorem and Related Principles
    • 4. Defining Homogeneity
    • 5. Closure Conditions and Model Existence
    • 6. Extension Functions and Model Existence
    • 7. The Reverse Mathematics of Model Existence Theorems
    • 8. Open Questions
    • A. Approximating Generics
    • B. Atomic Trees
    • C. Saturated Models
  • Additional Material
     
     
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 2492017; 101 pp
MSC: Primary 03

Goncharov and Peretyat'kin independently gave necessary and sufficient conditions for when a set of types of a complete theory \(T\) is the type spectrum of some homogeneous model of \(T\). Their result can be stated as a principle of second order arithmetic, which is called the Homogeneous Model Theorem (HMT), and analyzed from the points of view of computability theory and reverse mathematics. Previous computability theoretic results by Lange suggested a close connection between HMT and the Atomic Model Theorem (AMT), which states that every complete atomic theory has an atomic model. The authors show that HMT and AMT are indeed equivalent in the sense of reverse mathematics, as well as in a strong computability theoretic sense and do the same for an analogous result of Peretyat'kin giving necessary and sufficient conditions for when a set of types is the type spectrum of some model.

  • Chapters
  • 1. Introduction
  • 2. Definitions
  • 3. The Atomic Model Theorem and Related Principles
  • 4. Defining Homogeneity
  • 5. Closure Conditions and Model Existence
  • 6. Extension Functions and Model Existence
  • 7. The Reverse Mathematics of Model Existence Theorems
  • 8. Open Questions
  • A. Approximating Generics
  • B. Atomic Trees
  • C. Saturated Models
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.