Related papers: Amoeba-absoluteness and projective measurability

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

This is an introductory paper to a series of results linking generic absoluteness results for second and third order number theory to the model theoretic notion of model companionship. Specifically we develop here a general framework…

We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples…

We prove that the property Add$(M)\subseteq$ Prod$(M)$ characterizes $\Sigma$-algebraically compact modules if $|M|$ is not $\omega$-measurable. Moreover, under a large cardinal assumption, we show that over any ring $R$ where $|R|$ is not…

We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…

Shoenfield's completeness theorem (1959) states that every true first order arithmetical sentence has a recursive $\omega$-proof encodable by using recursive applications of the $\omega$-rule. For a suitable encoding of Gentzen style…

Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…

Let $V$ be a connected $3$-dimensional handlebody of finite genus at least $3$. We prove that the handlebody group $\mathrm{Mod}(V)$ is superrigid for measure equivalence, i.e. every countable group which is measure equivalent to…

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

We derive an exact expression for the quantumness of a Hilbert space (defined in quant-ph/0302092), and show that in composite Hilbert spaces the signal states must contain at least some entangled states in order to achieve such a…

Let I be a sigma-ideal sigma-generated by a projective collection of closed sets. The forcing with I-positive Borel sets is proper and adds a single real r of an almost minimal degree: if s is a real in V[r] then s is Cohen generic over V…

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

For complete affine manifolds we introduce a definition of compactification based on the projective differential geometry (i.e.\ geodesic path data) of the given connection. The definition of projective compactness involves a real parameter…

Superposition is an essential feature of quantum mechanics. From the Schrodinger's cat to quantum algorithms such as Deutsch-Jorsza algorithm, quantum superposition plays an important role. It is one fundamental and crucial question how to…

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

The Proper Forcing Axiom implies that compact Hausdorff spaces are either first-countable or contain a converging $\omega_1$-sequence.

A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…