Relevant bibliographies by topics / Equivalence relation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Equivalence relation'

Author: Grafiati
Published: 4 June 2021
Last updated: 17 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Equivalence relation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Equivalence relation"

1

DOUCHA, MICHAL. "Fσ EQUIVALENCE RELATIONS AND LAVER FORCING". Journal of Symbolic Logic 79, № 2 (2014): 644–53. http://dx.doi.org/10.1017/jsl.2013.32.

Full text
Abstract:
AbstractFollowing the topic of the book Canonical Ramsey Theory on Polish Spaces by V. Kanovei, M. Sabok, and J. Zapletal we study Borel equivalences on Laver trees. We prove that equivalence relations Borel reducible to an equivalence relation on 2ω given by some FσP-ideal on ω can be canonized to the full equivalence relation or to the identity relation.This has several consequences, e.g., Silver type dichotomy for the Laver ideal and equivalences Borel reducible to equivalence relations given by FσP-ideals.
APA, Harvard, Vancouver, ISO, and other styles
2

Marks, Andrew S. "Uniformity, universality, and computability theory." Journal of Mathematical Logic 17, no. 01 (2017): 1750003. http://dx.doi.org/10.1142/s0219061317500039.

Full text
Abstract:
We prove a number of results motivated by global questions of uniformity in computabi- lity theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened form of a countable Borel equivalence relation being universal, which we conjecture is equivalent to the usual notion. With this additional uniformity hypothesis, we can answer many questions concerning how countable groups, probability measures, the subset relation, and increasing unions interact with universality. For many natural classes of countable Borel equivalence relations, we can also classify exactly which are uniformly universal. We also show the existence of refinements of Martin’s ultrafilter on Turing invariant Borel sets to the invariant Borel sets of equivalence relations that are much finer than Turing equivalence. For example, we construct such an ultrafilter for the orbit equivalence relation of the shift action of the free group on countably many generators. These ultrafilters imply a number of structural properties for these equivalence relations.
APA, Harvard, Vancouver, ISO, and other styles
3

Molberg, Mats. "AF-equivalence relations." MATHEMATICA SCANDINAVICA 99, no. 2 (2006): 247. http://dx.doi.org/10.7146/math.scand.a-15011.

Full text
Abstract:
Let $R=\lim\limits_{\longrightarrow}R_{n}$ be the inductive limit of an ascending sequence of étale finite equivalence relations $R_n$ on the zero-dimensional space $X$. We prove that $R$ is an AF-equivalence relation.
APA, Harvard, Vancouver, ISO, and other styles
4

Solecki, Sławomir. "Actions of non-compact and non-locally compact Polish groups." Journal of Symbolic Logic 65, no. 4 (2000): 1881–94. http://dx.doi.org/10.2307/2695084.

Full text
Abstract:
AbstractWe show that each non-compact Polish group admits a continuous action on a Polish space with non-smooth orbit equivalence relation. We actually construct a free such action. Thus for a Polish group compactness is equivalent to all continuous free actions of this group being smooth. This answers a question of Kechris. We also establish results relating local compactness of the group with its inability to induce orbit equivalence relations not reducible to countable Borel equivalence relations. Generalizing a result of Hjorth, we prove that each non-locally compact, that is, infinite dimensional, separable Banach space has a continuous action on a Polish space with non-Borel orbit equivalence relation, thus showing that this property characterizes non-local compactness among Banach spaces.
APA, Harvard, Vancouver, ISO, and other styles
5

Friedman, Sy-David, and Luca Motto Ros. "Analytic equivalence relations and bi-embeddability." Journal of Symbolic Logic 76, no. 1 (2011): 243–66. http://dx.doi.org/10.2178/jsl/1294170999.

Full text
Abstract:
AbstractLouveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of ) is far from complete (see [5, 2]).In this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of , but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids.
APA, Harvard, Vancouver, ISO, and other styles
6

Munteanu, Radu-Bogdan. "On Constructing Ergodic Hyperfinite Equivalence Relations of Non-Product Type." Canadian Mathematical Bulletin 56, no. 1 (2013): 136–47. http://dx.doi.org/10.4153/cmb-2011-132-4.

Full text
Abstract:
AbstractProduct type equivalence relations are hyperfinitemeasured equivalence relations, which, up to orbit equivalence, are generated by product type odometer actions. We give a concrete example of a hyperfinite equivalence relation of non-product type, which is the tail equivalence on a Bratteli diagram. In order to show that the equivalence relation constructed is not of product type we will use a criterion called property A. This property, introduced by Krieger for non-singular transformations, is defined directly for hyperfinite equivalence relations in this paper.
APA, Harvard, Vancouver, ISO, and other styles
7

Carroll, Jeffrey S. "Maximal r.e. equivalence relations." Journal of Symbolic Logic 55, no. 3 (1990): 1048–58. http://dx.doi.org/10.2307/2274473.

Full text
Abstract:
AbstractThe lattice of r.e. equivalence relations has not been carefully examined even though r.e. equivalence relations have proved useful in logic. A maximal r.e. equivalence relation has the expected lattice theoretic definition. It is proved that, in every pair of r.e. nonrecursive Turing degrees, there exist maximal r.e. equivalence relations which intersect trivially. This is, so far, unique among r.e. submodel lattices.
APA, Harvard, Vancouver, ISO, and other styles
8

Rosendal, Christian. "Cofinal families of Borel equivalence relations and quasiorders." Journal of Symbolic Logic 70, no. 4 (2005): 1325–40. http://dx.doi.org/10.2178/jsl/1129642127.

Full text
Abstract:
AbstractFamilies of Borel equivalence relations and quasiorders that are cofinal with respect to the Borel reducibility ordering. ≤B, are constructed. There is an analytic ideal on ω generating a complete analytic equivalence relation and any Borel equivalence relation reduces to one generated by a Borel ideal. Several Borel equivalence relations, among them Lipschitz isomorphism of compact metric spaces, are shown to be Kσ complete.
APA, Harvard, Vancouver, ISO, and other styles
9

Mingyi, Zhang, Li Danning, and Zhang Ying. "An Approach to Generation of Decision Rules." JUCS - Journal of Universal Computer Science 16, no. (1) (2010): 140–58. https://doi.org/10.3217/jucs-016-01-0140.

Full text
Abstract:
Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of objects in a given domain. When making decision, anything that can be spoken about in the subject position of a natural sentence is an object, properties of which are fundamental elements of the knowledge of the given domain. This gives the possibility of representing the concept related to a given domain. In general, the information about a set of the objects is uncertain or incomplete. Various approaches representing uncertainty of a concept were proposed. In particular, Zadeh?s fuzzy set theory and Pawlak?s rough set theory have been most influential on this research field. Zadeh characterizes uncertainty of a concept by introducing a membership function and a similarity (fuzzy equivalence) relation of a set of objects. Pawlak then characterizes uncertainty of a concept by union of some equivalence classes of an equivalence relation. As one of particular important and widely used binary relations, equivalence relation plays a fundamental role in classification, clustering, pattern recognition, polling, automata, learning, control inference and natural language understanding, etc. An equivalence relation is a binary relation with reflexivity, symmetry and transitivity. However, in many real situations, it is not sufficient to consider equivalence relations only. In fact, a lot of relations determined by the attributes of objects do not satisfy transitivity. In particular, information obtained from a domain of objects is not transitive, when we make decision based on properties of objects. Moreover, the information about symmetry of a relation is mostly uncertain. So, it is needed to approximately make decision and reasoning by indistinct concepts. This provokes us to explore a new class of relations, so-called class of fuzzy semi-equivalence relations. In this paper we introduce the notion of fuzzy semi-equivalence relations and study its properties. In particular, a constructive method of fuzzy semi-equivalence classes is presented. Applying it we present approaches to the fuzzyfication of indistinct concepts approximated by fuzzy relative and semi-equivalence classes, respectively. And an application of the fuzzy semi-equivalence relation theory to generate decision rules is outlined.
APA, Harvard, Vancouver, ISO, and other styles
10

Gupta, K. C., and R. K. Gupta. "Fuzzy equivalence relation redefined." Fuzzy Sets and Systems 79, no. 2 (1996): 227–33. http://dx.doi.org/10.1016/0165-0114(95)00155-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Equivalence relation"

1

Garcia, Anna Rosio. "Relating Relations: The Impact of Equivalence-Equivalence Training on Analogical Reasoning." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5372.

