We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be in manifest conflict with each (...) other. However, our conclusion is that it is very difficult to see any real difference between the two. We analyze a phenomenon we call internal categoricity which extends the familiar categoricity results of second order logic to Henkin models and show that set theory enjoys the same kind of internal categoricity. Thus the existence of non-standard models, which is usually taken as a property of first order set theory, and categoricity, which is usually taken as a property of second order axiomatizations, can coherently coexist when put into their proper context. We also take a fresh look at complete second order axiomatizations and give a hierarchy result for second order characterizable structures. Finally we consider the problem of existence in mathematics from both points of view and find that second order logic depends on what we call large domain assumptions, which come quite close to the meaning of the axioms of set theory. (shrink)

It’s often said that set theory provides a foundation for classical mathematics because every classical mathematical object can be modeled as a set and every classical mathematical theorem can be proved from the axioms of set theory. This is obviously a remarkable mathematical fact, but it isn’t obvious what makes it ‘foundational’. This paper begins with a taxonomy of the jobs set theory does that might reasonably be regarded as foundational. It then moves on to category-theoretic and univalent foundations, exploring (...) to what extent they do these same jobs, and to what extent they might do other jobs also reasonably regarded as foundational. (shrink)

The type of completeness Whitehead and Russell aimed for in their Principia Mathematica was what I call descriptive completeness. This is completeness with respect to the propositions that have been proved in traditional mathematics. The notion of completeness addressed by Gödel in his famous work of 1930 and 1931 was completeness with respect to the truths expressible in a given language. What are the relative significances of these different conceptions of completeness for traditional mathematics? What, if any, effects does incompleteness (...) of the type Gödel had in mind have for the evaluation of the Principia Mathematica project and other projects like it? (shrink)

We show that the analysis of Keisler’s order can be localized to the study of φ-types. Specifically, if is a regular ultrafilter on λ such that and M is a model whose theory is countable, then is λ+-saturated iff it realizes all φ-types of size λ.

This text features nearly 200 entries which introduce basic mathematical tools and vocabulary, trace the development of modern mathematics, define essential ...

§1. Introduction. With Hrushovski's proof of the function field Mordell-Lang conjecture [16] the relevance of geometric stability theory to diophantine geometry first came to light. A gulf between logicians and number theorists allowed for contradictory reactions. It has been asserted that Hrushovski's proof was simply an algebraic argument masked in the language of model theory. Another camp held that this theorem was merely a clever one-off. Still others regarded the argument as magical and asked whether such sorcery could unlock the (...) secrets of a wide coterie of number theoretic problems.In the intervening years each of these prejudices has been revealed as false though such attitudes are still common. The methods pioneered in [16] have been extended and applied to a number of other problems. At their best, these methods have been integrated into the general methods for solving diophantine problems. Moreover, the newer work suggests limits to the application of model theory to diophantine geometry. For example, all such known applications are connected with commutative algebraic groups. This need not be an intrinsic restriction, but its removal requires serious advances in the model theory of fields. (shrink)

On the basis of a wide range of historical examples various features of axioms are discussed in relation to their use in mathematical practice. A very general framework for this discussion is provided, and it is argued that axioms can play many roles in mathematics and that viewing them as self-evident truths does not do justice to the ways in which mathematicians employ axioms. Possible origins of axioms and criteria for choosing axioms are also examined. The distinctions introduced aim at (...) clarifying discussions in philosophy of mathematics and contributing towards a more refined view of mathematical practice. (shrink)

We survey the use of club guessing and other PCF constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal, element.

We prove independence results concerning the number of nonisomorphic models (using the S-chain condition and S-properness) and the consistency of "ZCF + 2 ℵ 0 = ℵ 2 + there is a universal linear order of power ℵ 1 ". Most of these results were announced in [Sh 4], [Sh 5]. In subsequent papers we shall prove an analog f MA for forcing which does not destroy stationary subsets of ω 1 , investigate D-properness for various filters and prove the (...) consistency with G.C.H. of an axiom implying SH (for ℵ 1 ), and connected results. (shrink)

Our theme is that not every interesting question in set theory is independent of ZFC. We give an example of a first order theory T with countable D(T) which cannot have a universal model at ℵ1 without CH; we prove in ZFC a covering theorem from the hypothesis of the existence of a universal model for some theory; and we prove--again in ZFC--that for a large class of cardinals there is no universal linear order (e.g. in every regular $\aleph_1 < (...) \lambda < 2^{\aleph_0}$). In fact, what we show is that if there is a universal linear order at a regular λ and its existence is not a result of a trivial cardinal arithmetical reason, then λ "resembles" ℵ1--a cardinal for which the consistency of having a universal order is known. As for singular cardinals, we show that for many singular cardinals, if they are not strong limits then they have no universal linear order. As a result of the nonexistence of a universal linear order, we show the nonexistence of universal models for all theories possessing the strict order property (for example, ordered fields and groups, Boolean algebras, p-adic rings and fields, partial orders, models of PA and so on). (shrink)

