Related papers: Extensions and Limits of the Specker-Blatter Theor…
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…
The Splitter Theorem states that, if $N$ is a 3-connected proper minor of a 3-connected matroid $M$ such that, if $N$ is a wheel or whirl then $M$ has no larger wheel or whirl, respectively, then there is a sequence $M_0,..., M_n$ of…
A well-known theorem of Blackadar and Handelman states that every unital stably finite C*-algebra has a bounded quasitrace. Rather strong generalizations of stable finiteness to the non-unital case can be obtained by either requiring the…
In this paper, a spectral theorem is proved for self-adjoint cyclically compact partial integral operators in the space of functions with mixed norm, which is a Kaplansky--Hilbert module. The decomposition through eigenfunctions, integral…
A class of graph languages is definable in Monadic Second-Order logic (MSO) if and only if it consists of sets of models of MSO formul{\ae}. If, moreover, there is a computable bound on the tree-widths of the graphs in each such set, the…
We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…
Considering the deeper reasons of the appearance of a remarkable counterexample by J.~Kaad and M.~Skeide [17] we consider situations in which two Hilbert C*-modules $M \subset N$ with $M^\bot = \{ 0 \}$ over a fixed C*-algebra $A$ of…
A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…
By adapting Salomaa's complete proof system for equality of regular expressions under the language semantics, Milner (1984) formulated a sound proof system for bisimilarity of regular expressions under the process interpretation he…
Balogh, Bollob\'{a}s and Morris (2006) have described a threshold phenomenon in the behavior of the profile of hereditary classes of ordered graphs. In this paper, we give an other look at their result based on the notion of monomorphic…
In this paper the authors prove fundamental decomposition theorems pertaining to the internal structure of monoidal triangulated categories (M$\Delta$Cs). The tensor structure of an M$\Delta$C enables one to view these categories like…
We develop Spectral-Operator Calculus (SOC), an axiomatic calculus for scalar evaluation of operator-generated spectral observables. This paper (SOC-I) treats the self-adjoint setting, where observables are bounded Borel transforms and…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
By iterative techniques,we present two fixed point theorems, whose modular formulations are relatively close to the Banach's fixed point theorem in the normed spaces.The first result concerns the fixed point of the strongly contraction…
Mekler's construction gives an interpretation of any structure in a finite relational language in a group (nilpotent of class $2$ and exponent $p>2$, but not finitely generated in general). Even though this construction is not a…
The Constant Degree Hypothesis was introduced by Barrington et. al. (1990) to study some extensions of $q$-groups by nilpotent groups and the power of these groups in a certain computational model. In its simplest formulation, it…
Expansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of B\"uchi and Elgot & Rabin on the…
The famous Cantor-Bernstein-Schroder theorem (CBS-theorem for short) of set theory was generalized by Sikorski and Tarski to \sigma-complete Boolean algebras. After this, numerous generalizations of the CBS-theorem, extending the…