Related papers: Exact Unification and Admissibility
In the classification of real singularities by Arnold et al. (1985), normal forms, as representatives of equivalence classes under right equivalence, are not always uniquely determined. We describe the complete structure of the equivalence…
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type…
This article studies the compatibility of Koenig's notion of an exact Borel subalgebra of a quasi-hereditary or, more generally, standardly stratified algebra with taking idempotent subalgebras or quotients. As an application, we provide…
Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Description Logic $\mathcal{EL}$ to disunification since negative…
The paper is essentially a continuation of B.Plotkin, G.Zhitomirski, "Some logical invariants of algebras and logical relations between algebras", St.Peterburg Math. J., {19:5}, (2008) 859 -- 879, whose main notion is that of…
This paper studies finitely generated quasivarieties of Sugihara algebras. These quasivarieties provide complete algebraic semantics for certain propositional logics associated with the relevant logic R-mingle. The motivation for the paper…
Three classes of higher-order nonlinear parabolic hyperbolic, and nonlinear dispersion equations are shown to admit exact blow-up or compacton solutions, which are induced by elliptic equations with non-Lipschitz nonlinearities. Variational…
The purpose of this short and elementary note is to identify some classes of exact categories introduced in L. Previdi's thesis. Among other things we show: (1) An exact category is partially abelian exact if and only if it is abelian. (2)…
Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
We apply Voronoi's algorithm to compute representatives of the conjugacy classes of maximal finite subgroups of the unit group of a maximal order in some simple $\QQ $-algebra. This may be used to show in small cases that non-conjugate…
In this paper a review is given of a class of sub-models of both approaches, characterized by the fact that they can be solved exactly, highlighting in the process a number of generic results related to both the nature of pair-correlated…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving relations of arity greater than two. Quantifiers in this…
In this paper, the notion of unitary vertex operator superalgebra is introduced. It is proved that the vertex operator superalgebras associated to the unitary highest weight representations for the Neveu-Schwarz Lie superalgebra, Heisenberg…
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…
This paper provides a complete classification of the subvarieties and subquasivarieties of pointed Abelian lattice-ordered groups ($\ell$-groups) that are generated by their totally ordered members. We present two complementary approaches…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
In categorical realizability, it is common to construct categories of assemblies and categories of modest sets from applicative structures. These categories have structures corresponding to the structures of applicative structures. In the…
By arithmeticity and superrigidity, a commensurability class of lattices in a higher rank Lie group is defined by a unique algebraic group over a unique number subfield of $\mathbb{R}$ or $\mathbb{C}$. We prove an adelic version of…