English
Related papers

Related papers: Spectra of monadic second order sentences

200 papers

We give extensive characterizations for an open subset of an affine space of arbitrary dimension, resp. of an inverse limit of prime spectra to be quasi-compact. Among other things weak stability, retro-compactness, and cylinder sets…

Algebraic Geometry · Mathematics 2026-04-10 A. Bernhard Zeidler

We introduce and study weak o-minimality in the context of complete types in an arbitrary first-order theory. A type $p\in S(A)$ is weakly o-minimal if for some relatively $A$-definable linear order, $<$, on $p(\mathfrak{C})$ every…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

A word is quasiperiodic (or coverable) if it can be covered with occurrences of another finite word, called its quasiperiod. A word is multi-scale quasiperiodic (or multi-scale coverable) if it has infinitely many different quasiperiods.…

Discrete Mathematics · Computer Science 2015-06-30 Guilhem Gamard , Gwenaël Richomme

Suppose that lambda is the successor of a singular cardinal mu whose cofinality is an uncountable cardinal kappa. We give a sufficient condition that the club filter of lambda concentrating on the points of cofinality kappa is not…

Logic · Mathematics 2008-02-03 Mirna Džamonja , Saharon Shelah

Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…

Combinatorics · Mathematics 2026-04-08 Samuele Giraudo

In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…

Representation Theory · Mathematics 2020-06-26 Andrés Franco , Hernán Giraldo , Pedro Rizzo

We use set-theoretic tools to make a model-theoretic contribution. In particular, we construct a \emph{single} $\mathcal{L}_{\omega_1,\omega}$-sentence $\psi$ that codes Kurepa trees to prove the consistency of the following: (1) The…

Logic · Mathematics 2020-03-23 Dima Sinapova , Ioannis Souldatos

We say that a semigroup of matrices has a submultiplicative spectrum if the spectrum of the product of any two elements of the semigroup is contained in the product of the two spectra in question (as sets). In this note we explore an…

Representation Theory · Mathematics 2025-09-17 Mitja Mastnak , Lindsey McNamara , Zhipeng Yu

We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…

Logic · Mathematics 2022-09-15 Deacon Linkhorn

Defining the biperiodic Fibonacci words as a class of words over the alphabet $\{0,1\}$, and two specializations the $k-$Fibonacci and classical Fibonacci words, we provide a self-similar decomposition of these words into overlapping words…

Combinatorics · Mathematics 2022-05-12 Darby Bortz , Nicholas Cummings , Suyi Gao , Elias Jaffe , Lan Mai , Benjamin Steinhurst , Pauline Tillotson

As part of the author's studies on equational reasoning for monadic programs, this report focus on non-determinism monad. We discuss what properties this monad should satisfy, what additional operators and notations can be introduced to…

Programming Languages · Computer Science 2021-01-26 Shin-Cheng Mu

Given a Borel class of trees, we show that there is a tree in that class whose Scott sentence is not too much more complicated than the definition of the class. In particular, if the class is definable by a $\Pi_\alpha$ sentence, then there…

Logic · Mathematics 2026-02-23 Matthew Harrison-Trainor , J. Thomas Kim

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

Computational Complexity · Computer Science 2007-06-26 Nerio Borges , Blai Bonet

Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every cw-nontrivial monadic second-order (MSO) property is either NP-hard or coNP-hard over graphs given by succinct representations. Succint representations…

Computational Complexity · Computer Science 2026-01-14 Guilhem Gamard , Aliénor Goubault-Larrecq , Pierre Guillon , Pierre Ohlmann , Kévin Perrot , Guillaume Theyssier

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

Logic · Mathematics 2025-04-29 Pablo Andújar Guerrero

MSO transductions are binary relations between structures which are defined using monadic second-order logic. MSO transductions form a category, since they are closed under composition. We show that many notions from language theory, such…

Logic in Computer Science · Computer Science 2023-05-30 Mikołaj Bojańczyk

We study the spectral properties of ergodic Schr\"{o}dinger operators that are associated to a certain family of non-primitive substitutions on a binary alphabet. The corresponding subshifts provide examples of dynamical systems that go…

Mathematical Physics · Physics 2021-05-12 Benjamin Eichinger , Philipp Gohlke

Let $\A$ and $\B$ be unital Banach algebras and $\phi\colon\A\to\B$ be a unital continuous homomorphism. We prove that if $\phi$ is relatively spectral (i.e., there is a dense subalgebra $X$ of $\A$ such that $\sp_\B(\phi(a))=\sp_\A(a)$ for…

Operator Algebras · Mathematics 2010-05-17 Yifeng Xue

A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…

Combinatorics · Mathematics 2024-01-24 Susan Jowett , Dillon Mayhew , Songbao Mo , Christopher Tuffley