An equality relation on the terms of the A-calculus is an equivalence relation closed under the (syntactical) operations of application and A-abstraction. We may distinguish between syntactic and semantic ways of introducing equality relations, /^-equality is introduced syntactically; it is the least equality relation satisfying the equations for aand ^-conversion. For a more subtle way of intr...

background: a key challenge for equality evaluation and monitoring, mainly in developing countries, is assessing socioeconomic status of individuals (ses). this difficulty along with low technical competency, have resulted in many health information collected in these countries to be devoid of suitable ses indices. however, simplifying data collection requirements for estimating economic parame...

In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is characterized algebraically by means of a natural concept of congruence; in any structure, it turns out to be the maximum congruence of the structure. We show that first-order logic without equality has two distinct complete s...

The definition of Standard ML provides a form of generic equality which is inferred for certain types, called equality types, on which it is possible to define an equality relation in ML. However, the standard definition is incomplete in the sense that there are interesting and useful types which are not inferred to be equality types but for which an equality relation can be defined in ML in a ...

Pseudo equality algebras were initially introduced by Jenei and Kóródi as a possible algebraic semantic for fuzzy type theory, and they have been revised by Dvurečenskij and Zahiri under the name of JK-algebras. The aim of this paper is to investigate the internal states and the state-morphisms on pseudo equality algebras. We define and study new classes of pseudo equality algebras, such as com...

Equality constraints (a.k.a. unification constraints) have widespread use in static program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow more accurate analyses and more expressive type systems. In this paper, we present a complete complexity characterization of the various entailmen...