English
Related papers

Related papers: Exact Unification

200 papers

We define the pattern fragment for higher-order unification problems in linear and affine type theory and give a deterministic unification algorithm that computes most general unifiers.

Logic in Computer Science · Computer Science 2010-09-16 Anders Schack-Nielsen , Carsten Schürmann

We introduce superequivalence and superuniform spaces.

Rings and Algebras · Mathematics 2018-11-06 William H. Rowan

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

Combinatorics · Mathematics 2024-09-04 Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

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…

Number Theory · Mathematics 2013-12-16 Renaud Coulangeon , Gabriele Nebe

The notion of unboundedly order converges has been recieved recently a particular attention by several authors. The main result of the present paper shows that the notion is efficient and deserves that care. It states that a vector lattice…

Functional Analysis · Mathematics 2017-10-10 Youssef Azouzi

We show that the polymodal provability logic GLP, in a language with at least two modalities and one variable, has nullary unification type. More specifically, we show that the formula [1]p does not have maximal unifiers, and exhibit an…

Logic · Mathematics 2024-04-09 Lev D. Beklemishev

We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…

Combinatorics · Mathematics 2018-11-20 Monique Laurent , Shin-ichi Tanigawa

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…

Algebraic Geometry · Mathematics 2016-01-18 Magdaleen S. Marais , Andreas Steenpass

The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies.…

Artificial Intelligence · Computer Science 2015-07-01 Franz Baader , Barbara Morawska

We consider a notion of exact sequences in any -not necessarily exact- pointed category relative to a given (E;M)-factorization structure. We apply this notion to introduce and investigate a new notion of exact sequences of semimodules over…

Category Theory · Mathematics 2011-11-03 Jawad Abuhlail

In the category \(\mathbf{V}\) of unital archimedean vector lattices, four notions of uniform completeness obtain. In all cases completeness requires the convergence of uniformly Cauchy sequences; the completions are distinguished by the…

Functional Analysis · Mathematics 2024-12-11 R. N. Ball , A. W. Hager

We characterize conjugacy classes of isometries of odd prime order in unimodular Z-lattices. This is applied to give a complete classification of odd prime order non-symplectic automorphisms of irreducible holomorphic symplectic manifolds…

Algebraic Geometry · Mathematics 2020-05-29 Simon Brandhorst , Alberto Cattaneo

The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient…

Artificial Intelligence · Computer Science 2025-07-18 Besik Dundua , Temur Kutsia

A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…

Logic · Mathematics 2021-07-13 T. Moraschini

We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give…

Logic · Mathematics 2021-04-19 Itay Kaplan , Nicholas Ramsey , Saharon Shelah

We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case…

Logic · Mathematics 2014-01-15 Miika Hannula

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…

Programming Languages · Computer Science 2010-12-16 Lunjin Lu

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Logic in Computer Science · Computer Science 2019-02-05 Stefan Milius , Henning Urbat

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

Group Theory · Mathematics 2022-06-23 Peter M Higgins , Marcel Jackson

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

Logic in Computer Science · Computer Science 2022-05-27 Eric Finster , David Reutter , Alex Rice , Jamie Vicary