Related papers: Two Dichotomy Theorems
Describing systems in terms of choices and their resulting costs and rewards offers the promise of freeing algorithm designers and programmers from specifying how those choices should be made; in implementations, the choices can be realized…
We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We…
The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was not excluded that such a problem were undecidable, due to…
In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…
We take a new look at dilation theory for nonself-adjoint operator algebras. Among the extremal (co)extensions of a representation, there is a special property of being fully extremal. This allows a refinement of some of the classical…
We study a new extension of the weak MSO logic, talking about boundedness. Instead of a previously considered quantifier U, expressing the fact that there exist arbitrarily large finite sets satisfying a given property, we consider a…
We survey general properties of multiplicative arithmetic functions of several variables and related convolutions, including the Dirichlet convolution and the unitary convolution. We introduce and investigate a new convolution, called gcd…
In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic. The main features of the resulting logic, we call InqLTL, are the intuitionistic interpretation of implication and the Boolean semantics of…
Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…
We prove two (strong) undefinability results for logics based on inquisitive semantics (or its variant, team semantics). Namely: 1) we show the undefinability of intuitionistic implication in extended propositional inquisitive logic with…
The main result of this paper is a bi-parameter T(b) theorem for the case that b is a tensor product of two pseudo-accretive functions. In the proof, we also discuss the L^2 boundedness of different types of the b-adapted bi-parameter…
We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…
In this article, we consider tensor products of unitary representations by irreducible non-unitary finite dimensional representations of topological groups to define a property that is a twisting of Kazhdan's Property (T). We use the…
We introduce a generalization of the product expansion of a finite semigroup. As an application, we provide an alternative proof of the decidability of pointlike sets for pseudovarieties consisting of semigroups whose subgroups all belong…
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with…
In this work, we explore the notions unextendible product basis and uncompletability for operators which remain positive under partial transpose. Then, we analyze their connections to the ensembles which are many-copy indistinguishable…
This paper explores the space of (propositional) probabilistic logical languages, ranging from a purely `qualitative' comparative language to a highly `quantitative' language involving arbitrary polynomials over probability terms. While…
In this paper, ordinary and exponential dichotomies are defined in differential equations with equations with piecewise constant argument of general type. We prove the asymptotic equivalence between the bounded solutions of a linear system…
This paper proves the existence of nonmeasurable dense sets with additional properties using combinatorial techniques.
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraints, maximum number of occurrences of a variable in the…