Related papers: Solovay-type characterizations for forcing-algebra…

We consider the modality "$\varphi$ is true in every $\sigma$-centered forcing extension", denoted $\square\varphi$, and its dual "$\varphi$ is true in some $\sigma$-centered forcing extension", denoted $\lozenge\varphi$ (where $\varphi$ is…

Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees…

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

In this article we present a technique for selecting models of set theory that are complete in a model-theoretic sense. Specifically, we will apply Robinson infinite forcing to the collections of models of ZFC obtained by Cohen forcing.…

In a complete metric space equipped with a doubling measure and supporting a $(1,1)$-Poincar\'e inequality, we show that every set satisfying a suitable capacitary density condition is removable for Newton-Sobolev functions.

Using a countable support product of creature forcing posets, we show that consistently, for uncountably many different functions the associated Yorioka ideals' uniformity numbers can be pairwise different. In addition we show that, in the…

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

These are lecture notes from a course I gave at the University of Wisconsin during the Spring semester of 1993. Part 1 is concerned with Borel hierarchies. Section 13 contains an unpublished theorem of Fremlin concerning Borel hierarchies…

ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…

Let $M$ be a type I von Neumann algebra with the center $Z,$ and let $LS(M)$ be the algebra of all locally measurable operators affiliated with $M.$ We prove that every $Z$-linear derivation on $LS(M)$ is inner. In particular all $Z$-linear…

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from…

Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…

We show that (in ZFC) every infinite set S can be equipped with 2^|S| complete metrics which generate mutually non-homeomorphic scattered order topologies on S. Furthermore, we show that (in ZFC) every uncountable set S can be equipped with…

There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…

We present a novel, type-logical analysis of_polarity sensitivity_: how negative polarity items (like "any" and "ever") or positive ones (like "some") are licensed or prohibited. It takes not just scopal relations but also linear order into…

We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Synthetic experiments…

We answer a question of Moore by building a forcing extension satisfying measuring together with CH. The construction works over any model of ZFC and can be described as a forcing iteration with countable structures as side conditions and…

We adapt the classical notion of building models by games to the setting of continuous model theory. As an application, we study to what extent canonical operator algebras are enforceable models. For example, we show that the hyperfinite…