Related papers: Effective inseparability, lattices, and pre-orderi…
In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
A classical theorem due to Mycielski states that an equivalence relation $E$ having the Baire property and meager equivalence classes must have a perfect set of pairwise inequivalent elements. We consider equivalence relations with…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…
We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presbuger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
In this paper using the connections between some subvarieties of residuated lattices, we investigated some properties of the lattice of ideals in commutative and unitary rings. We give new characterizations for commutative rings $A$ in…
It is hereby established that the set of Lipschitz functions $f:\mathcal{U}\rightarrow \mathbb{R}$ ($\mathcal{U}$ nonempty open subset of $\ell_{d}^{1}$) with maximal Clarke subdifferential contains a linear subspace of uncountable…
It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of ${\mathbb R}^n$ is undecidable for every integer $n\geq 2$. More generally, if $X$ is any definable set over a real or…
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
Let $\mathcal{W}(b)$ be a class of free Lie conformal algebras of rank $2$ with $\mathbb{C}[\partial]$-basis ${L,H}$ and relations \begin{eqnarray*} [L_\lambda L]=(\partial+2\lambda)L,\ \ [L_\lambda H]=\big(\partial+(1-b)\lambda\big)H, \ \…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
It is proved the existence of large algebraic structures \break --including large vector subspaces or infinitely generated free algebras-- inside, among others, the family of Lebesgue measurable functions that are surjective in a strong…
We present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $(B_0, \dots)$, let $B_1, B_2, \dots, B_K$ be sets that either intersect $B_0$ or…
An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…
We give a complete first-order axiomatization of the structure $(\mathbb{Z},+,(\ell^{\mathbb{N}})_{\ell\in L})$, where $L \subseteq \mathbb{Z}_{\ge 2}$ is a set of pairwise multiplicatively independent integers and $\ell^{\mathbb{N}} =…
The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…
A pre-order and equivalence relation on the class of positive real Hilbert space operators are introduced, in correspondence with similar relations for contraction operators defined by Yu.L. Shmul'yan in [7]. It is shown that the pre-order,…
Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…