English
Related papers

Related papers: A Note on Superamorphous Sets and Dual Dedekind-In…

200 papers

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

Logic in Computer Science · Computer Science 2023-06-22 Mikołaj Bojańczyk , Laure Daviaud , Bruno Guillon , Vincent Penelle , A. V. Sreejith

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Logic · Mathematics 2023-09-20 Philipp Lücke , Sandra Müller

We give a simple, elementary proof that a uniform algebra is weakly sequentially complete if and only if it is finite-dimensional.

Functional Analysis · Mathematics 2023-07-04 J. F. Feinstein , Alexander J. Izzo

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…

Logic · Mathematics 2018-11-05 Chitat Chong , Wei Li , Wei Wang , Yue Yang

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

Group Theory · Mathematics 2019-08-26 Itay Kaplan , Pierre Simon

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

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Logic in Computer Science · Computer Science 2024-11-14 Arka Ghosh , Piotr Hofman , Sławomir Lasota

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

Logic · Mathematics 2026-02-23 Tomohiro Kawakami , Hiroshi Tanaka

In this paper we seek geometric and invariant-theoretic characterizations of (Schur-)representation finite algebras. To this end, we introduce two classes of finite-dimensional algebras: those with the dense-orbit property and those with…

Representation Theory · Mathematics 2015-09-18 Calin Chindris , Ryan Kinser , Jerzy Weyman

When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…

Logic · Mathematics 2020-06-30 Riccardo Camerlo , Raphaël Carroy , Alberto Marcone

A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…

Logic · Mathematics 2016-09-07 Saharon Shelah

Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be…

Combinatorics · Mathematics 2015-06-04 Péter L. Erdős , Dömötör Pálvölgyi , Claude Tardif , Gábor Tardos

We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…

Logic · Mathematics 2022-09-15 Deacon Linkhorn

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether,…

Logic · Mathematics 2013-03-21 Laurent Bienvenu , Rupert Hölzl , Adam R. Day

Suppose that M is an infinite structure with finite relational vocabulary such that every relation symbol has arity at most 2. If M is simple and homogeneous then its complete theory is supersimple with finite SU-rank which cannot exceed…

Logic · Mathematics 2015-04-08 Vera Koponen

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

Logic · Mathematics 2008-02-03 Thomas Jech , Saharon Shelah

The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos…

Category Theory · Mathematics 2015-08-27 David Michael Roberts

We study two properties of nonsingular and infinite measure-preserving ergodic systems: weak double ergodicity, and ergodicity with isometric coefficients. We show that there exist infinite measure-preserving transformations that are…

Dynamical Systems · Mathematics 2023-02-07 Beatrix Haddock , James Leng , Cesar E. Silva

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi