Related papers: Second order conservative languages with a Maltsev…

We introduce a subclass of the commutative regular languages that is characterized by the property that the state set of the minimal deterministic automaton can be written as a certain Cartesian product. This class behaves much better with…

Polynomial closure is a standard operator which is applied to a class of regular languages. In the paper, we investigate three restrictions called left (LPol), right (RPol) and mixed polynomial closure (MPol). The first two were known while…

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

By using a similar pattern of arguments, we show that in three categories the collection of isomorphisms forms a residual subset of the space of morphisms. We first consider surjective continuous mappings on Cantor spaces. Next, we look at…

Meet semidistributive varieties are in a sense the last of the most important classes in universal algebra for which it is unknown whether it can be characterized by a strong Maltsev condition. We present a new, relatively simple Maltsev…

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

In this article, we provide a new algorithm for solving constraint satisfaction problems with Maltsev constraints, based on the new notion of Maltsev consistency.

We study the extension of dependence logic D by a majority quantifier M over finite structures. We show that the resulting logic is equi-expressive with the extension of second-order logic by second-order majority quantifiers of all…

We analyse preference inference, through consistency, for general preference languages based on lexicographic models. We identify a property, which we call strong compositionality, that applies for many natural kinds of preference…

In this paper we consider a special class of polymorphisms with invariant measure, - (cf.[1])- the algebraic polymorphisms of compact groups. A general polymorphism is -- by definition -- a many-valued map with invariant measure, and the…

A known characterization for entire functions that preserve all nonnegative matrices of order two is shown to characterize polynomials that preserve nonnegative matrices of order two. Equivalent conditions are derived and used to prove that…

We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.

Though English sentences are typically inflexible vis-\`a-vis word order, constituents often show far more variability in ordering. One prominent theory presents the notion that constituent ordering is directly correlated with constituent…

We consider multidimensional systems of PDEs of generalized evolution form with t-derivatives of arbitrary order on the left-hand side and with the right-hand side dependent on lower order t-derivatives and arbitrary space derivatives. For…

Many classes of maps are characterized as (possibly multi-valued) maps preserving particular types of compact filters.

Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a…

We continue our investigation into hybrid polyadic multi-sorted logic with a focus on expresivity related to the operational and axiomatic semantics of rogramming languages, and relations with first-order logic. We identify a fragment of…

Arnol'd and Kochergin mixing conservative flows on surfaces stand as the main and almost only natural class of mixing transformations for which higher order mixing has not been established, nor disproved. Under suitable arithmetic…

We study the difference between internal categories and internal groupoids in terms of generalised Mal'tsev properties---the weak Mal'tsev property on the one hand, and $n$-permutability on the other. In the first part of the article we…

We consider two-variable first-order logic FO2 over infinite words. Restricting the number of nested negations defines an infinite hierarchy; its levels are often called the half-levels of the FO2 quantifier alternation hierarchy. For every…