Related papers: Relational Lattice Foundation for Algebraic Logic
A new realization of the conformal algebra is studied which mimics the behaviour of a statistical system on a discrete albeit infinite lattice. The two-point function is found from the requirement that it transforms covariantly under this…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
The paper explores categorical interconnections between lattice-valued Relational systems and algebras of Fitting's lattice-valued modal logic. We define lattice-valued boolean systems, and then we study co-adjointness, adjointness of…
For a complete lattice $L$ and a relational structure $\mathfrak{X}=(X,(R_i)_I)$, we introduce the convolution algebra $L^{\mathfrak{X}}$. This algebra consists of the lattice $L^X$ equipped with an additional $n_i$-ary operation $f_i$ for…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…
Multi-adjoint logic programming is a general framework with interesting features, which involves other positive logic programming frameworks such as monotonic and residuated logic programming, generalized annotated logic programs, fuzzy…
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
For an arbitrary group, the subgroups form a lattice with order determined by set inclusion. Not every lattice is isomorphic to the subgroup lattice for a group. However, Birkhoff and Frink proved that any compactly generated lattice is…
For every univariate formula $\chi$ we introduce a lattices of intermediate theories: the lattice of $\chi$-logics. The key idea to define chi-logics is to interpret atomic propositions as fixpoints of the formula $\chi^2$, which can be…
We establish that the Lie algebra of weight one states in a (strongly) rational vertex operator algebra is reductive, and that its Lie rank is bounded above by the effective central charge. We show that lattice vertex operator algebras may…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
This paper discusses relational operations in the first-order logical environment {FOLE}. Here we demonstrate how FOLE expresses the relational operations of database theory in a clear and implementable representation. An analysis of the…
Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs…
In this paper it is shown that the lattice of C*-covers of an operator algebra does not contain enough information to distinguish operator algebras up to completely isometric isomorphism. In addition, four natural equivalences of the…
From algebraic geometry perspective database relations are succinctly defined as Finite Varieties. After establishing basic framework, we give analytic proof of Heath theorem from Database Dependency theory. Next, we leverage…
We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…