I will give a brief overview of Saharon Shelah’s work in mathematical logic. I will focus on three transformative contributions Shelah has made: stability theory, proper forcing and PCF theory. The first is in model theory and the other two are in set theory.

We present a new proof of the existence of Morley sequences in simple theories. We avoid using the Erdős–Rado theorem and instead use only Ramsey’s theorem and compactness. The proof shows that the basic theory of forking in simple theories can be developed using only principles from “ordinary mathematics,” answering a question of Grossberg, Iovino, and Lessmann, as well as a question of Baldwin.

We discuss dividing lines (in model theory) and some test questions, mainly the universality spectrum. So there is much on conjectures, problems and old results, mainly of the author and also on some recent results.

We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the literature are (...) indeed [Formula: see text]. (shrink)

We make explicit certain results around the Galois correspondence in the context of definable automorphism groups, and point out the relation to some recent papers dealing with the Galois theory of algebraic differential equations when the constants are not “closed” in suitable senses. We also improve the definitions and results on generalized strongly normal extensions from [Pillay, “Differential Galois theory I”, Illinois Journal of Mathematics, 42, 1998], using this to give a restatement of a conjecture on almost semiabelian δ-groups from (...) [Bertrand and Pillay, “Galois theory, functional Lindemann–Weierstrass, and Manin maps”, Pacific Journal of Mathematics, 281, 2016]. (shrink)

We show that certain classes of modules have universal models with respect to pure embeddings: Let R be a ring, T a first‐order theory with an infinite model extending the theory of R‐modules and (where ⩽pp stands for “pure submodule”). Assume has the joint embedding and amalgamation properties. If or, then has a universal model of cardinality λ. As a special case, we get a recent result of Shelah [28, 1.2] concerning the existence of universal reduced torsion‐free abelian groups with (...) respect to pure embeddings.We begin the study of limit models for classes of R‐modules with joint embedding and amalgamation. We show that limit models with chains of long cofinality are pure‐injective and we characterize limit models with chains of countable cofinality. This can be used to answer [18, Question 4.25].As this paper is aimed at model theorists and algebraists an effort was made to provide the background for both. (shrink)

Kojman, M. and S. Shelah, The universality spectrum of stable unsuperstable theories, Annals of Pure and Applied Logic 58 57–72. It is shown that if T is stable unsuperstable, and 1 [brvbar]T[brvbar], T stable and κ<κ then there is a universal tree of height κ + 1 in cardinality λ.

In this paper we continue our study, begun in [5], of the connection between ultraproducts and saturated structures. IfDis an ultrafilter over a setI, andis a structure, the ultrapower ofmoduloDis denoted byD-prod. The ultrapower is important because it is a method of constructing structures which are elementarily equivalent to a given structure. Our ultimate aim is to find out what kinds of structure are ultrapowers of. We made a beginning in [5] by proving that, assuming the generalized continuum hypothesis, for (...) each cardinalαthere is an ultrafilterDover a set of powerαsuch that for all structures,D-prodisα+-saturated. (shrink)

We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we prove a form of “singular cardinal compactness” for Jensen's square principle. We then study the relationship between internally approachable and tight structures, which parallels to a certain extent the relationship between good and approachable points. In particular we characterise the tight structures in terms of PCF theory and use our characterisation to prove (...) some covering results for tight structures, along with some results on tightness and stationary reflection. Finally, we prove some absoluteness theorems in PCF theory, deduce a covering theorem, and apply that theorem to the study of precipitous ideals. (shrink)

About 25 years ago, it came to light that a single combinatorial property determines both an important dividing line in model theory and machine learning. The following years saw a fruitful exchange of ideas between PAC-learning and the model theory of NIP structures. In this article, we point out a new and similar connection between model theory and machine learning, this time developing a correspondence between stability and learnability in various settings of online learning. In particular, this gives many new (...) examples of mathematically interesting classes which are learnable in the online setting. (shrink)

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.

Major shifts in the field of model theory in the twentieth century have seen the development of new tools, methods, and motivations for mathematicians and philosophers. In this book, John T. Baldwin places the revolution in its historical context from the ancient Greeks to the last century, argues for local rather than global foundations for mathematics, and provides philosophical viewpoints on the importance of modern model theory for both understanding and undertaking mathematical practice. The volume also addresses the impact of (...) model theory on contemporary algebraic geometry, number theory, combinatorics, and differential equations. This comprehensive and detailed book will interest logicians and mathematicians as well as those working on the history and philosophy of mathematics. (shrink)