Related papers: Fibered Universal Algebra for First-Order Logics
We discuss algebraic and representation theoretic structures in braided tensor categories C which obey certain finiteness conditions. Much interesting structure of such a category is encoded in a Hopf algebra H in C. In particular, the Hopf…
We generalize the tensor product theory for modules for a vertex operator algebra previously developed in a series of papers by the first two authors to suitable module categories for a ''conformal vertex algebra'' or even more generally,…
Several variations on the definition of a Formal Topology exist in the literature. They differ on how they express convergence, the formal property corresponding to the fact that open subsets are closed under finite intersections. We…
Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…
We use the ultrafilter-convergence axiomatics for topological spaces to motivate in detail a gentle categorical introduction, first to Barr's Set-based relational T-algebras, and then to Burroni's T-preorders internal to a category C, here…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
This is the first part in a series of papers in which we introduce and develop a natural, general tensor category theory for suitable module categories for a vertex (operator) algebra. This theory generalizes the tensor category theory for…
An $F$-zip over a scheme $S$ over a finite field is a certain object of semi-linear algebra consisting of a locally free module with a descending filtration and an ascending filtration and a $\Frob_q$-twisted isomorphism between the…
In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form $\forall x_0 \exists x_1 \dots \exists x_n \bigwedge x_i R_\lambda x_j$. We prove that many properties of these logics, such…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
Pursuing a generalization of group symmetries of modular categories to category symmetries in topological phases of matter, we study linear Hopf monads. The main goal is a generalization of extension and gauging group symmetries to category…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
We characterize the diagonalizable subalgebras of End(V), the full ring of linear operators on a vector space V over a field, in a manner that directly generalizes the classical theory of diagonalizable algebras of operators on a…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…
Operator systems connect operator algebra, free semialgebraic geometry and quantum information theory. In this work we generalize operator systems and many of their theorems. While positive semidefinite matrices form the underlying…
This paper presents a unified algebraic, topological, and logical framework for electrical one-port networks based on \v{S}are's $m$-theory. Within this formalism, networks are represented by $m$-words (jorbs) over an ordered alphabet,…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
We present a first-order logic equipped with an "asymmetric" directed notion of equality, which can be thought of as rewrites between terms, allowing for types to be interpreted as preorders. The logic is equipped with a precise syntactic…
It is well known that the classic {\L}o\'s-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential…