English
Related papers

Related papers: Left computably enumerable reals and initial segme…

200 papers

As a part of our works on effective properties of probability distributions, we deal with the corresponding characteristic functions. A sequence of probability distributions is computable if and only if the corresponding sequence of…

Computational Complexity · Computer Science 2015-07-01 Takakazu Mori , Yoshiki Tsujii , Mariko Yasugi

By studying the spectral aspects of the fractional part function in a well-known separable Hilbert space, we show, among other things, a rational approximation of the Riemann zeta function and its derivatives valid on every vertical line in…

Number Theory · Mathematics 2022-09-28 Lahoucine Elaissaoui

We make a detailed study of idempotent ideals that are traces of countably generated projective right modules. We associate to such ideals an ascending chain of finitely generated left ideals and, dually, a descending chain of cofinitely…

Rings and Algebras · Mathematics 2013-09-20 Dolors Herbera , Pavel Prihoda

We prolonge the list of C*-algebras for which all extensions by any stable separable C*-algebra are semi-invertible. In particular, we handle certain amalgamations, both of C*-algebras and of groups. Concerning groups we consider both…

Operator Algebras · Mathematics 2010-05-13 Vladimir Manuilov , Klaus Thomsen

On the real numbers, the notions of a semi-decidable relation and that of an effectively enumerable relation differ. The second only seems to be adequate to express, in an algorithmic way, non deterministic physical theories, where…

Logic in Computer Science · Computer Science 2023-05-03 Gilles Dowek

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…

Number Theory · Mathematics 2025-11-21 Manuel Hauke , Emmanuel Kowalski

We study the expressivity and computational aspects of first-order logic and its extensions in the semiring semantics developed by Gr\"adel and Tannen. We characterize the complexity of model checking and data complexity of first-order…

Logic in Computer Science · Computer Science 2025-05-21 Timon Barlag , Nicolas Fröhlich , Teemu Hankala , Miika Hannula , Minna Hirvonen , Vivian Holzapfel , Juha Kontinen , Arne Meier , Laura Strieker

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…

Logic · Mathematics 2010-03-26 Guido Gherardi , Alberto Marcone

The article concerns the existence and uniqueness of quantisations of cluster algebras. We prove that cluster algebras with an initial exchange matrix of full rank admit a quantisation in the sense of Berenstein-Zelevinsky and give an…

Quantum Algebra · Mathematics 2017-09-11 Florian Gellert , Philipp Lampe

Let $X$ be an algebraic scheme over an algebraically closed field and $\ell$ a prime number invertible on $X$. According to classical results (due essentially to A. Grothendieck, M. Artin and P. Deligne), the \'etale cohomology groups…

Algebraic Geometry · Mathematics 2016-01-20 David A. Madore , Fabrice Orgogozo

We propose a new constructive model of the real continuum based on the notion of fractal definability. Rather than assuming the continuum as a completed uncountable totality, we view it as the cumulative result of a vast space of stratified…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

We prove a functoriality result for the full C*-algebras of right-LCM monoids with respect to monoid inclusions that are closed under factorization and preserve orthogonality, and use this to show that if a right-LCM monoid is amenable in…

Operator Algebras · Mathematics 2020-01-15 Marcelo Laca , Boyu Li

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Weihrauch , Nazanin Tavana-Roshandel

A cancellative commutative monoid is atomic if every non-invertible element factors into irreducibles. Under certain mild conditions on a positive algebraic number $\alpha$, the additive monoid $M_\alpha$ of the evaluation semiring…

Commutative Algebra · Mathematics 2022-01-05 Nancy Jiang , Bangzheng Li , Sophie Zhu

A fruitful way of obtaining meaningful, possibly concrete, algorithmically random numbers is to consider a potential behaviour of a Turing machine and its probability with respect to a measure (or semi-measure) on the input space of binary…

Computational Complexity · Computer Science 2017-06-13 George Barmpalias , Douglas Cenzer , Christopher P. Porter

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

Logic · Mathematics 2024-07-23 Philipp Hieronymi , Sven Manthe , Chris Schulz

We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…

Logic · Mathematics 2010-03-03 Saharon Shelah

We extend the definition of the Costas property to functions in the continuum, namely on intervals of the reals or the rationals, and argue that such functions can be used in the same applications as discrete Costas arrays. We construct…

Combinatorics · Mathematics 2007-06-12 Konstantinos Drakakis , Scott Rickard

Khabibullin's conjecture for integral inequalities has two numeric parameters $n$ and $\alpha$ in its statement, $n$ being a positive integer and $\alpha$ being a positive real number. This conjecture is already proved in the case where…

Classical Analysis and ODEs · Mathematics 2011-06-08 Ruslan Sharipov

Let $C$ be a coalgebra. We investigate the problem of when the rational part of every finitely generated $C^*$-module $M$ is a direct summand $M$. We show that such a coalgebra must have at most countable dimension, $C$ must be artinian as…

Rings and Algebras · Mathematics 2011-09-15 Miodrag Cristian Iovanov