Let $\cT$ be a monadic-second order class of finite trees, and let $\bT(x)$ be its (ordinary) generating function, with radius of convergence $ρ$. If $ρ\ge 1$ then $\cT$ has an explicit specification (without using recursion) in terms of the operations of union, sum, stack, and the multiset operators $(n)$ and $(\ge n)$. Using this, one has an explicit expression for $\bT(x)$ in terms of the initial functions $x$ and $x\cdot \big(1-x^n\big)^{-1}$, the operations of addition and multiplication, and the Pólya exponentiation operators $\sE_n, \sE_{\ge n}$. Let $\cF$ be a monadic-second order class of finite forests, and let $\bF(x)=\sum_n f(n) x^n$ be its (ordinary) generating function. Suppose $\cF$ is closed under extraction of component trees and sums of forests. Using the above-mentioned structure theory for the class $\cT$ of trees in $\cF$, Compton's theory of 0--1 laws, and a significantly strengthened version of 2003 results of Bell and Burris on generating functions, we show that $\cF$ has a monadic second-order 0--1 law iff the radius of convergence of $\bF(x)$ is 1 iff the radius of convergence of $\bT(x)$ is $\ge 1$.
Université Paris Cité(巴黎西岱大学);CNRS, IRIF(法国国家科学研究中心,IRIF);Centre d’Analyse et de Mathématique Sociales, CNRS/EHESS(分析与数学社会科学中心,CNRS/EHESS);Computer Science Institute of Charles University (IUUK)(查理大学计算机科学研究所)
Characterizations of monadically dependent tree-ordered weakly sparse structures
Université Paris Cité(巴黎西岱大学);CNRS(法国国家科学研究中心);IRIF(信息与随机研究所);Centre d'Analyse et de Mathématique Sociales CNRS UMR 8557(社会分析与数学中心);Southeast University(东南大学);Computer Science Institute of Charles University (IUUK)(查理大学计算机科学研究所);University of Bremen(不来梅大学)
A categorical equivalence for monadic algebras of first-order substructural logics motivated by Kalman's construction
School of Science, Xi’an Shiyou University(西安石油大学理学院);School of Science, Xi Hang University(西安航天大学理学院);CONICET and Departamento de Matematica, Facultad de Ciencias Exactas, Universidad Nacional del Centro de la Provincia de Buenos Aires(阿根廷布宜诺斯艾利斯省中部国立大学精确科学学院数学系与阿根廷国家科学研究委员会)
Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
CISPA Helmholtz Center for Information Security(CISPA赫尔姆霍兹信息安全中心);National University of Singapore(新加坡国立大学);University of Leipzig(莱比锡大学);ETH Zürich(苏黎世联邦理工学院);Charles University(查理大学);Eötvös Loránd University(罗兰大学)