English
Related papers

Related papers: The Borel monadic theory of order is decidable

200 papers

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

Logic · Mathematics 2026-03-30 Su Gao , André Nies , Gianluca Paolini

A $\Sigma$-construction of Solovay is partially extended to the case of intermediate sets which are not necessarily subsets of the ground model. As an application, we prove that, for a given name $t$, the set of all sets $t[G]$, $G$ being…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the…

Group Theory · Mathematics 2022-04-21 Karsten Henckell , Samuel Herman

Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order…

Logic in Computer Science · Computer Science 2019-06-28 Anantha Padmanabha , R. Ramanujam

We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…

Logic in Computer Science · Computer Science 2023-08-01 Flavien Breuvart , Dylan McDermott , Tarmo Uustalu

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

Logic · Mathematics 2025-07-22 Mihai Prunescu

We show that a natural, two sorted $\cL_{\omega_1,\omega}$ theory involving the modular $j$-function is categorical in all uncountable cardinaities. It is also shown that a slight weakening of the adelic Mumford-Tate conjecture for products…

Logic · Mathematics 2013-04-18 Adam Harris

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

Logic · Mathematics 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

In this note we provide some counterexamples for the conjecture of Moret\'{o} on finite simple groups, which says that any finite simple group $G$ can determined in terms of its order $|G|$ and the number of elements of order $p$, where $p$…

Group Theory · Mathematics 2020-07-30 Jinbao Li , Wujie Shi

Every permutation invariant Borel subset of the space of countable structures is definable in $\La_{\omega_1\omega}$ by a theorem of Lopez-Escobar. We prove variants of this theorem relative to fixed relations and fixed non-permutation…

Logic · Mathematics 2010-03-15 Fredrik Engström , Philipp Schlicht

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

In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in…

Quantum Physics · Physics 2014-04-24 Hector Freytes , Christian de Ronde , Graciela Domenech

For $F \in \mathbb{Z}[s,t]$ a binary quadratic form which is irreducible over $\mathbb{Q}$, and $L$ an abelian number field with class number $1$, we obtain the order of magnitude for the number of values $F(s,t)$ which are a norm from $L$.…

Number Theory · Mathematics 2026-04-16 Mathieu Da Silva

The satisfiability problem for First-order Modal Logic (\FOML) is undecidable even for simple fragments like having only unary predicates, two variables etc. Recently a new way to identify decidable fragments of \FOML has been introduced…

Logic in Computer Science · Computer Science 2025-06-03 Varad Joshi , Anantha Padmanabha

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

Logic in Computer Science · Computer Science 2021-09-27 Simon Halfon , Philippe Schnoebelen , Georg Zetzsche

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Logic · Mathematics 2025-08-13 Andrew Apps

Higher order cohomology of arithmetic groups is expressed in terms of (g,K)-cohomology. Generalizing results of Borel, it is shown that the latter can be computed using functions of (uniform) moderate growth. A higher order versions of…

Number Theory · Mathematics 2008-05-16 Anton Deitmar

This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…

Logic · Mathematics 2020-01-14 Andrew Powell

For each nonnegative integer $g$, we classify the ramification types and monodromy groups of indecomposable coverings of complex curves $f: X\to Y$ where $X$ has genus $g$, under the hypothesis that $n:=\deg(f)$ is sufficiently large and…

Algebraic Geometry · Mathematics 2024-03-27 Danny Neftin , Michael E. Zieve

We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a $\pmb\Pi_\omega^0$-complete set of models. In…

Logic · Mathematics 2025-03-17 Uri Andrews , David Gonzalez , Steffen Lempp , Dino Rossegger , Hongyu Zhu