English
Related papers

Related papers: Tracking chains revisited

200 papers

We provide mutual elementary recursive order isomorphisms between classical ordinal notations, based on Skolem hulling, and notations from pure elementary patterns of resemblance of order $2$, showing that the latter characterize the…

Logic · Mathematics 2017-10-06 Gunnar Wilken

Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…

Logic · Mathematics 2025-10-22 Amirhossein Akbar Tabatabai , Vitor Greati , Revantha Ramanayake

The paper focuses on the structure of fundamental sequences of ordinals smaller than $\epsilon_0$. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for…

Logic in Computer Science · Computer Science 2010-06-17 Laurent Braud

Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article "Elementary-base cirquent calculus I: Parallel and choice connectives" built the sound and complete…

Logic in Computer Science · Computer Science 2019-02-20 Giorgi Japaridze

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

Logic · Mathematics 2021-12-16 Anton Freund , Michael Rathjen

We display the entire structure ${\cal R}_2$ coding $\Sigma_1$- and $\Sigma_2$-elementarity on the ordinals. This will enable the analysis of pure $\Sigma_3$-elementary substructures.

Logic · Mathematics 2021-06-10 Gunnar Wilken

We consider the constructive ordinal notation system for the ordinal ${\epsilon_0}$ that were introduced by L.D. Beklemishev. There are fragments of this system that are ordinal notation systems for the smaller ordinals ${\omega_n}$ (towers…

Logic · Mathematics 2013-12-12 Fedor Pakhomov

We investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On the one hand, it is well-known that every first-order predicate modal logic complete with respect to…

Logic · Mathematics 2019-12-24 Mikhail Rybakov , Dmitry Shkatov

This article is concerned with classifying the provably total set-functions of Kripke-Platek set theory, KP, and Power Kripke-Platek set theory, KP(P), as well as proving several (partial) conservativity results. The main technical tool…

Logic · Mathematics 2016-10-10 Jacob Cook , Michael Rathjen

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

Probability · Mathematics 2016-02-09 D. A. Dawson , L. G. Gorostiza

This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…

Algebraic Geometry · Mathematics 2023-08-23 Phùng Hô Hai , João Pedro dos Santos , Pham Thanh Tâm

We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…

Logic · Mathematics 2026-05-13 Erik Walsberg

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

Logic · Mathematics 2018-04-26 Kameryn J Williams

We identify a canonical structure J associated to any first-order theory, the {\it space of definability patterns}. It generalizes the imaginary algebraic closure in a stable theory, and the hyperimaginary bounded closure in simple…

Logic · Mathematics 2022-01-12 Ehud Hrushovski

We consider a continual learning (CL) problem with two linear regression tasks in the fixed design setting, where the feature vectors are assumed fixed and the labels are assumed to be random variables. We consider an $\ell_2$-regularized…

Machine Learning · Computer Science 2024-06-19 Haoran Li , Jingfeng Wu , Vladimir Braverman

We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…

Logic · Mathematics 2020-08-12 Anton Freund

Let $c:\mathbb Z^2\to \{0, 1\}$ be a configuration with a non-trivial annihilator. We show that if $c$ is weakly periodic then the directions of periodicity in a minimal weakly periodic decomposition of $c$ can be detected from the…

Dynamical Systems · Mathematics 2021-09-29 Abhishek Khetan

In this paper we discuss what theory should be identified as the `analytic continuation' with $N \rightarrow -N$ of the ${\cal N}=2$ minimal model with the central charge $\hat{c} = 1 - \frac{2}{N}$. We clarify how the elliptic genus of the…

High Energy Physics - Theory · Physics 2014-05-07 Yuji Sugawara

This is the second installment of an exposition of an ACL2 formalization of finite group theory. The first, which was presented at the 2022 ACL2 workshop, covered groups and subgroups, cosets, normal subgroups, and quotient groups,…

Discrete Mathematics · Computer Science 2023-11-16 David M. Russinoff

Bj\"orner and Wachs introduced CL-shellability as a technique for studying the topological structure of order complexes of partially ordered sets (posets). They also introduced the notion of recursive atom ordering, and they proved that a…

Combinatorics · Mathematics 2024-08-23 Patricia Hersh , Grace Stadnyk
‹ Prev 1 2 3 10 Next ›