English
Related papers

Related papers: Decidability of some complicated structures defina…

200 papers

We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…

Logic · Mathematics 2019-10-02 Pantelis E. Eleftheriou , Ayhan Günaydin , Philipp Hieronymi

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

Logic · Mathematics 2022-04-21 Emil Jeřábek

Let $\mathscr{C}$ be a 2-Calabi-Yau triangulated category, and let $\mathscr{T}$ be a cluster tilting subcategory of $\mathscr{C}$. An important result from Dehy and Keller tells us that a rigid object $c \in \mathscr{C}$ is uniquely…

Representation Theory · Mathematics 2019-08-30 Joseph Reid

We prove that the theory of all modules over the ring of algebraic integers is decidable.

Logic · Mathematics 2016-03-31 Sonia L'Innocente , Carlo Toffalori , Gena Puninski

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Logic in Computer Science · Computer Science 2017-04-11 Arno Pauly

Let A be the integral closure of the ring of polynomials CC[t], within the field of algebraic functions in one variable. We show that A interprets the ring of integers. This contrasts with the analogue for finite fields, proved to have a…

Logic · Mathematics 2023-12-12 Taylor Dupuy , Ehud Hrushovski

In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…

Computational Complexity · Computer Science 2024-06-04 Riccardo Gozzi , Olivier Bournez

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Logic · Mathematics 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

We consider some diophantine problems suggested by the analogy between multiplicative groups and powers of the modular curve in problems of "unlikely intersections." We prove a special case of the Zilber-Pink conjecture for curves.

Number Theory · Mathematics 2015-08-21 Jonathan Pila

We are concerned with the question of determining the set $C(\mathbb{Q})$, where $C$ is a curve defined by an equation of the form $y^q=f(x)$, where $q$ is an odd prime and $f$ is a polynomial defined over $\mathbb{Q}$. This question can…

Number Theory · Mathematics 2012-05-16 Michael Mourao

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Johannes Greiner

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

Logic · Mathematics 2010-12-07 Hector Pasten , Thanases Pheidas , Xavier Vidaux

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

This paper is concerned with the shape invariants satisfied by the communication topology of {\pi}-terms, and the automatic inference of these invariants. A {\pi}-term P is hierarchical if there is a finite forest T such that the…

Programming Languages · Computer Science 2016-04-20 Emanuele D'Osualdo , C. -H. Luke Ong

We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…

Dynamical Systems · Mathematics 2020-04-30 Charles Favre , Thomas Gauthier

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

We determine all Chern numbers of smooth complex projective varieties of dimension at least four which are determined up to finite ambiguity by the underlying smooth manifold. We also give an upper bound on the dimension of the space of…

Algebraic Geometry · Mathematics 2018-10-31 Stefan Schreieder , Luca Tasin

Let $R$ be a commutative integral unital domain and $L$ a free non-commutative Lie algebra over $R$. In this paper we show that the ring $R$ and its action on $L$ are 0-interpretable in $L$, viewed as a ring with the standard ring language…

Logic · Mathematics 2017-05-23 Olga Kharlampovich , Alexei Myasnikov