Related papers: Relational Lattice Axioms
Methods from algebra and algebraic geometry have been used in various ways to study linkages in kinematics. These methods have failed so far for the study of linkages with helical joints (joints with screw motion), because of the presence…
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…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
A lattice gauge theory with an action polynomial in independent field variables is considered. The link variables are described by unconstrained complex matrices instead of unitary ones. A mechanism which permits to switch off in the…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
Relational mechanics is a reformulation of mechanics (classical or quantum) for which space is relational. This means that the configuration of an $N$-particle system is a shape, which is what remains when the effects of rotations,…
A five-dimensional lattice space can be decomposed into a number of four-dimens ional lattices called as layers. The five-dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer with…
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…
In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…
We add commutativity to axioms defining mnesors and substitute a bitrop for the lattice. We show that it can be applied to relational database querying: set union, intersection and selection are redifined only from the mnesor addition and…
In this paper we continue the investigation of a real number object, i.e., an object representing the real numbers, in categories of relations. Our axiomatization is based on a relation algebraic version of Tarski's axioms of the real…
New criterion of regularity for representation of canonical commutation relations algebra is given on the basis of concept of an analytical vector.
Most of metric learning approaches are dedicated to be applied on data described by feature vectors, with some notable exceptions such as times series, trees or graphs. The objective of this paper is to propose a metric learning algorithm…
We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…
As the second part of the treatise 'A General Theory of Concept Lattice', this paper speaks of the tractability of the general concept lattice for both its lattice structure and logic content. The general concept lattice permits a feasible…
A new type of local-check additive quantum code is presented. Qubits are associated with edges of a 2-dimensional lattice whereas the stabilizer operators correspond to the faces and the vertices. The boundary of the lattice consists of…
We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given.…
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…
While a language assigns a value of either `yes' or `no' to each word, a lattice language assigns an element of a given lattice to each word. An advantage of lattice languages is that joins and meets of languages can be defined as…