Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
Denis R. Hirschfeldt · Karen Lange · Richard A. Shore
Sep 2017 · American Mathematical Soc.
Ebook
101
Pages
reportRatings and reviews aren’t verified Learn More
About this ebook
Goncharov and Peretyat'kin independently gave necessary and sufficient conditions for when a set of types of a complete theory is the type spectrum of some homogeneous model of . 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.
About the author
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
Rate this ebook
Tell us what you think.
Reading information
Smartphones and tablets
Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.
Laptops and computers
You can listen to audiobooks purchased on Google Play using your computer's web browser.
eReaders and other devices
To read on e-ink devices like Kobo eReaders, you'll need to download a file and transfer it to your device. Follow the detailed Help Center instructions to transfer the files to supported eReaders.
