相关论文: The pair $(\aleph_n,\aleph_0)$ may fail $\aleph_0$…

We prove that for every singular cardinal mu of cofinality omega, the complete Boolean algebra compP_mu(mu) contains as a complete subalgebra an isomorphic copy of the collapse algebra Comp Col(omega_1,mu^{aleph_0}). Consequently, adding a…

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Let K be an Abstract Elementary Class. Under the asusmptions that K has a nicely behaved forking-like notion, regular types and existence of some prime models we establish a decomposition theorem for such classes. The decomposition implies…

A cardinal kappa is countably closed if mu^omega < kappa whenever mu < kappa. Assume that there is no inner model with a Woodin cardinal and that every set has a sharp. Let K be the core model. Assume that kappa is a countably closed…

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

Let $A(K)$ be the algebra of continuous functions on a compact set $K\subset\mathbb C$ which are analytic on the interior of $K$, and $R(K)$ the closure (with the uniform convergence on $K$) of the functions that are analytic on a…

We consider several variants of Keisler's isomorphism theorem. We separate these variants by showing implications between them and cardinal invariants hypotheses. We characterize saturation hypotheses that are stronger than Keisler's…

Assuming the consistency of ZFC with appropriate large cardinal axioms we produce a model of ZFC where $\aleph_\omega$ is a strong limit cardinal and the inner model $L(\mathcal{P}(\aleph_\omega))$ satisfies the following properties: (1)…

We give an example of an aleph-zero-categorical theory which is not G-compact. The countable model of this theory does not have AZ-enumerations.

We solve two long-standing open problems regarding the combinatorics of $\aleph_{\omega+1}$. We answer a question of Shelah by showing that it is consistent for any $n\geq 1$ that $\mathsf{GCH}$ holds and there is a stationary set of points…

We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness (a locality property for orbital types), and are stable (in terms of the number of orbital types) in some cardinal. Assuming…

Let K be an abstract elementary class satisfying the joint embedding and the amalgamation properties. Let m be a cardinal above the the L\"owenheim-Skolem number of the class. Suppose K satisfies the disjoint amalgamation property for limit…

We answer a question of Pakhomov by showing that there is a consistent, c.e. theory $T$ such that no theory which is definitionally equivalent to $T$ has a computable model. A key tool in our proof is the model-theoretic notion of mutual…

I study definable sets in affine continuous logic. Let $T$ be an affine theory. After giving some general results, it is proved that if $T$ has a first order model, its extremal theory is a complete first order theory and first order…

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

We define the property of Pi_2-compactness of a statement phi of set theory, meaning roughly that the hard core of the impact of phi on combinatorics of aleph_1 can be isolated in a canonical model for the statement phi. We show that the…

We show that if a field A is not pseudo-finite, then there is no prime model of the theory of pseudo-finite fields over A. Assuming GCH, we generalise this result to \kappa-prime models, for \kappa a regular uncountable cardinal or…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…

We construct an oracle relative to which $\mathrm{P} = \mathrm{NP} \cap \mathrm{coNP}$, but there are no many-one complete sets in $\mathrm{UP}$, no many-one complete disjoint $\mathrm{NP}$-pairs, and no many-one complete disjoint…