English
Related papers

Related papers: Spectra of monadic second order sentences

200 papers

The meromorphic functional calculus developed in Part I overcomes the nondiagonalizability of linear operators that arises often in the temporal evolution of complex systems and is generic to the metadynamics of predicting their behavior.…

Chaotic Dynamics · Physics 2018-04-18 Paul M. Riechers , James P. Crutchfield

We investigate sentences which are simultaneously partially conservative over several theories. First, we generalize Bennet's results on this topic to the case of more than two theories. In particular, for any finite family $\{T_i\}_{i \leq…

Logic · Mathematics 2022-03-15 Taishi Kurahashi , Yuya Okawa , V. Yu. Shavrukov , Albert Visser

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Aehlig

We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…

Machine Learning · Computer Science 2024-07-29 Avrim Blum , Kavya Ravichandran

One of the fundamental properties of the Mandelbrot set is that the set of postcritically finite parameters is structured like a tree. We extend this result to the set of quadratic kneading sequences and show that this space contains no…

Dynamical Systems · Mathematics 2007-05-23 Alexandra Kaffl

We consider the exprissibility in monadic second order logic of certain relations of importance in computer science. For integers $n\geq 1$ and $k\leq b$, a $k$-tuple of sequences in $\{0,1,\ldots, b-1\}^n$ are said to be $k$-hashed if…

Logic · Mathematics 2025-09-17 Simone Costa , Marco Dalai , Stefano Della Fiore , Anita Pasotti

A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…

Combinatorics · Mathematics 2026-02-04 Iliyas Noman , Yuan Yao

We show that a non-wandering dynamical system with the shadowing property is either equicontinuous or has positive entropy and that in this context uniformly positive entropy is equivalent to weak mixing. We also show that weak mixing…

Dynamical Systems · Mathematics 2013-12-06 Jian Li , Piotr Oprocha

We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics. Our main contributions are presentation results for the monads,…

Logic in Computer Science · Computer Science 2021-04-22 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

We show that the character spectrum $Sp_\chi(\lambda)$, for a singular cardinal $\lambda$ of countable cofinality, may include any prescribed set of regular cardinals between $\lambda$ and $2^\lambda$.

Logic · Mathematics 2018-07-26 Shimon Garti , Menachem Magidor , Saharon Shelah

These notes give a brief introduction to the category of spectra as defined in stable homotopy theory. In particular, Section 5 discusses an extensive list of examples of spectra whose properties have been found to be interesting.

Algebraic Topology · Mathematics 2020-01-29 Neil Strickland

We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings,…

Discrete Mathematics · Computer Science 2013-03-07 Emmanuel Jeandel , Guillaume Theyssier

We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…

Combinatorics · Mathematics 2021-08-12 Eric Marberg

Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the finite and the infinite model theory of these sentences. We…

Logic in Computer Science · Computer Science 2007-12-04 Olivier Finkel

In this paper we study spectral sets which are unions of finitely many intervals in R. We show that any spectrum associated with such a spectral set is periodic, with the period an integral multiple of the measure of the set. As a…

Classical Analysis and ODEs · Mathematics 2010-04-13 Debashish Bose , Shobha Madan

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

We study discrete Schroedinger operators with analytic potentials. In particular, we are interested in the connection between the absolutely continuous spectrum in the almost periodic case and the spectra in the periodic case. We prove a…

Spectral Theory · Mathematics 2011-04-19 Mira Shamis

We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…

General Topology · Mathematics 2021-02-09 Paolo Lipparini

The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…

Formal Languages and Automata Theory · Computer Science 2019-05-09 Pablo Barcelo , Chih-Duo Hong , Xuan-Bach Le , Anthony W. Lin , Reino Niskanen