Related papers: A first-order completeness result about characteri…
Let $A$ be a residually finite dimensional algebra (not necessarily associative) over a field $k$. Suppose first that $k$ is algebraically closed. We show that if $A$ satisfies a homogeneous almost identity $Q$, then $A$ has an ideal of…
Autonomous systems require the management of several model views to assure properties such as safety and security among others. A crucial issue in autonomous systems design assurance is the notion of emergent behavior; we cannot use their…
We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the…
In a recent paper, Herbelin developed dPA${^\omega}$, a calculus in which constructive proofs for the axioms of countable and dependent choices could be derived via the memoization of choice functions. However, the property of normalization…
Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…
The paper is devoted studying solvable Leibniz algebras with a nilradical possessing the codimension equals the number of its generators. We describe this class in non-split nilradical case. Then the case of split nilradical is worked out.…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
In a perfect category every object has a minimal projective resolution. We give a criterion for the category of modules over a categorygraded algebra to be perfect.
Inclusion dependencies form one of the most widely used dependency classes. We extend existing results on the axiomatization and computational complexity of their implication problem to two extended variants. We present an alternative…
We consider a couple of versions of classical Kurosh problem (whether there is an infinite-dimensional algebraic algebra?) for varieties of linear multioperator algebras over a field. We show that, given an arbitrary signature, there is a…
We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…
We give a necessary and sufficient condition for an atomless Boolean algebra to be countably generated, and use it to give new proofs of some some know facts due to Gaifman-Hales and Solovay and also due to Jech, Kunen and Magidor. We also…
We prove that order convergence on a Boolean algebra turns it into a compact convergence space if and only if this Boolean algebra is complete and atomic. We also show that on an Archimedean vector lattice, order intervals are compact with…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
It is proved that, in certain subgroups of direct products of countable groups, the property of being an unconditionally closed set coincides with that of being an algebraic set. In particular, these properties coincide in all Abelian…
We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may…
A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…