Full text
Abstract:
A well-researched line showing equivalence performances in a wide variety of areas has been conducted in the field of Behavior Analysis (BA). One area demonstrates that relating relations is a behavioral account of analogical thinking. Relating relations may have implications for the development of analogical training given that analogical reasoning is seen as the foundation of intelligence yet research in this area is limited. A protocol by Stewart, Barnes-Holmes, and Weil (2009) was developed to train children in analogical reasoning using equivalence-equivalence relations. The purpose of this study was to evaluate an equivalence-equivalence training protocol based on Stewart et al. (2009) and test whether the protocol was effective in training equivalence-equivalence responding to 7 and 8-year-old children. A secondary purpose was to test whether training in equivalence-equivalence responding increased performances on analogical tests. All five participants were dismissed throughout the study. Participant 1 was dismissed during the pre-assessments and all other participants were dismissed during intervention. Because none of the participants passed the equivalence-equivalence training, increases in performance in analogical testes were not analyzed. Individual performance data from training are examined and analyzed to provide an account of the failures to pass the equivalence-equivalence protocol.
APA, Harvard, Vancouver, ISO, and other styles
2

Cotton, Michael R. "Abelian Group Actions and Hypersmooth Equivalence Relations." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1505289/.

Full text
Abstract:
We show that any Borel action on a standard Borel space of a group which is topologically isomorphic to the sum of a countable abelian group with a countable sum of lines and circles induces an orbit equivalence relation which is hypersmooth. We also show that any Borel action of a second countable locally compact abelian group on a standard Borel space induces an orbit equivalence relation which is essentially hyperfinite, generalizing a result of Gao and Jackson for the countable abelian groups.
APA, Harvard, Vancouver, ISO, and other styles
3

Jaber, Guilhem. "A logical study of program equivalence." Thesis, Nantes, Ecole des Mines, 2014. http://www.theses.fr/2014EMNA0124/document.

Full text
Abstract:
Prouver l’équivalence de programmes écrits dans un langage fonctionnel avec références est un problème notoirement difficile. L’objectif de cette thèse est de proposer un système logique dans lequel de telles preuves peuvent être formalisées, et dans certains cas inférées automatiquement. Dans la première partie, une méthode générique d’extension de la théorie des types dépendants est proposée, basée sur une interprétation du forcing vu comme une traduction de préfaisceaux de la théorie des types. Cette extension dote la théorie des types de constructions récursives gardées, qui sont utilisées ensuite pour raisonner sur les références d’ordre supérieure. Dans une deuxième partie, nous définissons une sémantique des jeux nominale opérationnelle pour un langage avec références d’ordre supérieur. Elle marie la structure catégorique de la sémantique des jeux avec une représentation sous forme de traces de la dénotation des programmes, qui se calcule de manière opérationnelle et dispose donc de bonnes propriétés de modularité. Cette sémantique nous permet ensuite de prouver la complétude de relations logiques à la Kripke définit de manière directe, via l’utilisation de types récursifs gardés, sans utilisation de la biorthogonalité. Une telle définition directe nécessite l’utilisation de mondes omniscient et un contrôle fin des locations divulguées. Finalement, nous introduisons une logique temporelle qui donne un cadre pour définir ces relations logiques à la Kripke. Nous ramenons alors le problème de l’équivalence contextuelle à la satisfiabilité d’une formule de cette logique générée automatique, c’est à dire à l’existence d’un monde validant cette formule. Sous certaines conditions, cette satisfiabilité peut être décidée via l’utilisation d’un solveur SMT. La complétude de notre méthode devrait permettre d’obtenir des résultats de décidabilité pour l’équivalence contextuelle de certains fragment du langage considéré, en fournissant un algorithme pour construire de tels mondes<br>Proving program equivalence for a functional language with references is a notoriously difficult problem. The goal of this thesis is to propose a logical system in which such proofs can be formalized, and in some cases inferred automatically. In the first part, a generic extension method of dependent type theory is proposed, based on a forcing interpretation seen as a presheaf translation of type theory. This extension equips type theory with guarded recursive constructions, which are subsequently used to reason on higher-order references. In the second part, we define a nominal game semantics for a language with higher-order references. It marries the categorical structure of game semantics with a trace representation of denotations of programs, which can be computed operationally and thus have good modularity properties. Using this semantics, we can prove the completeness of Kripke logical relations defined in a direct way, using guarded recursive types, without using biorthogonality. Such a direct definition requires omniscient worlds and a fine control of disclosed locations. Finally, we introduce a temporal logic which gives a framework to define these Kripke logical relations. The problem of contextual equivalence is then reduced to the satisfiability of an automatically generated formula defined in this logic, i.e. to the existence of a world validating this formula. Under some conditions, this satisfiability can be decided using a SMT solver. Completeness of our methods opens the possibility of getting decidability results of contextual equivalence for some fragments of the language, by giving an algorithm to build such worlds
APA, Harvard, Vancouver, ISO, and other styles
4

