English
Related papers

Related papers: Monadic second order limit laws for natural well o…

200 papers

We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic and machine-independent…

Logic in Computer Science · Computer Science 2017-09-12 Nathanaël Fijalkow , Charles Paperman

Let $\cT$ be a monadic-second order class of finite trees, and let $\bT(x)$ be its (ordinary) generating function, with radius of convergence $\rho$. If $\rho \ge 1$ then $\cT$ has an explicit specification (without using recursion) in…

Logic · Mathematics 2010-04-08 Jason Bell , Stanley Burris , Karen Yeats

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

Logic in Computer Science · Computer Science 2015-07-01 Amélie Gheerbrant , Balder ten Cate

Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter…

Logic in Computer Science · Computer Science 2015-03-13 Stephan Kreutzer , Siamak Tazari

In arXiv:2508.14768, a variant of Goodstein's original process was recently introduced which, given a set $B\subseteq \mathbb{N}$ of bases, writes each $n\in\mathbb{N}$ in $B$-normal form, namely $n=b^ea+r$, where $b\in B$ the greatest base…

Logic · Mathematics 2026-03-23 David Fernández-Duque , Milan Morreel , Andreas Weiermann

We study sequential multiple testing with independent data streams, where the goal is to identify an unknown subset of signals while controlling commonly used error metrics, including generalized familywise rates and false discovery and…

Statistics Theory · Mathematics 2026-03-06 Jingyu Liu , Yanglei Song

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…

Logic · Mathematics 2014-02-10 Itaï Ben Yaacov , Arthur Paul Pedersen

Every new inner product in a Hilbert space is obtained from the original one by means of a unique positive operator$.$ The first part of the paper is a survey on applications of such a technique, including a characterization of similarity…

Functional Analysis · Mathematics 2020-10-29 C. S. Kubrusly , B. P. Duggal

We demonstrate a family of propositional formulas in conjunctive normal form so that a formula of size $N$ requires size $2^{\Omega(\sqrt[7]{N/logN})}$ to refute using the tree-like OBDD refutation system of Atserias, Kolaitis and Vardi…

Computational Complexity · Computer Science 2007-05-23 Nathan Segerlind

Consider a standard ${\Lambda }$-coalescent that comes down from infinity. Such a coalescent starts from a configuration consisting of infinitely many blocks at time $0$, but its number of blocks $N_t$ is a finite random variable at each…

Probability · Mathematics 2015-06-05 Vlada Limic , Anna Talarczyk

We consider extensions of monadic second order logic over $\omega$-words, which are obtained by adding one language that is not $\omega$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is…

Formal Languages and Automata Theory · Computer Science 2020-02-24 Mikołaj Bojańczyk , Edon Kelmendi , Rafał Stefański , Georg Zetzsche

We propose $\omega$MSO$\Join$BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that…

Logic in Computer Science · Computer Science 2023-11-27 Luisa Herrmann , Vincent Peth , Sebastian Rudolph

We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…

Logic in Computer Science · Computer Science 2008-03-20 Tobias Ganzow , Sasha Rubin

We prove that the Thue--Morse sequence $\mathbf t$ along subsequences indexed by $\lfloor n^c\rfloor$ is normal, where $1<c<3/2$. That is, for $c$ in this range and for each $\omega\in\{0,1\}^L$, where $L\geq 1$, the set of occurrences of…

Number Theory · Mathematics 2017-11-16 Clemens Müllner , Lukas Spiegelhofer

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…

Logic · Mathematics 2022-06-16 Fedor Pakhomov , James Walsh

We prove existence and up to the boundary regularity estimates in $L^{p}$ and H\"{o}lder spaces for weak solutions of the linear system $$ \delta \left( A d\omega \right) + B^{T}d\delta \left( B\omega \right) = \lambda B\omega + f \text{ in…

Analysis of PDEs · Mathematics 2025-04-02 Swarnendu Sil

In this paper, we study existential monadic second order (EMSO) properties of undirected graphs. In 2001, J.-M. Le Bars proved that there exists an EMSO sentence about undirected graphs such that the probability that it is true does not…

Combinatorics · Mathematics 2019-09-10 Maksim Zhukovskii

We characterize pairs of orthogonal countable ordinals. Two ordinals $\alpha$ and $\beta$ are orthogonal if there are two linear orders $A$ and $B$ on the same set $V$ with order types $\alpha$ and $\beta$ respectively such that the only…

Combinatorics · Mathematics 2014-07-04 Claude Laflamme , Maurice Pouzet , Nobert Sauer , Imed Zaguia

In arXiv:2208.12944 it is shown that an ordinal $\sup_{N<\omega}\psi_{\Omega_{1}}(\varepsilon_{\Omega_{\mathbb{S}+N}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\ell^{r}+(M\prec_{\Sigma_{1}}V)$. In this…

Logic · Mathematics 2022-11-17 Toshiyasu Arai