Related papers: Congruence Preservation, Lattices and Recognizabil…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
The property that a one to one function from the natural numbers to itself preserves the density of sub-sets is shown to be equivalent to a condition on the covering of intervals in the range of the function by images of intervals in the…
We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.
Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…
We show that the algebraic aspects of Lie symmetries and generalized symmetries in nonrelativistic and relativistic quantum mechanics can be preserved in linear lattice theories. The mathematical tool for symmetry preserving discretizations…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
The context of this work is that of partial frames; these are meet-semilattices where not all subsets need have joins. A selection function, S, specifies, for all meet-semilattices, certain subsets under consideration, which we call the…
In this paper, the definitions of algebras of quotients and Martandale-like qoutients of Leibniz algebras are introduced and the interactions between the two quotients are determined. Firstly, some important properties which not only hold…
We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras. Finally, we give a more…
We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…
It is shown how one can apply the classification of the holonomy algebras of Lorentzian manifolds to solve some problems. In particular, a new proof to the classification of Lorentzian manifolds with recurrent curvature tensor is given; the…
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…
(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…
In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…
We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…