Related papers: Weak MSO: Automata and Expressiveness Modulo Bisim…

This paper studies algorithmic meta theorems for property testing with \emph{constant running time} in the bounded degree model. In (Adler, Harwath 2018) it was shown that on graph classes $\mathcal C^{w}_d$ consisting of all graphs with…

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. Similar to well-known results for monadic second-order logic over trees,…

Deficiency in expressive power of the first-order logic has led to developing its numerous extensions by fixed point operators, such as Least Fixed-Point (LFP), inflationary fixed-point (IFP), partial fixed-point (PFP), etc. These logics…

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification…

In this paper, we investigate diagrams, namely functors from any small category to a fixed category, and more particularly, their bisimilarity. Initially defined using the theory of open maps of Joyal et al., we prove several equivalent…

We start by identifying a class of pseudo-differential operators, generated by the set of continuous negative definite functions, that are in the weak similarity (WS) orbit of the self-adjoint log-Bessel operator on the Euclidean space.…

The aim of this paper is to determine the logical and computational strength of instances of the Bolzano-Weierstra{\ss} principle (BW) and a weak variant of it. We show that BW is instance-wise equivalent to the weak K\"onig's lemma for…

We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral…

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

Let $\kappa,\lambda$ be regular cardinals, $\lambda\le\kappa$, let $\varphi$ be a sentence of the language $\mathcal L_{\kappa,\lambda}$ in a given signature, and let $\vartheta(\varphi)$ express the fact that $\varphi$ holds in a submodel,…

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,…

We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…

We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…

Automata over infinite alphabets have recently come to be studied extensively as potentially useful tools for solving problems in verification and database theory. One popular model of automata studied is the Class Memory Automata (CMA),…

We prove collective versions of semi-duality theorems for sets of almost (limitedly, order) L-weakly compact operators.

Let (M,\mu) be a sigma-finite measure space. Let (T_t) be a semigroup of positive preserving maps on (M,\mu) with standard assumptions. We prove a H_1-BMO duality theory with assumptions only on T_t. The BMO is defined as spaces of…

We develop abstract nonsense for module categories over monoidal categories (this is a straightforward categorification of modules over rings). As applications we show that any semisimple monoidal category with finitely many simple objects…

We obtain exhaustive results and treat in a unified way the question of boundedness, compactness, and weak compactness of composition operators from the Bloch space into any space from a large family of conformally invariant spaces that…

Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison $x<y$ and predicates for $x \equiv i \mod n$ has been investigated by Barrington, Compton,…