English
Related papers

Related papers: First- and Second-Order Models of Recursive Arithm…

200 papers

We extend results from an earlier paper giving reconstruction results for the endomorphism monoid of the rational numbers under the strict and reflexive relations to the first order reducts of the rationals and the corresponding…

Logic · Mathematics 2019-03-13 John K Truss , Edith Vargas-Garcia

In this article, intended for the Handbook of Recursion Theory, we survey recursion theory on the ordinal numbers, with sections devoted to $\alpha$-recursion theory, $\beta$-recursion theory and the study of the admissibility spectrum.

Logic · Mathematics 2016-09-06 Chi Tat Chong , Sy D. Friedman

Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in commutative ring theory. Our main contributions to the field…

Logic · Mathematics 2021-09-07 Jordan Mitchell Barrett

This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…

Logic · Mathematics 2024-11-26 Koki Hashimoto

We study the reverse mathematics of the theory of countable second-countable topological spaces, with a focus on compactness. We show that the general theory of such spaces works as expected in the subsystem $\mathsf{ACA}_0$ of second-order…

Logic · Mathematics 2011-11-01 François G. Dorais

We present an adaptation of two recent low-rank approximation technique proposed for first-order model reduction systems to the second-order systems. The resulting reduced order models are guaranteed to keep the second order structure which…

Dynamical Systems · Mathematics 2015-12-01 Younes Chahlaoui

This paper presents a reverse mathematical analysis of several forms of the sorites paradox. We first illustrate how traditional formulations are reliant on H\"older's Representation Theorem for ordered Archimedean groups. While this is…

Logic · Mathematics 2025-10-15 Walter Dean , Sam Sanders

In the previous three papers in this series, [WKO1]-[WKO3] (arXiv:1405.1956, arXiv:1405.1955, and to appear), Z. Dancso and I studied a certain theory of "homomorphic expansions" of "w-knotted objects", a certain class of knotted objects in…

Geometric Topology · Mathematics 2015-11-19 Dror Bar-Natan

Low rank approximation of a matrix (hereafter LRA) is a highly important area of Numerical Linear and Multilinear Algebra and Data Mining and Analysis. One can operate with an LRA at sublinear cost -- by using much fewer memory cells and…

Numerical Analysis · Mathematics 2025-07-11 Soo Go , Qi Luan , Victor Y. Pan , John Svadlenka , Liang Zhao

The article deals with the problem of the integrable discretization of the well-known Drinfeld-Sokolov hierarchies related to the Kac-Moody algebras. A class of discrete exponential systems connected with the Cartan matrices has been…

Exactly Solvable and Integrable Systems · Physics 2019-05-31 I T Habibullin , A R Khakimova

A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offers a (co)algebraic framework for studying processes with algebraic branching structures and recursion operators. The framework captures Milner's algebra of regular…

Logic in Computer Science · Computer Science 2022-09-02 Todd Schmid

We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…

Logic · Mathematics 2024-09-12 Mengzhou Sun

To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…

Numerical Analysis · Mathematics 2014-05-20 Mário M. Graça

This paper is a sequel to arXiv:1401.6321. We define and study representation categories based on Deligne categories Rep(GL_t), Rep(O_t), Rep(Sp_2t), where t is any (non-integer) complex number. Namely, we define complex rank analogs of the…

Representation Theory · Mathematics 2020-05-14 Pavel Etingof

Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…

Logic in Computer Science · Computer Science 2021-05-20 Fedor Part , Neil Thapen , Iddo Tzameret

This is the third in a sequence of four papers, where we prove the arithmetic Siegel--Weil formula in co-rank $1$ for Kudla--Rapoport special cycles on exotic smooth integral models of unitary Shimura varieties of arbitrarily large even…

Number Theory · Mathematics 2024-05-03 Ryan C. Chen

Recursive saturation and resplendence are two important notions in models of arithmetic. Kaye, Kossak, and Kotlarski introduced the notion of arithmetic saturation and argued that recursive saturation might not be as rigid as first assumed.…

Logic · Mathematics 2007-05-23 Fredrik Engström

We examine the noncommutative minimal model program for orders on arithmetic surfaces, or equivalently, arithmetic surfaces enriched by a Brauer class $\beta$. When $\beta$ has prime index $p>5$, we show the classical theory extends with…

Algebraic Geometry · Mathematics 2021-08-09 Daniel Chan , Colin Ingalls

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

Computational Complexity · Computer Science 2023-06-22 Carsten Rösnick-Neugebauer

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost