Related papers: Universally measurable sets may all be Delta^1_2

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

We sow that there exists a generic extension of the G\"{o}del's constructible universe in which diamond holds and there exists a subset $Y \subseteq \omega_1$ such that for stationary many $\delta < \omega_1,$ the set $Y \cap \delta$ is not…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

We prove that if every real belongs to a set generic extension of the constructible universe then every \Sigma_1^1 equivalence E on reals either admits a Delta_1^HC reduction to the equality on the set 2^{<\om_1} of all countable binary…

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

Given a totally real number field $F$, we show that there are only finitely many totally real extensions of $K$ of a fixed degree that admit a universal quadratic form defined over $F$. We further obtain several explicit classification…

A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…

The purpose of this paper is to present a universal approach to the study of controllability/observability problems for infinite dimensional systems governed by some stochastic/deterministic partial differential equations. The crucial…

We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…

We show that the essentially algebraic theory of generalized algebraic theories, regarded as a category with finite limits, has a universal exponentiable arrow in the sense that any exponentiable arrow in any category with finite limits is…

We investigate higher-dimensional $\Delta$-systems indexed by finite sets of ordinals, isolating a particular definition thereof and proving a higher-dimensional version of the classical $\Delta$-system lemma. We focus in particular on…

A set is effectively chosen in every class of $\bf\Delta^0_2$ sets modulo countable.

We prove that a Spector--like ultrapower extension $\gN$ of a countable Solovay model $\gM$ (where all sets of reals are Lebesgue measurable) is equal to the set of all sets constructible from reals in a generic extension $\gM[\al]$ where…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…

We investigate the generalized derivations and show that every generalized derivation on a simple Hilbert $C^*$-module either is closable or has a dense range. We also describe dynamical systems on a full Hilbert $C^*$-module ${\mathcal M}$…