Non-standard models of arithmetic are of interest to mathematicians through the presence of infinite integers and the various properties they inherit from the finite integers. Since their introduction in the 1930s, they have come to play an important role in model theory, and in combinatorics through independence results such as the Paris-Harrington theorem. This book is an introduction to these developments, and stresses the interplay between the first-order theory, recursion-theoretic aspects, and the structural properties of these models. Prerequisites for an understanding of the text have been kept to a minimum, these being a basic grounding in elementary model theory and a familiarity with the notions of recursive, primitive recursive, and r.e. sets. Consequently, the book is suitable for postgraduate students coming to the subject for the first time, and a number of exercises of varying degrees of difficulty will help to further the reader's understanding.

Aimed at graduate students, research logicians and mathematicians, this much-awaited text covers over 40 years of work on relative classification theory for nonstandard models of arithmetic. The book covers basic isomorphism invariants: families of type realized in a model, lattices of elementary substructures and automorphism groups.

This is the proceedings of the AMS special session on nonstandard models of arithmetic and set theory held at the Joint Mathematics Meetings in Baltimore (MD). The volume opens with an essay from Haim Gaifman that probes the concept of non-standardness in mathematics and provides a fascinating mix of historical and philosophical insights into the nature of nonstandard mathematical structures. In particular, Gaifman compares and contrasts the discovery of nonstandard models with other key mathematical innovations, such as the introduction of various number systems, the modern concept of function, and non-Euclidean geometries. Other articles in the book present results related to nonstandard models in arithmetic and set theory, including a survey of known results on the Turing upper bounds of arithmetic sets and functions. The volume is suitable for graduate students and research mathematicians interested in logic, especially model theory.

The 1970s saw the appearance and development in categoricity theory of a tendency to focus on the study and description of uncountably categorical theories in various special classes defined by natural algebraic or syntactic conditions. There have thus been studies of uncountably categorical theories of groups and rings, theories of a one-place function, universal theories of semigroups, quasivarieties categorical in infinite powers, and Horn theories. In Uncountably Categorical Theories , this research area is referred to as the special classification theory of categoricity. Zilber's goal is to develop a structural theory of categoricity, using methods and results of the special classification theory, and to construct on this basis a foundation for a general classification theory of categoricity, that is, a theory aimed at describing large classes of uncountably categorical structures not restricted by any syntactic or algebraic conditions.

This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed. Originally published in 1986. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Aimed at graduate students and research logicians and mathematicians, this much-awaited text covers over forty years of work on relative classification theory for non-standard models of arithmetic. With graded exercises at the end of each chapter, the book covers basic isomorphism invariants: families of types realized in a model, lattices of elementary substructures and automorphism groups. Many results involve applications of the powerful technique of minimal types due to Haim Gaifman, and some of the results are classical but have never been published in a book form before.

Model theory, which is concerned with the relationship between mathematical structures and logic, now has a wide range of applications in areas such as computing, philosophy, and linguistics. This book, suitable for both mathematicians and students from outside the field, provides a clear and readable introduction to the subject.