Hartman, Carrie. "On the Relation between Stimulus Equivalence and Extension of Stimulus Function." Thesis, University of North Texas, 2004. https://digital.library.unt.edu/ark:/67531/metadc4462/.

Full text
Abstract:
The purpose of this study was to examine the relation between stimulus equivalence (briefly, networks of relations among stimuli) and the extension of stimulus function (briefly, spread of effect across network) more closely than has been possible before. The traditional view of this relation suggests that equivalence classes mediate the extension of stimulus function and are, therefore, necessary for any extension to occur. This study used a preparation in which the conditional discriminations required for the development of equivalence classes and the simple discriminations required for the extension of function were trained or tested simultaneously. Results suggest that equivalence are not necessary for the extension of stimulus function though they may be sufficient.
APA, Harvard, Vancouver, ISO, and other styles
5

Minami, Kazuhiko. "The free energies of six-vertex models and the n-equivalence relation." American Institite of Physics, 2008. http://hdl.handle.net/2237/12026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Swisher, Melissa J. "Determining the Relation Between the Moments of Acquisition of Baseline Conditional Discriminations and the Emergence of Equivalence Relations." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc30515/.

Full text
Abstract:
The experiment was an attempt to gain a more precise understanding of the temporal relation between the development of analytic units and equivalence relations. Two prompting procedures were used during training to pinpoint when eight subjects learned the conditional discriminations. Near simultaneous presentation of probe and training trials allowed for examination of the temporal relation between conditional discrimination acquisition and derived performances on stimulus equivalence probes. The data show that, for seven of eight subjects, a decreased reliance on prompts was coincident with the development of equivalence-consistent choices on either all or some probe trials, which suggests that the development of analytic units is sufficient to give rise to equivalence relations among stimuli.
APA, Harvard, Vancouver, ISO, and other styles
7

Katsumata, Shin-ya. "A generalisation of pre-logical predicates and its applications." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/850.

Full text
Abstract:
This thesis proposes a generalisation of pre-logical predicates to simply typed formal systems and their categorical models. We analyse the three elements involved in pre-logical predicates -- syntax, semantics and predicates -- within a categorical framework for typed binding syntax and semantics. We then formulate generalised pre-logical predicates and show two distinguishing properties: a) equivalence with the basic lemma and b) closure of binary pre-logical relations under relational composition. To test the adequacy of this generalisation, we derive pre-logical predicates for various calculi and their categorical models including variations of lambda calculi and non-lambda calculi such as many-sorted algebras as well as first-order logic. We then apply generalised pre-logical predicates to characterising behavioural equivalence. Examples of constructive data refinement of typed formal systems are shown, where behavioural equivalence plays a crucial role in achieving data abstraction.
APA, Harvard, Vancouver, ISO, and other styles
8

Garcia, Ian. "Eliminating Redundant and Less-informative RSS News Articles Based on Word Similarity and A Fuzzy Equivalence Relation." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1688.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jiang, Wen. "Simulations of Indentation at Continuum and Atomic levels." Diss., Virginia Tech, 2008. http://hdl.handle.net/10919/26350.

Full text
Abstract:
The main goal of this work is to determine values of elastic constants of orthotropic, transversely isotropic and cubic materials through indentation tests on thin layers bonded to rigid substrates. Accordingly, we first use the Stroh formalism to provide an analytical solution for generalized plane strain deformations of a linear elastic anisotropic layer bonded to a rigid substrate, and indented by a rigid cylindrical indenter. The mixed boundary-value problem is challenging since the deformed indented surface of the layer contacting the rigid cylinder is unknown a priori, and is to be determined as a part of the solution of the problem. For a rigid parabolic prismatic indenter contacting either an isotropic layer or an orthotropic layer, the computed solution is found to compare well with solutions available in the literature. Parametric studies have been conducted to delimit the length and the thickness of the layer for which the derived relation between the axial load and the indentation depth is valid. We then derive an expression relating the axial load, the indentation depth, and the elastic constants of an orthotropic material. This relation is specialized to a cubic material (e.g., an FCC single crystal). By using results of three virtual (i.e., numerical) indentation tests on the same specimen oriented differently, we compute values of the elastic moduli, and show that they agree well with their expected values. The technique can be extended to other anisotropic materials. We review the literature on relations between deformations at the atomic level and stresses and strains defined at the continuum level. These are then used to compare stress and strain distributions in mechanical tests performed on atomic systems and their equivalent continuum structures. Whereas averaged stresses and strains defined in terms of the overall deformations of the atomic system match well with those derived from the continuum description of the body, their local spatial distributions differ.<br>Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
10

