Related papers: Congruence Preservation, Lattices and Recognizabil…
In this paper we generalize the well known relation between Heyting algebras and Nelson algebras in the framework of subresiduated lattices. In order to make it possible, we introduce the variety of subresiduated Nelson algebras. The main…
Every partial algebra is the colimit of its total subalgebras. We prove this result for partial Boolean algebras (including orthomodular lattices) and the new notion of partial C*-algebras (including noncommutative C*-algebras), and…
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…
We show that for fields that are of characteristic 0 or algebraically closed of characteristic greater than 5, that certain classes of Leibniz algebras are 2-recognizeable. These classes are solvable, strongly solvable and super solvable.…
We prove that each semialgebraic subset of $\R^n$ of positive codimension can be locally approximated of any order by means of an algebraic set of the same dimension. As a consequence of previous results, algebraic approximation preserving…
We present the algebra of assume-guarantee (AG) contracts. We define contracts, provide new as well as known operations, and show how these operations are related. Contracts are functorial: any Boolean algebra has an associated contract…
We characterize the order of principal congruences of a bounded lattice (also of a complete lattice and of a lattice of length 5) as a bounded ordered set. We also state a number of open problems in this new field.
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other.…
We employ the Poisson-Lie group of pseudo-difference operators to define lattice analogs of classical $W_m$-algebras. We then show that the so-constructed algebras coincide with the ones given by discrete Drinfeld-Sokolov type reduction.
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
Noether's theorem, which connects continuous symmetries to exact conservation laws, remains one of the most fundamental principles in physics and dynamical systems. In this work, we draw a conceptual parallel between two paradigms: the…
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…
Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…
We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a…
Three symbolic algorithms for testing the integrability of polynomial systems of partial differential and differential-difference equations are presented. The first algorithm is the well-known Painlev\'e test, which is applicable to…
We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…
We represent finite join-semilattices and join-preserving morphisms as a category whose objects and morphisms are binary relations. It is a quotient category of $\mathsf{Rel}_f$'s arrow category, where self-duality arises by taking the…
By arithmeticity and superrigidity, a commensurability class of lattices in a higher rank Lie group is defined by a unique algebraic group over a unique number subfield of $\mathbb{R}$ or $\mathbb{C}$. We prove an adelic version of…
We construct an analogue of the ring of algebraic numbers, living in a quotient of the product of all finite fields of prime order. We use this ring to deduce some results about linear recurrent sequences.
Morphisms, structure preserving maps, are everywhere in Mathematics as useful tools for thinking and problem solving, or as objects to study. Here, we argue that the idea of operations being compatible across two domains goes beyond its…