Search arXiv⌕ Search

arXiv subjects

Sven Manthe

Publications and source records attributed to Sven Manthe.

5 recordsLinked to original sources

Automata for MSO over Infinite Trees with Quantification over Borel Sets of Branches

Rabin's Tree Theorem says that the MSO theory of the infinite binary tree $2^*$ is decidable. Shelah showed that MSO logic becomes undecidable if this tree is extended to $2^{\le ω}$, i.e. by allowing quantification over sets of infinite branches. A longstanding open problem is whether the decidability can be recovered in $2^{\le ω}$ by restricting set quantification to Borel sets. We make some progress in this direction, by identifying a suitable automaton model, and showing that most of the automata-theoretic approach to Rabin's Theorem can be extended to the new framework. The only missing part is a conjecture about finite-memory determinacy in certain games. This paper states and explores the conjecture. We prove it in some restricted cases, and give lower bounds on the memory required in those games.

cs.FL↗

The Borel monadic theory of order is decidable

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_σ$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof extends to larger classes of sets.

math.LO↗

A formalization of Borel determinacy in Lean

We present a formalization of Borel determinacy in the Lean 4 theorem prover. The formalization includes a definition of Gale-Stewart games and a proof of Martin's theorem stating that Borel games are determined. The proof closely follows Martin's "A purely inductive proof of Borel determinacy".

math.LO↗

A Cobham theorem for scalar multiplication

Let $α,β\in \mathbb{R}_{>0}$ be such that $α,β$ are quadratic and $\mathbb{Q}(α)\neq \mathbb{Q}(β)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto αx)$ and $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto βx)$ is already definable in $(\mathbb{R},{<},+,\mathbb{Z})$. As a consequence we generalize Cobham-Semenov theorems for sets of real numbers to $β$-numeration systems, where $β$ is a quadratic irrational.

math.LO↗

Generation of Local Unitary Groups

Let $E$ be a two-dimensional étale algebra over a non-Archimedean local field $K$ of characteristic zero. We show that the unitary group of a non-degenerate hermitian lattice over $E$ is generated by symmetries and rescaled Eichler isometries. In the appendix we show that unless $E/K$ is a ramified dyadic field extension and the residue field has two elements, symmetries suffice.

math.NT↗