English
Related papers

Related papers: Comparing WO$(\omega^\omega)$ with $\Sigma^0_2$ in…

200 papers

A cyclic proof system, called CLKID-omega, gives us another way of representing inductive definitions and efficient proof search. The 2005 paper by Brotherston showed that the provability of CLKID-omega includes the provability of LKID,…

Logic in Computer Science · Computer Science 2023-06-22 Stefano Berardi , Makoto Tatsuta

This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal order problem in the Weyl algebra $W=\langle x,D|Dx-xD=1\rangle$. Any word $\omega\in W$ with $m$ $x$'s and $n$…

Combinatorics · Mathematics 2017-01-04 Sen-Peng Eu , Tung-Shan Fu , Yu-Chang Liang , Tsai-Lien Wong

We prove that, for any natural number n $\ge$ 1, we can find a finite alphabet $\Sigma$ and a finitary language L over $\Sigma$ accepted by a one-counter automaton, such that the $\omega$-power L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$…

Logic · Mathematics 2020-06-16 Olivier Finkel , Dominique Lecomte

We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega^2$, then its order type is effectively computable.

Formal Languages and Automata Theory · Computer Science 2019-09-19 Kitti Gelle , Szabolcs Iván

We show that Brown's lemma is equivalent to Sigma02-induction over RCA0* and that the finite version of Brown's lemma is provable in RCA0 but not in RCA0*.

Logic · Mathematics 2016-03-03 Emanuele Frittaion

Using the same heuristic argument leading to the Lang-Waldschmidt Conjecture in the theory of linear forms in logarithms, we formulate an effective version of the Linear Independence conjecture for the ordinates of the non-trivial zeros of…

Number Theory · Mathematics 2024-05-07 Youness Lamzouri

The Sigma formulas of the language of arithmetic express semidecidable relations on the natural numbers. More generally, whenever a totality of objects is regarded as incomplete, the Sigma formulas express relations that are witnessed in a…

Logic · Mathematics 2018-12-04 Andre Kornell

Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. Orthomodular logic is shown to be a nonlinear noncommutative logic. Sequents are given a physically motivated semantics that is consistent with…

Logic · Mathematics 2024-11-20 Andre Kornell

We give an alternative presentation of the ordinal notation at the strength of $\Pi^1_1-CA_0$ which allows the "uncountable" notation $\Omega$ to be interpreted "polymorphically" - that is, we allow the notation to be interpreted as…

Logic · Mathematics 2025-06-23 Henry Towsner

We introduce weak oddness $\omega_{\textrm w}$, a new measure of uncolourability of cubic graphs, defined as the least number of odd components in an even factor. For every bridgeless cubic graph $G$, $\rho(G)\le\omega_{\textrm…

Discrete Mathematics · Computer Science 2016-02-10 Robert Lukoťka , Ján Mazák

Expansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of B\"uchi and Elgot & Rabin on the…

Logic in Computer Science · Computer Science 2025-07-23 Joris Nieuwveld , Joël Ouaknine

We provide, for each natural number $n$ and each class among $D_n(\Sigma^0_1)$, $\bar D_n(\Sigma^0_1)$ and $D_{2n+1}(\Sigma^0_1)\oplus\bar D_{2n+1}(\Sigma^0_1)$, a regular language whose associated omega-power is complete for this class.

Logic in Computer Science · Computer Science 2024-07-16 Olivier Finkel , Dominique Lecomte

This article is concerned with the Axiom of Choice (AC) and the well-ordering theorem (WO) in second-order predicate logic with Henkin interpretation (HPL). We consider a principle of choice introduced by Wilhelm Ackermann (1935) and…

Logic · Mathematics 2024-10-08 Christine Gaßner

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

Given a special biserial algebra $\Lambda$ over an algebraically closed field, let $\mathrm{rad}_\Lambda$ denote the radical of its module category. The authors showed with Sinha that the stable rank of a special biserial algebra $\Lambda$,…

Representation Theory · Mathematics 2024-07-03 Suyash Srivastava , Amit Kuber

We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…

Logic · Mathematics 2010-10-01 Damir D. Dzhafarov , Carl Mummert

We reevaluate the claim that predicative reasoning (given the natural numbers) is limited by the Feferman-Schutte ordinal Gamma_0. First we comprehensively criticize the arguments that have been offered in support of this position. Then we…

Logic · Mathematics 2009-05-11 Nik Weaver

In this paper we use the second order equation $\frac{d^2 q}{dt^2} + (\lambda - \gamma q^2) \frac{d q}{dt} - q + q^3 = \mu q^2 \sin \omega t$ as a demonstrative example to illustrate how to apply the analysis of \cite{WO} and \cite{WOk} to…

Dynamical Systems · Mathematics 2008-02-29 Qiudong Wang

We consider context-free languages equipped with the lexicographic ordering. We show that when the lexicographic ordering of a context-free language is scattered, then its Hausdorff rank is less than $\omega^\omega$. As a corollary of this…

Formal Languages and Automata Theory · Computer Science 2015-03-19 Zoltan Esik , Szabolcs Ivan

This manuscript investigates the stochastic comparisons of the second-order statistics from dependent and heterogeneous general semi-parametric family of distributions observations. Some sufficient conditions on the usual stochastic order…

Statistics Theory · Mathematics 2024-07-29 Guoqiang Lv