English
Related papers

Related papers: Definability and decidability in expansions by gen…

200 papers

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

Logic · Mathematics 2021-08-05 Martin Klazar

In a set equipped with a binary operation, (S,*), a subset U is defined to be avoidable if there exists a partition {A,B} of S such that no element of U is the product of two distinct elements of A or of two distinct elements of B. For more…

Combinatorics · Mathematics 2007-05-23 Mike Develin

The multiplicative group of a finite field is well known to be cyclic; in this note, we determine the finite fields whose multiplicative groups are direct sum indecomposable. We obtain our classification using a direct argument and also as…

Number Theory · Mathematics 2014-07-15 Sunil Chebolu , Keir Lockridge

Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest…

Number Theory · Mathematics 2021-11-11 Lu Cui , Minghui Ma

We explore \emph{semibounded} expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We introduce the notion of a \emph{semibounded} expansion of an arbitrary ordered group, extending…

Logic · Mathematics 2021-10-26 Alex Savatovsky

For any analytically finite Riemann surface, the Teichm\"uller modular group is countable, but it is not easy to find an analytically infinite Riemann surface for which the Teichm\"uller modular group is countable. In this paper, we show…

Complex Variables · Mathematics 2024-07-11 Erina Kinjo

In this paper we prove, without the finite rank assumption, that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group. The key ingredient of the proof is that we can determine, for an irreducible…

Group Theory · Mathematics 2007-05-23 Koji Nuida

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

Computational Geometry · Computer Science 2013-02-12 Martin Cadek , Marek Krcal , Jiri Matousek , Lukas Vokrinek , Uli Wagner

We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set $A$ of natural numbers is $n$--cohesive (respectively, $n$--r--cohesive) if $A$ is almost…

Logic · Mathematics 2016-09-07 Tamara Hummel , Carl Jockusch

Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned…

Classical Analysis and ODEs · Mathematics 2017-02-14 Iosif Pinelis

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 answer three conjectures. In particular we shall show that O_G can never be countably…

Group Theory · Mathematics 2007-05-23 Peter A. Linnell

The main purpose of this paper is to prove that the positive real numbers can be decomposed into finitely many disjoint pieces which are also closed under addition and multiplication. As a byproduct of the argument we determine all the…

Number Theory · Mathematics 2023-03-30 Gergely Kiss , Gábor Somlai , Tamás Terpai

There exists a d-minimal expansion of the $\mathbb R$-vector space over $\mathbb R$ which defines every sequence. In this paper, we prove this assertion and the following more general assertion: Let $\mathcal R$ be either the ordered…

Logic · Mathematics 2024-09-09 Masato Fujita

In 1895, Cantor showed that between every two countable dense real sets, there is an order isomorphism. In fact, there is always such an order isomorphism, which is the restriction of a universal entire function.

Complex Variables · Mathematics 2018-12-27 Paul M. Gauthier

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

Logic · Mathematics 2026-05-20 Pablo Andújar Guerrero

The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…

General Mathematics · Mathematics 2012-01-25 Antonio Leon

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

Logic · Mathematics 2025-06-10 Slavica Mihaljevic Vlahovic , Branislav Dobrasin Vlahovic

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

Logic in Computer Science · Computer Science 2026-05-14 Tom de Jong , Nicolai Kraus , Aref Mohammadzadeh , Fredrik Nordvall Forsberg

The goal of this paper is to show the following result: For every integer $n\geq 2$ there is a countable orderable group such that its space of orders is countable and has Cantor-Bendixson rank $n$. We show this by explicitly constructing a…

Group Theory · Mathematics 2024-12-11 Waseet Kazmi

Let $R$ be an o-minimal expansion of a group in a language in which $\textrm{Th}(R)$ eliminates quantifiers, and let $C$ be a predicate for a valuational cut in $R$. We identify a condition that implies quantifier elimination for…

Logic · Mathematics 2020-07-17 Clifton Ealy , Jana Maříková