Related papers: On the Monadic Second-Order Transduction Hierarchy
We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem…
The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…
In this paper we describe several characterizations of basic finite-dimensional $k$-algebras $A$ stratified for all linear orders, and classify their graded algebras as tensor algebras satisfying some extra property. We also discuss whether…
The structure of topological spaces is analysed here through the lenses of fibrous preorders. Each topological space has an associated fibrous preorder and those fibrous preorders which return a topological space are called spacial. A…
In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.
We study three different kinds of embeddings of tree patterns: weakly-injective, ancestor-preserving, and lca-preserving. While each of them is often referred to as injective embedding, they form a proper hierarchy and their computational…
Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
In our article "A tree of linearisable second-order evolution equations by generalised hodograph transformations" [J. Nonlin. Math. Phys. {\bf 8} (2001), 342-362] we presented a tree of linearisable (C-integrable) second-order evolution…
Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke…
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…
Human language understanding operates at multiple levels of granularity (e.g., words, phrases, and sentences) with increasing levels of abstraction that can be hierarchically combined. However, existing deep models with stacked layers do…
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
We introduce and study a notion of decomposition of planar point sets (or rather of their chirotopes) as trees decorated by smaller chirotopes. This decomposition is based on the concept of mutually avoiding sets (which we rephrase as…
The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…
This paper is devoted to the description of complex finite-dimensional algebras of level two. We obtain the classification of algebras of level two in the varieties of Jordan, Lie and associative algebras.