Related papers: Effective inseparability, lattices, and pre-orderi…
A well known fact is that there is a finite orthomodular lattice with an order determining set of states which is not representable in the standard quantum logic, the lattice $L({\mathcal H})$ of all closed subspaces of a separable complex…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
We link the recent theory of $L$-algebras to previous notions of Universal Algebra and Categorical Algebra concerning subtractive varieties, commutators, multiplicative lattices, and their spectra. We show that the category of $L$-algebras…
We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Synthetic experiments…
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…
Let $X$ be a Polish space, $d$ a pseudo-metric on $X$. If $\{(u,v):d(u,v)<\delta\}$ is ${\bf\Pi}^1_1$ for each $\delta>0$, we show that either $(X,d)$ is separable or there are $\delta>0$ and a perfect set $C\subseteq X$ such that…
Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…
Given an L_{\omega_1 \omega}-elementary class C, that is the collection of the countable models of some L_{\omega_1 \omega}-sentence, denote by \cong_C and \equiv_C the analytic equivalence relations of, respectively, isomorphism and…
We call a function constructible if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. For any $q > 0$ and…
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…
Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theory with emphasis on formal algebraic laws. New results…
In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Plo\v{s}\v{c}ica. The standard representations of complete ortholattices and complete perfect Heyting…
The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…
We show that every separable simple tracially approximately divisible $C^*$-algebra has strict comparison, is either purely infinite, or has stable rank one. As a consequence, we show that every (non-unital) finite simple ${\cal Z}$-stable…
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…
Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…
In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…