English
Related papers

Related papers: On the Topological Complexity of Infinitary Ration…

200 papers

In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…

Formal Languages and Automata Theory · Computer Science 2013-10-04 Victor Marsault , Jacques Sakarovitch

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

Classical Analysis and ODEs · Mathematics 2024-09-30 Gergő Nemes

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

IFor a positive rational $l$, we define the concept of an $l$-elliptic and an $l$-hyperbolic rational set in a metric space. In this article we examine the existence of (i) dense and (ii) infinite $l$-hyperbolic and $l$-ellitpic rationals…

Number Theory · Mathematics 2023-07-06 C P Anil Kumar

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Logic · Mathematics 2016-02-02 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…

Logic · Mathematics 2025-12-30 Tyler Arant , Alexander S. Kechris , Patrick Lutz

The paper gives some criteria for partial sums of rational number sequences to be not rational functions and to be not algebraic functions. As an application, we study partial sums of some famous rational number sequences in mathematical…

Commutative Algebra · Mathematics 2014-06-06 Duong Quoc Viet , Truong Thi Hong Thanh

We present a self-contained analysis of infinity from two mathematical perspectives: set theory and algebra. We begin with cardinal and ordinal numbers, examining deep questions such as the continuum hypothesis, along with foundational…

History and Overview · Mathematics 2025-05-16 Noah Betz

We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…

Number Theory · Mathematics 2025-06-18 Gal Binyamini , Fumiharu Kato

This is a slightly edited version of my talk on Mathematische Arbeitstagung 2011, Bonn. I present a result relating noncommutative Laurent polynomials with algebraic functions, and show examples of integrability and Laurent phenomenon for…

Rings and Algebras · Mathematics 2011-09-13 Maxim Kontsevich

Elaborating on a paper by Suter, we provide a detailed description of the automorphism group of the poset of abelian ideals in a Borel subalgebra of a finite dimensional complex simple Lie algebra.

Representation Theory · Mathematics 2016-02-16 Paola Cellini , Pierluigi Moseneder Frajria , Paolo Papi

We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time…

Logic · Mathematics 2019-08-16 Samuel Coskey , Joel David Hamkins

A selection of basic results on Borel reducibility of ideals and equivalence relations, especially those with comparably short proofs. This is an unfinished text as yet. Some proofs have missing parts and loose ends. [email protected] and…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Complex Variables · Mathematics 2017-09-26 Simon St-Amant , Jérémie Turcotte

We characterize the completely determined Borel subsets of HYP as exactly the omega_1^{ck} subsets of HYP. As a result, HYP believes there is a Borel well-ordering of the reals, that the Borel Dual Ramsey Theorem fails, and that every Borel…

Logic · Mathematics 2022-03-03 Henry Towsner , Rose Weisshaar , Linda Westrick

In this paper, we first show that a union of upper-level sets associated to fibrewise Lelong numbers of plurisubharmonic functions is in general a pluripolar subset. Then we obtain analyticity theorems for a union of sub-level sets…

Complex Variables · Mathematics 2024-05-14 Bojie He

In this paper, we construct a compact subset of the real plane whose path-connectedness equivalence relation is Borel bireducible to a nonsmooth hyperfinite Borel equivalence relation. This answers a question of \cite{bec98}.

Logic · Mathematics 2025-02-18 Yusuf Uyar

In a recent paper, Bruhn, Diestel, Kriesell and Wollan (arXiv:1003.3919) present four systems of axioms for infinite matroids, in terms of independent sets, bases, closure and circuits. No system of rank axioms is given. We give an easy…

Combinatorics · Mathematics 2010-05-28 R. A. Pendavingh