Related papers: Exact Unification

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

We look at explicit ways to bring one or two antiunitary symmetries into a standard form via unitary conjugation. We carefully reproduce Wigner's proof in two special cases, where the antiunitary operators square to $+I$, or to $-I$.…

We establish, generalizing Di Nola and Lettieri's categorical equivalence, a Morita-equivalence between the theory of lattice-ordered abelian groups and that of perfect MV-algebras. Further, after observing that the two theories are not…

We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…

Given a recollement of three proper dg algebras over a noetherian commutative ring, e.g. three algebras which are finitely generated over the base ring, which extends one step downwards, it is shown that there is a short exact sequence of…

We develop the theory of exact completions of regular $\infty$-categories, and show that the $\infty$-categorical exact completion (resp. hypercompletion) of an abelian category recovers the connective half of its bounded (resp. unbounded)…

We describe equivalence classes of exact indecomposable module categories over a finite graded tensor category. When applied to a pointed fusion category, our results coincide with the ones obtained in [S. Natale, On the equivalence of…

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…

We give an equivalence of categories between: (i) M\"obius vertex algebras which are equipped with a choice of generating family of quasiprimary vectors, and (ii) (not-necessarily-unitary) M\"obius-covariant Wightman conformal field…

Lie conformal algebras appear in the theory of vertex algebras. Their relation is similar to that of Lie algebras and their universal enveloping algebras. Associative conformal algebras play a role in conformal representation theory. We…

This paper contains a complete description of classes of the unitary equivalence of the admissible representations of infinite-dimensional classic matrix groups paper.

We introduce a wide class of countable groups, called properly proximal, which contains all non-amenable bi-exact groups, all non-elementary convergence groups, and all lattices in non-compact semi-simple Lie groups, but excludes all inner…

We present a sound and complete unification procedure for deterministic higher-order patterns, a class of simply-typed lambda terms introduced by Yokoyama et al. which comes with a deterministic matching problem. Our unification procedure…

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

We introduce a hierarchy of degree structures between the Medvedev and Muchnik lattices which allow varying amounts of non-uniformity. We use these structures to introduce the notion of the uniformity of a Muchnik reduction, which expresses…

We give a classification of all exact structures on a given idempotent complete additive category. Using this, we investigate the structure of an exact category with finitely many indecomposables. We show that the relation of the…

Data classification, the process of analyzing data and organizing it into categories, is a fundamental computing problem of natural and artificial information processing systems. Ideally, the performance of classifier models would be…