This paper demonstrates the importance of relation equivalence for entity translation pair discovery. Existing approach of understanding relation equivalence has focused on using explicit features of cooccurring entities. In this paper, we explore latent features of temporality for understanding relation equivalence, and empirically show that the explicit and latent features complement each oth...

The purpose of this note is to show that the collection LF of finite volume hyperbolic 3-manifolds whose fundamental groups contain a subgroup that is locally free but not free is commensurably infinite. This result is stated formally as Theorem 4.1, and gives a strong answer to a question of Kropholler given in the Problem List in Niblo and Roller [19]. Recall that two hyperbolic 3-manifolds N...

The notion of data type speciication reenement is discussed in a setting of System F and the logic for parametric polymorphism of Plotkin and Abadi. At rst order, one gets a notion of speciication reenement up to observational equivalence in the logic simply by using Luo's formalism. This paper generalises this notion to abstract data types whose signatures contain higher-order and polymorphic ...

This paper is a contribution to the study of Borel equivalence relations on standard Borel spaces (i.e., Polish spaces equipped with their Borel structure). In mathematics one often deals with problems of classification of objects up to some notion of equivalence by invariants. Frequently these objects can be viewed as elements of a standard Borel space X and the equivalence turns out to be a B...

The Borel cardinality of the quotient of the power set of the natural numbers by the ideal Z0 of asymptotically zero-density sets is shown to be the same as that of the equivalence relation induced by the classical Banach space c0. We also show that a large collection of ideals introduced by Louveau and Veličkovič, with pairwise incomparable Borel cardinality, are all Borel reducible to c0. Thi...

A T-fuzzy equivalence relation is a fuzzy binary relation on a set X which is reflexive, symmetric and T-transitive for a t-norm T. Recently, Mesiar et al. [R. Mesiar, B. Reusch, H. Thiele, Fuzzy equivalence relations and fuzzy partitions, J. Multi-Valued Logic Soft Comput. 12 (2006) 167–181] have generalised the t-norm T to any general conjunctor C and investigated the minimal assumptions requ...

We present an efficient equivalence-checking algorithm for a propositional model of programs with semantics based on (what we call) progressive monoids on the finite set of statements generated by relations of a specific form. We consider arbitrary set of relations for commutativity (relations of the form ab = ba for statements a, b) and left absorption (relations of the form ab = b for stateme...

Estimating a constrained relation is a fundamental problem in machine learning. Special cases are classification (the problem of estimating a map from a set of to-be-classified elements to a set of labels), clustering (the problem of estimating an equivalence relation on a set) and ranking (the problem of estimating a linear order on a set). We contribute a family of probability measures on the...

A parametric logical relation between the phrases of an Algol-like language is presented. Its definition involves the structural operational semantics of the language, but was inspired by recent denotationally-based work of O’Hearn and Reynolds on translating Algol into a predicatively polymorphic linear lambda calculus. The logical relation yields an applicative characterisation of contextual ...

In this paper, we are going to introduce a fundamental relation on \(H_{v}BE\)-algebra and investigate some of properties, also construct new \((H_{v})BE\)-algebras via relation. We show that quotient any regular regulation is an quotient, strongly \(BE\)-algebra. Furthermore consider under what conditions relations transitive.