Knepper, Ross A. "On the Fundamental Relationships Among Path Planning Alternatives." Research Showcase @ CMU, 2011. http://repository.cmu.edu/dissertations/180.

Full text
Abstract:
Robotic motion planning aspires to match the ease and efficiency with which humans move through and interact with their environment. Yet state of the art robotic planners fall short of human abilities; they are slower in computation, and the results are often of lower quality. One stumbling block in traditional motion planning is that points and paths are often considered in isolation. Many planners fail to recognize that substantial shared information exists among path alternatives. Exploitation of the geometric and topological relationships among path alternatives can therefore lead to increased efficiency and competency. These benefits include: better-informed path sampling, dramatically faster collision checking, and a deeper understanding of the trade-offs in path selection. In path sampling, the principle of locality is introduced as a basis for constructing an adaptive, probabilistic, geometric model to influence the selection of paths for collision test. Recognizing that collision testing consumes a sizable majority of planning time and that only collision-free paths provide value in selecting a path to execute on the robot, this model provides a significant increase in efficiency by circumventing collision testing paths that can be predicted to collide with obstacles. In the area of collision testing, an equivalence relation termed local path equivalence, is employed to discover when the work of testing a path has been previously performed. The swept volumes of adjoining path alternatives frequently overlap, implying that a continuum of intermediate paths exists as well. By recognizing such neighboring paths with related shapes and outcomes, up to 90% of paths may be tested implicitly in experiments, bypassing the traditional, expensive collision test and delivering a net 300% boost in collision test performance. Local path equivalence may also be applied to the path selection problem in order to recognize higher-level navigation options and make smarter choices. This thesis presents theoretical and experimental results in each of these three areas, as well as inspiration on the connections to how humans reason about moving through spaces.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Equivalence relation"

1

O'Carroll, Noreen. The equivalence of symbolic forms: A study of Eric Voegelin's theory of the relation of experiential equivalence between symbolic forms. University College, Dublin, The National University of Ireland, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hjorth, Greg. Classification and orbit equivalence relations. American Mathematical Society, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kechris, A. S. Topics in orbit equivalence. Springer, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pearce, David A. Translation, reduction and equivalence: Some topics in intertheory relations. P. Lang, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Staunton, Marion B. Human sexual categorisation, stimulus equivalence and relational frame theory. The Author], 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Crozier, Kimberley J. Effects of associative distance on emergent relations in coin equivalence training. National Library of Canada = Bibliothèque nationale du Canada, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Moxon, Peter D. Complex stimulus control by emergent stimulus relations: Implications for functional equivalence. The author], 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Fulman, Igor. Crossed products of von Neumann algebras by equivalence relations and their subalgebras. American Mathematical Society, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hjorth, Greg. Rigidity theorems for actions of product groups and countable Borel equivalence relations. American Mathematical Society, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ballester, Jorge Correa. El impuesto del equivalente y la ciudad de Valencia (1707-1740). Generalitat Valenciana, Conselleria d'Economia i Hisenda, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Equivalence relation"

1

Givant, Steven, and Hajnal Andréka. "Equivalence Semiproducts." In Simple Relation Algebras. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67696-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kanovei, Vladimir. "Ideal ℐ₁ and the equivalence relation 𝖤₁." In Borel Equivalence Relations. American Mathematical Society, 2008. http://dx.doi.org/10.1090/ulect/044/12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kanovei, Vladimir. "The ideal ℐ₃ and the equivalence relation 𝖤₃." In Borel Equivalence Relations. American Mathematical Society, 2008. http://dx.doi.org/10.1090/ulect/044/15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

André, Robert. "Equipotence as an equivalence relation." In Set Theory. Chapman and Hall/CRC, 2025. https://doi.org/10.1201/9781003586395-26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Xi, Nanhua. "An equivalence relation in T × ℂ*." In Lecture Notes in Mathematics. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0074136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Knepper, Ross A., Siddhartha S. Srinivasa, and Matthew T. Mason. "An Equivalence Relation for Local Path Sets." In Springer Tracts in Advanced Robotics. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17452-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tranchini, Luca. "Identity of Proofs." In Trends in Logic. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-46921-3_2.

