English
Related papers

Related papers: Adding highly undefinable sets over $L$

200 papers

In this paper, we shall prove, for any $m\geq 1$, the existence of an uncountable subset of $U$-numbers of type $\leq m$ (which we called the set of {\it $m$-ultra numbers}) for which there exists uncountably many transcendental analytic…

Number Theory · Mathematics 2014-09-01 Diego Marques , Josimar Ramirez

The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…

Logic · Mathematics 2025-09-19 Jennifer Brown , Ricardo Suárez

Let $R$ be a ring with unity and $U(R)$ its group of units. Let $\Delta U=\{a\in U(R)\mid [U(R):C_{U(R)}(a)]<\infty\}$ be the $FC$-radical of $U(R)$ and let $\nabla(R)=\{a\in R\mid [U(R):C_{U(R)}(a)]<\infty\}$ be the $FC$-subring of $R$. An…

Rings and Algebras · Mathematics 2007-05-23 Victor Bovdi

We are going to prove that if the theory of a structure $\mathcal M=\langle \mathbb{N}, \Sigma \rangle$ is decidable and the standard order $<$ on natural numbers $\mathbb{N}$ is definable in $\mathcal M$, then there is a nontrivial…

Logic · Mathematics 2022-11-30 Sergei Soprunov

A Q-set is an uncountable set of reals all of whose subsets are relative $G_\delta$ sets. We prove that, for an arbitrary uncountable cardinal kappa, there is consistently a Q-set of size $\kappa$ whose square is not Q. This answers a…

Logic · Mathematics 2016-11-28 Joerg Brendle

Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…

Number Theory · Mathematics 2007-05-23 Simon Kristensen , Rebecca Thorn , Sanju Velani

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Logic · Mathematics 2007-05-23 David Marker , Theodore A. Slaman

Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…

Logic · Mathematics 2021-11-09 Pablo Andújar Guerrero

We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…

Logic · Mathematics 2025-10-21 Adam Bartoš , Wiesław Kubiś

If $L$ is a relational language, an $L$-structure ${\mathbb X}$ is condensable to an $L$-structure ${\mathbb Y}$, we write ${\mathbb X} \preccurlyeq _c {\mathbb Y}$, iff there is a bijective homomorphism (condensation) from ${\mathbb X}$…

Logic · Mathematics 2018-07-03 Miloš S. Kurilić

It is shown that each pseudonorm defined on a subgroup $H$ of an abelian group $G$ can be extended to a pseudonorm on $G$ such that the densities of the obtained pseudometrizable topological groups coincide. We derive from this that any…

General Topology · Mathematics 2008-10-20 T. Banakh , L. Zdomskyy

Let G be a group and let O_G denote the set of left orderings on G. Then O_G can be topologized in a natural way, and we shall study this topology to show that O_G can never be countably infinite. This paper retrieves correct parts of the…

Group Theory · Mathematics 2014-02-26 Peter A. Linnell

We investigate generalizations of the topology of the higher Cantor space on $2^\kappa$, based on arbitrary ideals rather than the bounded ideal on $\kappa$. Our main focus is on the topology induced by the nonstationary ideal, and we call…

Logic · Mathematics 2021-11-16 Peter Holy , Marlene Koelbing , Philipp Schlicht , Wolfgang Wohofsky

We prove, e.g., that if lambda=chi^+=2^chi and S subseteq {delta<lambda:cf(delta) neq cf(chi)} is stationary then diamondsuit_lambda holds true.

Logic · Mathematics 2010-06-16 Saharon Shelah

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…

Logic · Mathematics 2007-05-23 Peter Koepke

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

Logic in Computer Science · Computer Science 2024-02-14 Pascal Baumann , Moses Ganardi , Ramanathan S. Thinniyam , Georg Zetzsche

An inner model M is MINIMAL if there is a class A such that <M,A> is amenable yet has no transitive proper elementary submodel. We study minimal universes in the context of 0#. For example we prove: If 0# exists then there is an inner model…

Logic · Mathematics 2008-02-03 Sy D. Friedman

Let $M$ be a short extender mouse. We prove that if $E\in M$ and $M$ satisfies "$E$ is a countably complete short extender whose support is a cardinal $\theta$ and $\mathcal{H}_\theta\subseteq\mathrm{Ult}(V,E)$", then $E$ is in the extender…

Logic · Mathematics 2025-04-11 Farmer Schlutzenberg

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…

Logic · Mathematics 2022-03-02 Noam Greenberg , Saharon Shelah
‹ Prev 1 8 9 10 Next ›