Jouko Väänänen

This Element addresses the viability of categoricity arguments in philosophy by focusing with some care on the specific conclusions that a sampling of prominent figures have attempted to draw – the same theorem might successfully support one such conclusion while failing to support another. It begins with Dedekind, Zermelo, and Kreisel, casting doubt on received readings of the latter two and highlighting the success of all three in achieving what are argued to be their actual goals. These earlier uses of categoricity arguments are then compared and contrasted with more recent work of Parsons and the co-authors Button and Walsh. Highlighting the roles of first- and second-order theorems, of external and internal theorems, the Element concludes that categoricity arguments have been more effective in historical cases that reflect philosophically on internal mathematical matters than in recent questions of pre-theoretic metaphysics.

This Element addresses the viability of categoricity arguments in philosophy by focusing with some care on the specific conclusions that a sampling of prominent figures have attempted to draw – the same theorem might successfully support one such conclusion while failing to support another. It begins with Dedekind, Zermelo, and Kreisel, casting doubt on received readings of the latter two and highlighting the success of all three in achieving what are argued to be their actual goals. These earlier uses of categoricity arguments are then compared and contrasted with more recent work of Parsons and the co-authors Button and Walsh. Highlighting the roles of first- and second-order theorems, of external and internal theorems, the Element concludes that categoricity arguments have been more effective in historical cases that reflect philosophically on internal mathematical matters than in recent questions of pre-theoretic metaphysics.

This gentle introduction to logic and model theory is based on a systematic use of three important games in logic: the semantic game; the Ehrenfeucht–Fraïssé game; and the model existence game. The third game has not been isolated in the literature before but it underlies the concepts of Beth tableaux and consistency properties. Jouko Väänänen shows that these games are closely related and in turn govern the three interrelated concepts of logic: truth, elementary equivalence and proof. All three methods are developed not only for first order logic but also for infinitary logic and generalized quantifiers. Along the way, the author also proves completeness theorems for many logics, including the cofinality quantifier logic of Shelah, a fully compact extension of first order logic. With over 500 exercises this book is ideal for graduate courses, covering the basic material as well as more advanced applications.

Dependence is a common phenomenon, wherever one looks: ecological systems, astronomy, human history, stock markets - but what is the logic of dependence? This book is the first to carry out a systematic logical study of this important concept, giving on the way a precise mathematical treatment of Hintikka's independence friendly logic. Dependence logic adds the concept of dependence to first order logic. Here the syntax and semantics of dependence logic are studied, dependence logic is given an alternative game theoretic semantics, and results about its complexity are proven. This is a graduate textbook suitable for a special course in logic in mathematics, philosophy and computer science departments, and contains over 200 exercises, many of which have a full solution at the end of the book. It is also accessible to readers, with a basic knowledge of logic, interested in new phenomena in logic.

Dependence is a common phenomenon, wherever one looks: ecological systems, astronomy, human history, stock markets - but what is the logic of dependence? This book is the first to carry out a systematic logical study of this important concept, giving on the way a precise mathematical treatment of Hintikka's independence friendly logic. Dependence logic adds the concept of dependence to first order logic. Here the syntax and semantics of dependence logic are studied, dependence logic is given an alternative game theoretic semantics, and results about its complexity are proven. This is a graduate textbook suitable for a special course in logic in mathematics, philosophy and computer science departments, and contains over 200 exercises, many of which have a full solution at the end of the book. It is also accessible to readers, with a basic knowledge of logic, interested in new phenomena in logic.