Full text
Abstract:
AbstractProof-theoretic semantics is here presented as primarily concerned with the investigation of the relationship between proofs (understood as abstract entities) and derivations (the linguistic representations of proofs). This relationship is taken to be analogous to that between names and (abstract) objects in Frege. On this conception of proof-theoretic semantics, reductions and expansions should be viewed as identity-preserving operations on derivations and thus as inducing an equivalence relation on derivations such that equivalent derivations denote the same proof. Using this equivalence on derivations it is possible to define an equivalence relation on formulas that is stricter than interderivability, called isomorphism. We argue that identity of proofs and formula isomorphism show the intensional nature of this conception of proof-theoretic semantics. Finally, this conception is compared to the one advocated by Dummett and Prawitz, which is based on a notion of validity of derivations.
APA, Harvard, Vancouver, ISO, and other styles
8

Josko, B. "A context dependent equivalence relation between Kripke structures." In Computer-Aided Verification ’90. American Mathematical Society, 1991. http://dx.doi.org/10.1090/dimacs/003/22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Givant, Steven R. "Chapter 7. Relation Algebras Generated by Equivalence Elements." In The Structure of Relation Algebras Generated by Relativizations. American Mathematical Society, 1994. http://dx.doi.org/10.1090/conm/156/07.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Danielsson, Nils Anders. "Bag Equivalence via a Proof-Relevant Membership Relation." In Interactive Theorem Proving. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32347-8_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Equivalence relation"

1

Chai, Zhonglin. "Consistency of Clustering Between Optimal Fuzzy Equivalence Relation and C-Means." In 2024 20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD). IEEE, 2024. http://dx.doi.org/10.1109/icnc-fskd64080.2024.10702333.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Colangeli, Sergio, Antonio Serino, Walter Ciccognani, Patrick E. Longhi, and Ernesto Limiti. "On the Equivalence of Network Representations in Relation to Stability Analysis." In 2024 19th European Microwave Integrated Circuits Conference (EuMIC). IEEE, 2024. http://dx.doi.org/10.23919/eumic61603.2024.10732107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Xuanxuan, Gang Li, and Yiming Tang. "Aggregation of fuzzy T-equivalence relations." In 2024 17th International Symposium on Computational Intelligence and Design (ISCID). IEEE, 2024. https://doi.org/10.1109/iscid63852.2024.00041.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Haihui, Liu. "Equivalence relation theory in software test." In 2012 2nd International Conference on Applied Robotics for the Power Industry (CARPI 2012). IEEE, 2012. http://dx.doi.org/10.1109/carpi.2012.6356521.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Deng, Guannan, and Yanli Jiang. "A Novel Representation of Fuzzy Equivalence Relation." In 2011 3rd International Workshop on Intelligent Systems and Applications (ISA). IEEE, 2011. http://dx.doi.org/10.1109/isa.2011.5873300.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Raut, Anjali B., and G. R. Bamnote. "Clustering method based on fuzzy equivalence relation." In 2011 2nd International Conference on Computer and Communication Technology (ICCCT). IEEE, 2011. http://dx.doi.org/10.1109/iccct.2011.6075209.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Yong, Xiang-li Zhang, Long He, Zhi-heng Xie, and Chong Zhu. "Research of Trace Equivalence Relation on XTR." In 2009 WRI International Conference on Communications and Mobile Computing (CMC). IEEE, 2009. http://dx.doi.org/10.1109/cmc.2009.189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Xiaoping Xue and Fengqiu Liu. "Learning Fuzzy equivalence relation kernels with prior knowledge." In 2009 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE, 2009. http://dx.doi.org/10.1109/icmlc.2009.5212532.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Montanari, Angelo, Marco Pazzaglia, and Pietro Sala. "Metric Propositional Neighborhood Logic with an Equivalence Relation." In 2014 21st International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2014. http://dx.doi.org/10.1109/time.2014.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Xiang-Yun, and Xi-Rong Ma. "An Equivalence Relation on Extended Finite State Machines." In 2009 International Conference on Computational Intelligence and Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/cise.2009.5364312.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Equivalence relation"

1

Niemer, K. A., and R. L. Frost. Equivalence relations for the 9972-9975 SARP. Office of Scientific and Technical Information (OSTI), 1994. http://dx.doi.org/10.2172/10109024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kaymak, Barış. Quantifying the Signaling Role of Education. Federal Reserve Bank of Cleveland, 2025. https://doi.org/10.26509/frbc-wp-202502.

