The aim of this study was to explore a behavior-analytic model of analogical reasoning, defined as the discrimination of formal similarity via equivalence-equivalence responding. In Experiment 1, adult humans were trained and tested for the formation of four three-member equivalence relations: A1-B1-C1, A2-B2-C2, A3-B3-C3, and A4-B4-C4. The B and C stimuli were three-letter nonsense syllables, ...

In this paper we study relations which are congruences with respect to ∧ and ⊔p, where ⊔pis the p-cut of the L-fuzzy hyperoperation ⊔. The main idea is to start from an equivalence relation R1 which is a congruence with respect to ∧ and ⊔1and, for each p ∈ X , construct an equivalence relation Rp which is a congruence with respect to ∧ and ⊔p. Furthermore, for each x ∈ Rp we construct a quotien...

The notion of local subgroupoid as a generalisation of a local equivalence relation was defined in a previous paper by the first two authors. Here we the notion of star path connectivity for a Lie groupoid to give an important new class of examples, generalising the local equivalence relation of a foliation, and develop in this new context basic properties of coherence, due earlier to Rosenthal...

The problems of object identification and data integration in heterogeneous multidatabase systems are addressed. The requirement that object identity be an equivalence relation often is not considered, and is shown to require evaluation of recursive queries against external schemas when translating even simple queries against integrated schemas. Data integration facilities which enforce the pro...

1. Group Actions (1.1) A group action of a group G acting on a set S is a map from G × S to S (written as g · s or g(s) for g ∈ G and s ∈ S) such that g1 · (g2 · s) = g1g2 · s and eG · s = s. If a group G is acting on a set S, we call S a G-set. Suppose S is a G-set. Define a relation s1 ∼ s2 ⇐⇒ s1 = g(s2) for some g ∈ G, then ∼ is an equivalence relation. (The equivalence classes are called or...

LP is a three-valued paraconsistent propositional logic which is essentially the same as J3. It has most properties that have been proposed as desirable properties of a reasonable paraconsistent propositional logic. However, it follows easily from already published results that there are exactly 8192 different three-valued paraconsistent propositional logics that have the properties concerned. ...

There are many use cases in business process management that require the comparison of behavioral models. For instance, verifying equivalence is the basis for assessing whether a technical workflow correctly implements a business process, or whether a process realization conforms to a reference process. This paper proposes an equivalence relation for models that describe behaviors based on the ...

In [2] Lakoff and Nuñez develop a basis for the cognitive science of embodied mathematics. For them, the abstract concepts and reasonings of mathematics are grounded in the conceptual processes that we develop in our interaction with the physical world. Through the use of conceptual metaphor these cognitive devices are projected to the realm of mathematical reasoning. In this paper we employ th...

Many problems have emerged while building accurate and efficient clusters of documents; such as the inherent problems of the similarity measure, and document logical view modeling. This research is an attempt to minimize the effect of these problems by using a new definition of transitive relevance between documents; i.e., adding more conditions on transitive relevance judgment through incremen...