• No results found

equivalence relations

Aspects of Definability for Equivalence Relations

Aspects of Definability for Equivalence Relations

... After showing the positive answer follows from certain large cardinal principles, a natural question would be whether the negative answer to the main question holds in L or forcing extensions of L , only assuming mild ...

135

On Representing and Generating Kernels by Fuzzy Equivalence Relations

On Representing and Generating Kernels by Fuzzy Equivalence Relations

... Based on the semantics of fuzzy logic, this approach allows to incorporate knowledge-based models for the design of kernels. From this perspective, the most interesting mathematical question is how positive-semidefinite ...

18

MoL 2014 23: 
  Constructing Variants of the Category of Partial Equivalence Relations

MoL 2014 23: Constructing Variants of the Category of Partial Equivalence Relations

... an equivalence class of A is mapped entirely into an equivalence class of ...obtain equivalence classes [f] of relation preserving computable ...are equivalence classes of computable functions ...

34

Definability and Classification of Equivalence Relations and Logical Theories

Definability and Classification of Equivalence Relations and Logical Theories

... Borel equivalence relation E is said to be K - structurable if there is a Borel way to put a structure in K on each E-equivalence ...-structurable equivalence relations for various K , under ...

213

A Brief Survey on the two Different Approaches of Fundamental Equivalence Relations on Hyperstructures

A Brief Survey on the two Different Approaches of Fundamental Equivalence Relations on Hyperstructures

... Fundamental structures are the main tools in the study of hyperstructures. Fundamental equivalence relations link hyperstructure theory to the theory of corresponding classical structures. They also ...

14

Commuting Equivalence Relations and Scales on Differentiable Functions

Commuting Equivalence Relations and Scales on Differentiable Functions

... Since th e converse is clearly true , this gives a comp l ete characterization of countable Borel equivalence relations which contain a smooth aperiodic equiva l ence [r] ...

95

Amenability, Countable Equivalence Relations, and Their Full Groups

Amenability, Countable Equivalence Relations, and Their Full Groups

... between equivalence relations stronger than being non-isomorphic is the non-existence of countable-to-one homomorphisms from one of them to the ...countable equivalence relations are, in ...

97

The lattice of balanced equivalence relations of a coupled cell network

The lattice of balanced equivalence relations of a coupled cell network

... ‘balanced equivalence relation’, which depends solely on the network ...balanced equivalence relations on a network forms a lattice, in the sense of a partially ordered set in which any two elements ...

20

Definable Combinatorics of Graphs and Equivalence Relations

Definable Combinatorics of Graphs and Equivalence Relations

... 1 equivalence relations could be ...arbitrary equivalence relations as follows: Let E be an equivalence relation on a Polish space ...

98

Computable Reducibility of Equivalence Relations

Computable Reducibility of Equivalence Relations

... benchmark equivalence relations in Borel equivalence relation theory that can be ported down to the computable world by considering them restricted to indices for ...

82

Equivalence Relations Between Absolute Riezs And The Product of Two Absolute Riezs Summability Methods

Equivalence Relations Between Absolute Riezs And The Product of Two Absolute Riezs Summability Methods

... ( N r ~ ( N , p ) ( N , q ) . The object of this paper is to obtain results involving absolute methods | ( N , r ) | and | ( N , p ) ( N , q ) | analogous to those by the author [2; Theorems (3.1), (3.2) and (3.3)] , and ...

6

On the equivalence of GPD representations

On the equivalence of GPD representations

... Thus all but one equivalence relations depicted on the “commutative diagram” Fig. 1 have been con- structed explicitly. The dual parametrization approach is found to be completely equivalent to the ...

7

Volume 49: Bidirectional Transformations 2012

Volume 49: Bidirectional Transformations 2012

... principal equivalence relations on each set of ...its equivalence class in each of these relations, they function as a coordinate system for the model sets, with respect to the ...

17

CHARACTERIZATION OF  INTUITIONISTIC FUZZY TOPOLOGICAL D -ALGEBRAS.

CHARACTERIZATION OF INTUITIONISTIC FUZZY TOPOLOGICAL D -ALGEBRAS.

... d-algebras, equivalence relations on the family of all intuitionistic fuzzy d-algebras, and intuitionistic fuzzy topological d- algebras which are a generalization of the notion of fuzzy topological ...

7

Improving oral sentence production in children with cochlear implants: effects of equivalence-based instruction and matrix training

Improving oral sentence production in children with cochlear implants: effects of equivalence-based instruction and matrix training

... from equivalence relations that are formed (de Rose et ...Conditional relations between dictated words and pictures (AB) and between dictated words and printed words (AC word) were strengthened using ...

17

Intuitionistic fuzzy ideals of BCK algebras

Intuitionistic fuzzy ideals of BCK algebras

... Abstract. We consider the intuitionistic fuzzification of the concept of subalgebras and ideals in BCK-algebras, and investigate some of their properties. We introduce the notion of equivalence relations on ...

11

Green's Relations for Hypergroupoids

Green's Relations for Hypergroupoids

... For an hypergroupoid H, we denote by R the relation on H defined by aRb if a = b or there exist x, y ∈ H such that a ∈ b ◦ x and b ∈ a ◦ y and by L the relation on H defined by aLb if a = b or there exist x, y ∈ H such ...

14

The PER model of abstract non-interference

The PER model of abstract non-interference

... using equivalence relations to model ...since equivalence relations can be viewed as particular types of closures called partitioning closures [16], the definitions of narrow and abstract ...

17

MoL 2014 16: 
  Dynamic Epistemic Logic for Guessing Games and Cryptographic Protocols

MoL 2014 16: Dynamic Epistemic Logic for Guessing Games and Cryptographic Protocols

... An implementation of model checking for DEL with factual change via substitutions was done by Floor Sietsma in [Sie07]. It is also written in Haskell and based on the model checker DEMO by Jan van Eijck which was ...

100

Interplay between network topology and synchrony breaking bifurcation: homogeneous four cell coupled networks

Interplay between network topology and synchrony breaking bifurcation: homogeneous four cell coupled networks

... balanced equivalence relations (balanced colourings) for regular homogeneous networks with n cells (where all the cells have the same fixed number of input ...balanced equivalence relations is ...

300

Show all 9612 documents...

Related subjects