Full text
Abstract:
This paper quantifies the signaling role of education and measures the associated efficiency losses from asymmetric information. To that end, I model educational attainment and occupational choices in an asymmetric information environment with employer learning and socially productive education. The model highlights how occupational sorting and the pace of employer learning jointly determine the strength of the signaling motive in equilibrium. I estimate the signaling role of education versus human capital by relating differences in employer learning across occupations, which generates variation in signaling incentives, to the distribution of ability and educational attainment by occupation. The estimates suggest that the role of job market signaling relative to the human capital model is 23 percent. On the margin, a year of additional schooling raises productivity by 6.4 percent and the return to signaling is 2.4 percent. In a counterfactual analysis, eliminating asymmetric information reallocates labor from education to workforce participation and improves occupational sorting. Aggregate efficiency gains are equivalent to 7.6 percent of lifetime earnings.
APA, Harvard, Vancouver, ISO, and other styles
3

Schneider, Carsten. Advanced Applications of QCA (Qualitative Comparative Analysis) in R. Instats Inc., 2023. http://dx.doi.org/10.61700/4fghv0ob2x5de469.

Full text
Abstract:
This seminar on advanced set-theoretic methods for the social sciences focuses on applied Qualitative Comparative Analysis (QCA). This method is used in fields as diverse as political science, public policy, international relations, sociology, business and management, organizational studies, and even musicology. This seminar will enable participants to produce cutting edge QCA-based research through hands-on coverage of the most recent advances in QCA. All applied components of the seminar are performed in the R software environment, using RStudio and R packages QCA and SetMethods. An official Instats certificate of completion is provided at the conclusion of the seminar, along with 2 ECTS Equivalent points.
APA, Harvard, Vancouver, ISO, and other styles
4

Torres, Javier, Javier Beverinotti, and Gustavo Canavire-Bacarrez. Medium and Long Run Economic Assimilation of Venezuelan migrants to Peru. Inter-American Development Bank, 2024. http://dx.doi.org/10.18235/0005503.

Full text
Abstract:
In a span of six years, the proportion of Venezuelans in Peru has surged nearly fourfold, rising from virtually zero to over 4% of the population. This study delves into the dynamics of medium- and long-term labor market integration in Peru, combining data from the Venezuelan Population Residing in Peru Survey and the Peruvian National Household Survey. Our findings reveal that Venezuelan workers experience low returns on foreign postsecondary education and there is minimal relation between foreign work experience and monthly income. Importantly, these outcomes remain consistent irrespective of the time spent in the host country, indicating a gradual economic assimilation process. Lastly, our estimation demonstrates that if Venezuelans human capital yielded returns equivalent to Peruvian human capital, the average income of Venezuelans would witness a substantial increase of 20%.
APA, Harvard, Vancouver, ISO, and other styles
5

Schneider, Carsten. Advanced Applications of QCA (Qualitative Comparative Analysis) in R. Instats Inc., 2022. http://dx.doi.org/10.61700/qdu1nxlyz9e6c469.

Full text
Abstract:
This seminar on advanced set-theoretic methods for the social sciences focuses on applied Qualitative Comparative Analysis (QCA). This method is used in fields as diverse as political science, public policy, international relations, sociology, business and management, organizational studies, and even musicology. This seminar will enable participants to produce cutting edge QCA-based research through hands-on coverage of the most recent advances in QCA. All applied components of the seminar are performed in the R software environment, using RStudio (Cloud) and R packages QCA and SetMethods. An official Instats certificate of completion is provided at the conclusion of the seminar. For European PhD students, the seminar offers 2 ECTS Equivalent points.
APA, Harvard, Vancouver, ISO, and other styles
6

Schneider, Carsten. Introduction to QCA (Qualitative Comparative Analysis) with R. Instats Inc., 2023. http://dx.doi.org/10.61700/85r1sesxjhke3469.

Full text
Abstract:
This seminar introduces applied set-theoretic methods for the social sciences, focusing on Qualitative Comparative Analysis (QCA). This method is used in fields as diverse as political science, public policy, international relations, sociology, business and management, organizational studies, and even musicology. This seminar will enable participants to produce a publishable QCA of their own. To achieve this, the seminar provides both the formal set-theoretical underpinnings of QCA as well as the technical and practical research skills necessary for performing a QCA. All applied components of the seminar are performed in the R software environment, using RStudio and R packages QCA and SetMethods. An official Instats certificate of completion is provided at the conclusion of the seminar, along with 2 ECTS Equivalent points.
APA, Harvard, Vancouver, ISO, and other styles
7

