English
Related papers

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

200 papers

We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…

Logic · Mathematics 2026-02-27 Matthias Kunik

We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory \`a la Buss (expressed in this new language) precisely capture polytime random functions. Then, we…

Logic in Computer Science · Computer Science 2023-11-28 Melissa Antonelli , Ugo Dal Lago , Davide Davoli , Isabel Oitavem , Paolo Pistone

Given an integral indefinite binary Hermitian form f over an imaginary quadratic number field, we give a precise asymptotic equivalent to the number of nonequivalent representations, satisfying some congruence properties, of the rational…

Number Theory · Mathematics 2010-04-20 Jouni Parkkonen , Frédéric Paulin

D'Aquino, Knight and Starchenko classified the countable real closed fields with integer parts that are nonstandard models of Peano Arithmetic. We rule out some possibilities for extending their results to the uncountable and study real…

Logic · Mathematics 2014-01-28 David Marker , James Schmerl , Charles Steinhorn

We axiomatize a class of existentially closed exponential fields equipped with an $E$-derivation. We apply our results to the field of real numbers endowed with $exp(x)$ the classical exponential function defined by its power series…

Logic · Mathematics 2023-01-18 Francoise Point , Nathalie Regnault

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…

Logic · Mathematics 2020-03-30 Ivan Georgiev , Lars Kristiansen , Frank Stephan

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…

Discrete Mathematics · Computer Science 2011-08-30 Pierre-Yves Angrand , Jacques Sakarovitch

We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…

Logic · Mathematics 2014-02-26 Tarek Sayed Ahmed

While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…

Computational Complexity · Computer Science 2018-01-23 Akitoshi Kawamura , Martin Ziegler

We investigate generalized quadratic forms with values in the set of rational integers over quadratic fields. We characterize the real quadratic fields which admit a positive definite binary generalized form of this type representing every…

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Group Theory · Mathematics 2014-11-25 Jorge Almeida , Stuart Margolis , Benjamin Steinberg , Mikhail Volkov

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

Logic in Computer Science · Computer Science 2021-05-14 Dominik D. Freydenberger , Liat Peterfreund

We prove a strong form of model completenes for expansions of the field of real numbers by (the real and imaginary parts of) the modular function J, by the modular forms $E_4$ and $E_6$ and quasimodular form $E_2$ defined in the usual…

Logic · Mathematics 2016-11-21 Ricardo Bianconi

The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…

Logic · Mathematics 2021-08-17 Sam Sanders

Intrigued by a well-known theorem of Mathieu's on Harish-Chandra modules over the Virasoro algebra, we give an analogous result for a class of Block type Lie algebras $\BB$, where the parameter $q$ is a nonzero complex number. We also…

Representation Theory · Mathematics 2011-02-28 Yucai Su , Chunguang Xia , Ying Xu

We give an axiomatization of the class ECF of exponentially closed fields, which includes the pseudo-exponential fields previously introduced by the second author, and show that it is superstable over its interpretation of arithmetic.…

Logic · Mathematics 2014-10-28 Jonathan Kirby , Boris Zilber

We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…

Number Theory · Mathematics 2025-01-30 Felipe García-Ramos , Gerardo González Robert , Mumtaz Hussain

We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…

Rings and Algebras · Mathematics 2018-05-08 Roland M. Friedrich

In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of…

Computational Complexity · Computer Science 2015-10-07 Benjamin Fish , Jeremy Kun , Ádám Dániel Lelkes , Lev Reyzin , György Turán

We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…

Combinatorics · Mathematics 2013-03-05 Edinah K. Gnang , Patrick Devlin
‹ Prev 1 4 5 6 7 8 10 Next ›