Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
Author | : Denis R. Hirschfeldt |
Publisher | : American Mathematical Soc. |
Total Pages | : 114 |
Release | : 2017-09-25 |
ISBN-10 | : 9781470426576 |
ISBN-13 | : 1470426579 |
Rating | : 4/5 (76 Downloads) |
Download or read book Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem written by Denis R. Hirschfeldt and published by American Mathematical Soc.. This book was released on 2017-09-25 with total page 114 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.