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.

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.

This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has seen a particular surge of activity in the last few years. It provides an overview of some fundamental ideas and techniques, and enough context to make it possible for students with at least a basic knowledge of computability theory and proof theory to appreciate the exciting advances currently happening in the area, and perhaps make contributions of their own. It adopts a case-study approach, using the study of versions of Ramsey's Theorem (for colorings of tuples of natural numbers) and related principles as illustrations of various aspects of computability theoretic and reverse mathematical analysis. This book contains many exercises and open questions.

Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability theory, the subject offers beautiful results as well as significant foundational insights. This text provides a modern treatment of reverse mathematics that combines computability theoretic reductions and proofs in formal arithmetic to measure the complexity of theorems and problems from all areas of mathematics. It includes detailed introductions to techniques from computable mathematics, Weihrauch style analysis, and other parts of computability that have become integral to research in the field. Topics and features: Provides a complete introduction to reverse mathematics, including necessary background from computability theory, second order arithmetic, forcing, induction, and model construction Offers a comprehensive treatment of the reverse mathematics of combinatorics, including Ramsey's theorem, Hindman's theorem, and many other results Provides central results and methods from the past two decades, appearing in book form for the first time and including preservation techniques and applications of probabilistic arguments Includes a large number of exercises of varying levels of difficulty, supplementing each chapter The text will be accessible to students with a standard first year course in mathematical logic. It will also be a useful reference for researchers in reverse mathematics, computability theory, proof theory, and related areas. Damir D. Dzhafarov is an Associate Professor of Mathematics at the University of Connecticut, CT, USA. Carl Mummert is a Professor of Computer and Information Technology at Marshall University, WV, USA.

The author discusses in which sense general metric measure spaces possess a first order differential structure. Building on this, spaces with Ricci curvature bounded from below a second order calculus can be developed, permitting the author to define Hessian, covariant/exterior derivatives and Ricci curvature.

Let X be an abstract not necessarily compact orientable CR manifold of dimension 2n−1, n⩾2, and let Lk be the k-th tensor power of a CR complex line bundle L over X. Given q∈{0,1,…,n−1}, let □(q)b,k be the Gaffney extension of Kohn Laplacian for (0,q) forms with values in Lk. For λ≥0, let Π(q)k,≤λ:=E((−∞,λ]), where E denotes the spectral measure of □(q)b,k. In this work, the author proves that Π(q)k,≤k−N0F∗k, FkΠ(q)k,≤k−N0F∗k, N0≥1, admit asymptotic expansions with respect to k on the non-degenerate part of the characteristic manifold of □(q)b,k, where Fk is some kind of microlocal cut-off function. Moreover, we show that FkΠ(q)k,≤0F∗k admits a full asymptotic expansion with respect to k if □(q)b,k has small spectral gap property with respect to Fk and Π(q)k,≤0 is k-negligible away the diagonal with respect to Fk. By using these asymptotics, the authors establish almost Kodaira embedding theorems on CR manifolds and Kodaira embedding theorems on CR manifolds with transversal CR S1 action.

The study of finite subgroups of a simple algebraic group $G$ reduces in a sense to those which are almost simple. If an almost simple subgroup of $G$ has a socle which is not isomorphic to a group of Lie type in the underlying characteristic of $G$, then the subgroup is called non-generic. This paper considers non-generic subgroups of simple algebraic groups of exceptional type in arbitrary characteristic.