Induction, bounding, weak combinatorial principles, and the homogeneous model theorem

Induction, bounding, weak combinatorial principles, and the homogeneous model theorem / Denis R. Hirschfeldt, Karen Lange, Richard A. Shore.

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 Theor...

Full description

Saved in:
Bibliographic Details
Main Authors: Hirschfeldt, Denis Roman (Author), Lange, Karen, 1980- (Author), Shore, Richard A., 1946- (Author)
Format: eBook
Language:English
Published: Providence, Rhode Island : American Mathematical Society, 2017.
Series:Memoirs of the American Mathematical Society ; no. 1187.
Subjects:
Reverse mathematics.
Computable functions.
Decidability (Mathematical logic)
MATHEMATICS > General.
Computable functions
Reverse mathematics
Online Access:Click for online access
Description
Summary: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 sh.
Item Description:"Volume 249, Number 1187 (eighth of 8 numbers), September 2017."
Physical Description:1 online resource (v, 101 pages)
Bibliography:Includes bibliographical references (pages 99-101).
ISBN:9781470441418
1470441411
ISSN:0065-9266 ;
Source of Description, Etc. Note:Print version record.

Similar Items