相关论文: On two problems from "Hyperidentities and Clones"
Topologies $\tau , \sigma \in \mathop{{\mathrm{Top}}}\nolimits _X$ are bijectively related, in notation $\tau \sim \sigma$, if there are continuous bijections $f: (X, \tau )\rightarrow (X, \sigma )$ and $g: (X, \sigma)\rightarrow (X,…
We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the special linear group following recent…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky…
We determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic. We also consider two fragments of second-order HyperLTL that…
We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…
The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…
The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…
In standard first order predicate logic with identity it is usually taken that $a=a$ is a theorem for any term $a$. It is easily shown that this enables the apparent proof of a theorem stating the existence of any entity whatsoever. This…
This paper presents new results on the identities satisfied by the hypoplactic monoid. We show how to embed the hypoplactic monoid of any rank strictly greater than 2 (including infinite rank) into a direct product of copies of the…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…
In this paper, we consider an equivalence relation within the class of finitely presented discrete groups attending to their asymptotic topology rather than their asymptotic geometry. More precisely, we say that two finitely presented…
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…
In the paper we presnt a solution of problem 31 of chaptr 8 of the monograph of K. Denecke and S. L. Wismath: Hypridentities and clones, Gordon & Breach, 2000, by presnting two main theorems on hyperbasis for hypervarieties and…
We consider field theory side of new multiple Seiberg dualities conjectured within superconformal index matching approach. We study the case of SU(2) supersymmetric QCD and find that the numerous conjectured duals are different faces of…