This paper investigates the quantifier "there exist unboundedly many" in the context of first-order arithmetic. An alternative axiomatization is found for Peano arithmetic based on an axiom schema of regularity: The union of boundedly many bounded sets is bounded. We also obtain combinatorial equivalents of certain second-order theories associated with cuts in nonstandard models of arithmetic.

A class K of structures is controlled if for all cardinals λ, the relation of L∞,λ-equivalence partitions K into a set of equivalence classes . We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled 69–88).

We present Saharon Shelah's Stability Spectrum and Homogeneity Spectrum theorems, as well as the equivalence between the order property and instability in the framework of Finite Diagrams. Finite Diagrams is a context which generalizes the first order case. Localized versions of these theorems are presented. Our presentation is based on several papers; the point of view is contemporary and some of the proofs are new. The treatment of local stability in Finite Diagrams is new.

This paper investigates a connection between the semantic notion provided by the ordering * among theories in model theory and the syntactic SOPn hierarchy of Shelah. It introduces two properties which are natural extensions of this hierarchy, called SOP2 and SOP1. It is shown here that SOP3 implies SOP2 implies SOP1. In Shelah's article 229) it was shown that SOP3 implies *-maximality and we prove here that *-maximality in a model of GCH implies a property called SOP2″. It has been (...) subsequently shown by Shelah and Usvyatsov that SOP2″ and SOP2 are equivalent, so obtaining an implication between *-maximality and SOP2. It is not known if SOP2 and SOP3 are equivalent. Together with the known results about the connection between the SOPn hierarchy and the existence of universal models in the absence of GCH, the paper provides a step toward the classification of unstable theories without the strict order property. (shrink)

Let $\mathbf{I}(\mu,K)$ denote the number of nonisomorphic models of power $\mu$ and $\mathbf{IE}(\mu,K)$ the number of nonmutually embeddable models. We define in this paper the notion of a diverse class and use it to prove a number of results. The major result is Theorem B: For any diverse class $K$ and $\mu$ greater than the cardinality of the language of $K$, $\mathbf{IE}(\mu,K) \geq \min(2^\mu,\beth_2).$ From it we deduce both an old result of Shelah, Theorem C: If $T$ is countable and (...) $\lambda_0 > \aleph_0$ then for every $\mu > \aleph_0,\mathbf{IE}(\mu,T) \geq \min(2^\mu,\beth_2)$, and an extension of that result to uncountable languages, Theorem D: If $|T| < 2^\omega,\lambda_0 > |T|$, and $|D(T)| = |T|$ then for $\mu > |T|$, $\mathbf{IE}(\mu,T) \geq \min(2^\mu,\beth_2).$. (shrink)

CHAPTER 1 Combinatorial Geometries and Infinitary Logics In this chapter we introduce two of the key concepts that are used throughout the text. ...

Provability, Computability and Reflection.