Descriptive set theory has been one of the main areas of research in set theory for almost a century. This text presents a largely balanced approach to the subject, which combines many elements of the different traditions. It includes a wide variety of examples, more than 400 exercises, and applications, in order to illustrate the general concepts and results of the theory.

Vols. for 1969- include a section of abstracts.

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,“thebranchof mathematical logic which deals with the relation between a formal language and its interpretations”. No wonder, then, that mathematical logic, and ?nite model theory in particular, should ?nd manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure. This volume gives a broadoverviewof some central themes of ?nite model theory: expressive power, descriptive complexity, and zero–one laws, together with selected applications to database theory and arti?cial intelligence, es- cially constraint databases and constraint satisfaction problems. The ?nal chapter provides a concise modern introduction to modal logic,which emp- sizes the continuity in spirit and technique with ?nite model theory.

A short introduction ideal for students learning category theory for the first time.

This volume provides a self-contained introduction to some topics in orbit equivalence theory, a branch of ergodic theory. The first two chapters focus on hyperfiniteness and amenability. Included here are proofs of Dye's theorem that probability measure-preserving, ergodic actions of the integers are orbit equivalent and of the theorem of Connes-Feldman-Weiss identifying amenability and hyperfiniteness for non-singular equivalence relations. The presentation here is often influenced by descriptive set theory, and Borel and generic analogs of various results are discussed. The final chapter is a detailed account of Gaboriau's recent results on the theory of costs for equivalence relations and groups and its applications to proving rigidity theorems for actions of free groups.

This book is an introduction to a functorial model theory based on infinitary language categories. The author introduces the properties and foundation of these categories before developing a model theory for functors starting with a countable fragment of an infinitary language. He also presents a new technique for generating generic models with categories by inventing infinite language categories and functorial model theory. In addition, the book covers string models, limit models, and functorial models.

Two conferences, Logic and Its Applications in Algebra and Geometry and Combinatorial Set Theory, Excellent Classes, and Schanuel Conjecture, were held at the University of Michigan (Ann Arbor). These events brought together model theorists and set theorists working in these areas. This volume is the result of those meetings. It is suitable for graduate students and researchers working in mathematical logic.