English
Related papers

Related papers: Models of $VTC^0$ as exponential integer parts

200 papers

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

Logic · Mathematics 2023-04-17 Alec Fox

We construct irreducible modules of centrally-extended classical Lie algebras over left ideals of the algebra of differential operators on the circle, through certain irreducible modules of centrally-extended classical Lie algebras of…

Quantum Algebra · Mathematics 2007-05-23 Xiaoping Xu

We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…

Quantum Algebra · Mathematics 2010-12-06 Thomas J. Robinson

We define a class of pre-ordered abelian groups that we call finite-by-Presburger groups, and prove that their theory is model-complete. We show that certain quotients of the multiplicative group of a local field of characteristic zero are…

Logic · Mathematics 2016-03-30 Jamshid Derakhshan , Angus Macintyre

Let $T$ be the theory of an o-minimal field and $T_0$ a common reduct of $T$ and $T_{an}$. I adapt Mourgues' and Ressayre's constructions to deduce structure results for $T_0$-reducts of $T$-$\lambda$-spherical completion of models of…

Logic · Mathematics 2026-04-08 Pietro Freni

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

Automated theorem provers (ATPs) can disprove conjectures by saturating a set of clauses, but the resulting saturated sets are opaque certificates. In the unit equational fragment, a saturated set can in fact be read as a convergent rewrite…

Logic in Computer Science · Computer Science 2026-02-19 Mikoláš Janota , Michael Rawson , Stephan Schulz

In this note, we study non-standard models of the rational numbers with countably many elements. These are ordered fields, and so it makes sense to complete them, using non-standard Cauchy sequences. The main result of this note shows that…

Logic · Mathematics 2007-05-23 Peter Laubenheimer , Thomas Schick , Ulrich Stuhler

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

This work originates from the observation that today's state-of-the-art statistical language models are impressive not only for their performance, but also - and quite crucially - because they are built entirely from correlations in…

Computation and Language · Computer Science 2024-08-07 Tai-Danae Bradley , Yiannis Vlassopoulos

In 1964 Shepherdson \cite{shepherdson:1964} proved that a discretely ordered semiring $\mathcal{M}^+$ satisfies $\sf{IOpen}$ (quantifier free induction) iff the corresponding ring $\mathcal{M}$ is an integer part of the real closure of the…

Logic · Mathematics 2026-05-28 Konstantin Kovalyov

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

Logic · Mathematics 2020-06-23 Sam Sanders

We show that the theory of algebraically closed fields with multiplicative circular orders has a model companion $\mathrm{ACFO}$. Using number-theoretic results on character sums over finite fields, we show that if $\mathbb{F}$ is an…

Logic · Mathematics 2019-07-17 Chieu-Minh Tran

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Group Theory · Mathematics 2021-10-27 Emmanuel Rauzy

We study initial cuts of models of weak two-sorted Bounded Arithmetics with respect to the strength of their theories and show that these theories are stronger than the original one. More explicitly we will see that polylogarithmic cuts of…

Logic in Computer Science · Computer Science 2015-07-01 Sebastian Müller

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Logic · Mathematics 2015-01-15 Boris Zilber

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

In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…

General Mathematics · Mathematics 2021-06-08 Arindama Singh

We continue the effort of grokking the structure of power-bounded $T$-convex valued fields, whose theory is in general referred to as TCVF. In the present paper our focus is on certain expansion of it that is equipped with a tempered…

Logic · Mathematics 2020-12-21 Yimu Yin

Given a dense additive subgroup $G$ of $\mathbb R$ containing $\mathbb Z$, we consider its intersection $\mathbb G$ with the interval $[0,1[$ with the induced order and the group structure given by addition modulo $1$. We axiomatize the…

Logic · Mathematics 2017-07-20 Luc Bélair , Françoise Point