English
Related papers

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

200 papers

Exploring further the connection between exponentiation on real closed fields and the existence of an integer part modelling strong fragments of arithmetic, we demonstrate that each model of true arithmetic is an integer part of an…

Logic · Mathematics 2026-05-19 Merlin Carl

The elementary arithmetic operations $+,\cdot,\le$ on integers are well-known to be computable in the weak complexity class $\mathrm{TC}^0$, and it is a basic question what properties of these operations can be proved using only…

Logic in Computer Science · Computer Science 2015-03-25 Emil Jeřábek

We show that $VTC^0$, the basic theory of bounded arithmetic corresponding to the complexity class $\mathrm{TC}^0$, proves the $IMUL$ axiom expressing the totality of iterated multiplication satisfying its recursive definition, by…

Logic in Computer Science · Computer Science 2022-07-14 Emil Jeřábek

We axiomatize the first-order theories of exponential integer parts of real-closed exponential fields in a language with $2^x$, in a language with a predicate for powers of 2, and in the basic language of ordered rings. In particular, the…

Logic · Mathematics 2025-10-07 Emil Jeřábek

We prove in ZFC the existence of a definable, countably saturated elementary extension of the reals. It seems that it has been taken for granted that there is no distinguished, definable nonstandard model of the reals. (This means a…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Saharon Shelah

In an extended abstract Ressayre considered real closed exponential fields and integer parts that respect the exponential function. He outlined a proof that every real closed exponential field has an exponential integer part. In the present…

Logic · Mathematics 2013-01-01 Paola D'Aquino , Julia F. Knight , Salma Kuhlmann , Karen Lange

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Logic · Mathematics 2026-02-12 Tumadhir Alsulami , Marcel Jackson

We present a general method for introducing finitely axiomatizable "minimal" two-sorted theories for various subclasses of P (problems solvable in polynomial time). The two sorts are natural numbers and finite sets of natural numbers. The…

Logic in Computer Science · Computer Science 2017-01-11 Phuong Nguyen , Stephen Cook

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We investigate $IPA$ - real closed fields, that is, real closed fields which admit an integer part whose non-negative cone is a model of Peano Arithmetic. We show that the value group of an $IPA$ - real closed field is an exponential group…

Logic · Mathematics 2018-11-02 Merlin Carl , Paola D'Aquino , Salma Kuhlmann

We prove that in every ring of generalised power series with non-positive real exponents and coefficients in a field of characteristic zero, every series admits a factorisation into finitely many irreducibles of infinite support, the number…

Logic · Mathematics 2024-03-05 Sonia L'Innocente , Vincenzo Mantova

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

Logic · Mathematics 2010-10-13 Damir D. Dzhafarov

Let $F$ be an entire function of exponential type represented by the Taylor series \[ F(z) = \sum_{n\ge 0} \omega_n \frac{z^n}{n!} \] with unimodular coefficients $|\omega_n|=1$. We show that either the counting function $n_F(r)$ of zeroes…

Complex Variables · Mathematics 2026-05-05 Lior Hadassi , Mikhail Sodin

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…

Logic · Mathematics 2020-05-13 Emil Jeřábek

Let $\mathbb{T}$ be the differential field of logarithmic-exponential transseries. We show that the expansion of $\mathbb{T}$ by its natural exponential function is model complete and locally o-minimal. We give an axiomatization of the…

Logic · Mathematics 2020-11-30 Elliot Kaplan

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

Inspired by Conway's surreal numbers, we study real closed fields whose value group is isomorphic to the additive reduct of the field. We call such fields omega-fields and we prove that any omega-field of bounded Hahn series with real…

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type…

Computation and Language · Computer Science 2024-02-14 Sergey Slavnov
‹ Prev 1 2 3 10 Next ›