Lopez, Pierlauro. Welfare implications of asset pricing facts: should central banks fill gaps or remove volatility? Federal Reserve Bank of Cleveland, 2023. http://dx.doi.org/10.26509/frbc-wp-202116r.

Full text
Abstract:
I find that removing consumption volatility is a priority over filling the gap between consumption and its flexible-price counterpart, or inflation targeting, in a model that matches empirical measures of the welfare costs of consumption fluctuations. Nearly 30 years of financial market data suggest sizable welfare costs of fluctuations that can be decomposed into a term structure that is downward-sloping on average, especially during downturns. This evidence offers guidance in selecting a model to study the benefits of macroeconomic stabilization from a structural perspective. The addition of nonlinear external habit formation to a textbook New Keynesian model can rationalize the evidence, and it offers a framework suitable for studying the desirability of removing fluctuations. The model is nearly observationally equivalent in its quantity implications to a standard New Keynesian model with CRRA utility, but the asset pricing and optimal policy implications are dramatically different. In the model, a central bank that minimizes consumption volatility generates welfare improvements relative to an inflation targeting regime that are equivalent to a 25 percent larger consumption stream.
APA, Harvard, Vancouver, ISO, and other styles
8

Schneider, Carsten. Introduction to QCA (Qualitative Comparative Analysis) with R. Instats Inc., 2022. http://dx.doi.org/10.61700/umqeben6y0b41469.

Full text
Abstract:
This seminar introduces applied set-theoretic methods for the social sciences, focusing on Qualitative Comparative Analysis (QCA). This method is used in fields as diverse as political science, public policy, international relations, sociology, business and management, organizational studies, and even musicology. This seminar will enable participants to produce a publishable QCA of their own. To achieve this, the seminar provides both the formal set-theoretical underpinnings of QCA as well as the technical and practical research skills necessary for performing a QCA. All applied components of the seminar are performed in the R software environment, using RStudio (Cloud) and R packages QCA and SetMethods. An official Instats certificate of completion is provided at the conclusion of the seminar. For European PhD students, each seminar offers 2 ECTS Equivalent points.
APA, Harvard, Vancouver, ISO, and other styles
9

Hummels, David. Time as a Trade Barrier. GTAP Working Paper, 2002. http://dx.doi.org/10.21642/gtap.wp18.

Full text
Abstract:
International trade occurs in physical space and moving goods requires time. This paper examines the importance of time as a trade barrier, estimates the magnitude of time costs, and relates these to patterns of trade and the international organization of production. Estimates indicate that each additional day spent in transport reduces the probability that the US will source from that country by 1 – 1.5 percent. Conditional on exporting country, estimates directly identify a willingness-to-pay for time savings using variation across exporters and commodities in the relative price / speed tradeoff for air and ocean shipping. Each day saved in shipping time is worth 0.8 percent ad-valorem for manufactured goods. Relative declines over time in air shipping prices make time-savings less expensive, providing a compelling explanation for aggregate trade growth, compositional effects in trade growth, as well as growth in time-intensive forms of integration such as vertical specialization. Specifically, the advent of fast transport (air shipping and faster ocean vessels) is equivalent to reducing tariffs on manufactured goods from 32% to 9% between 1950-1998.
APA, Harvard, Vancouver, ISO, and other styles
10

Beckman, Jayson, Maros Ivanic, and Noé J. Nava. Estimating market implications from corn and soybean yields under climate change in the United States. Economic Research Service, U.S. Department of Agriculture, 2023. http://dx.doi.org/10.32747/2023.8134358.ers.

Full text
Abstract:
The United States is one of the largest producers and exporters of corn and soybeans globally partly because of yields that are among the highest in the world. However, a changing climate could affect these yields, which could ultimately affect production and the availability of products for export. In this report, the authors estimate that U.S. corn yields could increase 3.1 percent and soybean yields could decrease 3.0 percent in 2036 relative to 2016, based on climate projections. These results are driven primarily by the increased frequency of periods of extreme heat and declines in precipitation in counties east of the 100th meridian part of the United States. These estimates are then used in a simulation model to explore the market implications from these yield projections, and those results indicate that these yield changes could affect U.S. production and ultimately trade. The estimated growth in U.S. corn yields increases corn production that could ultimately affect the amount of corn the United States has available to export. Holding yields in other countries fixed, the model indicates that U.S. corn exports increase 0.36 percent (the equivalent of $63 million). The decline in soybean yields decreases production, leading to a 1.17-percent drop in U.S. exports (the equivalent of $319 million) based on 2016 exports
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Equivalence relation' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography