English
Related papers

Related papers: Ordinal Recursion Theory

200 papers

The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…

Logic in Computer Science · Computer Science 2007-05-23 Frédéric Blanqui

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

We derive octupole-level secular perturbation equations for hierarchical triple systems, using classical Hamiltonian perturbation techniques. By extending previous work done to leading (quadrupole) order to octupole level (i.e., including…

Astrophysics · Physics 2009-10-31 Eric B. Ford , Boris Kozinsky , Frederic A. Rasio

This paper is dedicated to a robust ordinal method for learning the preferences of a decision maker between subsets. The decision model, derived from Fishburn and LaValle (1996) and whose parameters we learn, is general enough to be…

Artificial Intelligence · Computer Science 2023-08-08 Hugo Gilbert , Mohamed Ouaguenouni , Meltem Ozturk , Olivier Spanjaard

We complement the recent paper of Zheng and Wu [Uniform recurrence properties for beta-transformation, Nonlinearity 33 (2020), 4590--4612], where the authors study, from the metrical point of view, the uniform recurrence properties of the…

Dynamical Systems · Mathematics 2025-12-03 Yann Bugeaud

In the theory of conditional sets, many classical theorems from areas such as functional analysis, probability theory or measure theory are lifted to a conditional framework, often to be applied in areas such as mathematical economics or…

Logic · Mathematics 2019-01-15 Merlin Carl , Asgar Jamneshan

In this paper we study admissible extensions of several theories T of reverse mathematics. The idea is that in such an extension the structure M = (N,S,\in) of the natural numbers N and collection of sets of natural numbers S has to obey…

Logic · Mathematics 2023-06-23 Gerhard Jäger , Michael Rathjen

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Logic · Mathematics 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki

We study the generalized Hankel transform of the family of sequences satisfying the recurrence relation $a_{n+1} = \bigl(\alpha + \frac{\beta}{n+\gamma}\bigr) a_n$. We apply the obtained formula to several particular important sequences.…

Combinatorics · Mathematics 2012-03-27 Mario Garcia-Armas

The purpose of this note is to provide a short invitation to the universal algebraic approach to topological string theory. In the first section we make an attempt to explain the origin of this approach and how it fits into the bigger…

High Energy Physics - Theory · Physics 2013-03-07 Nils Carqueville , Michael M. Kay

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

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

We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow the…

Logic · Mathematics 2023-06-22 Rod Downey , Alexander Melnikov , Keng Meng Ng

Ordinal measurements are common outcomes in studies within psychology, as well as in the social and behavioral sciences. Choosing an appropriate regression model for analysing such data poses a difficult task. This paper aims to facilitate…

Methodology · Statistics 2026-03-03 Stefan Inerle , Markus Pauly , Moritz Berger

Using light cone string field theory we derive recursion relations for closed string correlation functions and scattering amplitudes which hold to all orders in perturbation theory. These results extend to strings in a plane wave…

High Energy Physics - Theory · Physics 2008-11-26 Anton Ilderton

Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Kitti Gelle , Szabolcs Iván

We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the…

Logic · Mathematics 2008-11-21 Alberto Marcone

Based on prototypical example of Al.Zamolodchikov's recursion relations for the four point conformal block and using recently proposed Alday-Gaiotto-Tachikawa (AGT) conjecture, recursion relations are derived for the generalized…

High Energy Physics - Theory · Physics 2010-03-25 Rubik Poghossian

For any $\beta > 1$, let $T_\beta: [0,1)\rightarrow [0,1)$ be the $\beta$-transformation defined by $T_\beta x=\beta x \mod 1$. We study the uniform recurrence properties of the orbit of a point under the $\beta$-transformation to the point…

Dynamical Systems · Mathematics 2020-08-26 Lixuan Zheng , Min Wu

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

Logic · Mathematics 2008-01-15 Arnold W. Miller