Equivalence relations and the contextual control of multiple derived stimulus functions

Author(s):  
William F. Perez ◽  
Sunna P. Azevedo ◽  
Cainã T. Gomes ◽  
Christian Vichi
2015 ◽  
Vol 103 (3) ◽  
pp. 511-523 ◽  
Author(s):  
William F. Perez ◽  
Adriana P. Fidalgo ◽  
Roberta Kovac ◽  
Yara C. Nico

1989 ◽  
Vol 51 (1) ◽  
pp. 29-45 ◽  
Author(s):  
Karen M. Bush ◽  
Murray Sidman ◽  
Tania de Rose

Author(s):  
Karen Feigh ◽  
Amy Pritchett ◽  
Tina Denq ◽  
Julie Jacko
Keyword(s):  

2019 ◽  
Vol 58 (3) ◽  
pp. 297-319
Author(s):  
N. A. Bazhenov ◽  
B. S. Kalmurzaev

Positivity ◽  
2020 ◽  
Vol 24 (5) ◽  
pp. 1503-1518
Author(s):  
Ismail Nikoufar ◽  
Maryam Fazlolahi

2021 ◽  
pp. 1-10
Author(s):  
Narjes Firouzkouhi ◽  
Abbas Amini ◽  
Chun Cheng ◽  
Mehdi Soleymani ◽  
Bijan Davvaz

Inspired by fuzzy hyperalgebras and fuzzy polynomial function (term function), some homomorphism properties of fundamental relation on fuzzy hyperalgebras are conveyed. The obtained relations of fuzzy hyperalgebra are utilized for certain applications, i.e., biological phenomena and genetics along with some elucidatory examples presenting various aspects of fuzzy hyperalgebras. Then, by considering the definition of identities (weak and strong) as a class of fuzzy polynomial function, the smallest equivalence relation (fundamental relation) is obtained which is an important tool for fuzzy hyperalgebraic systems. Through the characterization of these equivalence relations of a fuzzy hyperalgebra, we assign the smallest equivalence relation α i 1 i 2 ∗ on a fuzzy hyperalgebra via identities where the factor hyperalgebra is a universal algebra. We extend and improve the identities on fuzzy hyperalgebras and characterize the smallest equivalence relation α J ∗ on the set of strong identities.


1988 ◽  
Vol 11 (3) ◽  
pp. 241-265
Author(s):  
W. Marek ◽  
C. Rauszer

In this paper, we address the problem of query optimization in distributed databases. We show that horizontal partitions of databases, generated by products of equivalence relations, induce optimization techniques for the basic database operations (i.e., the selection, projection, and join operators). In the case of selection, our method allows for restriction of the number of blocks to be searched in the selection process and subsequent simplification of the selection formula at each block. For the natural join operation, we propose an algorithm that reduces the computation of fragments. Proofs of the correctness of our algorithms are also included.


Sign in / Sign up

Export Citation Format

Share Document