نتایج جستجو برای: equality relation

تعداد نتایج: 314679  

2013
Amy R. Krosch Leslie Berntsen David M. Amodio John T. Jost Jay J. Van Bavel

• We examined the relation between political ideology and racial categorization. • People categorized morphed faces that ranged from 100% Black to 100% White. • Conservatism (vs. liberalism) was associated with the tendency to categorize racially ambiguous faces as Black. • Relation between ideology and categorization was mediated by opposition to equality. • This research helps to explain the ...

2009
Alberto Peretti

In this working paper we study some properties of a particular mapping in Rn related to an optimization problem with one equality constraint. We motivate the definition of the relevant mapping starting from a portfolio selection problem, in which we minimize the risk of an investment (the variance of its return) with one equality constraint given by a fixed level of the return itself. The vecto...

Journal: :Physical review letters 2008
David Andrieux Pierre Gaspard

A universal quantum work relation is proved for isolated time-dependent Hamiltonian systems in a magnetic field as the consequence of microreversibility. This relation involves a functional of an arbitrary observable. The quantum Jarzynski equality is recovered in the case this observable vanishes. The Green-Kubo formula and the Casimir-Onsager reciprocity relations are deduced thereof in the l...

1985
Younghwan Lim Lawrence J. Henschen

Equality is an Important re lat ion and many theorems can be easily symbolized through i t ' s use. A proposed Inference rule called HL-resolution Is intended to have the benefits of hyper steps while control l ing the application of paramodulation. It generates a resolvent by building a paramodulation and demodulation l ink between two terms using a pre pro ceased plan as a guide. The rule Is ...

Journal: :Theor. Comput. Sci. 2011
Jörg Endrullis Clemens Grabmayer Jan Willem Klop Vincent van Oostrom

We consider the rewrite system Rμ with μx.M →μ M[x := μx.M] as its single rewrite rule, where the signature consists of the variable binding operator commonly denoted by μ, first-order symbols, which in this paper are restricted to a binary function symbol F, and possibly some constant symbols. This kernel system denoting recursively defined objects occurs in several contexts, e.g. it is the fr...

Journal: :Journal of Logic, Language and Information 2008
Ariel Cohen Michael Kaminski Johann A. Makowsky

We motivate and formalize the idea of sameness by default : two objects are considered the same if they cannot be proved to be different. This idea turns out to be useful for a number of widely different applications, including natural language processing, reasoning with incomplete information, and even philosophical paradoxes. We consider two formalizations of this notion, both of which are ba...

Journal: :Ann. Pure Appl. Logic 2010
Ekaterina B. Fokina Sy-David Friedman Asger Törnquist

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-Kechris-Louveau ([5]) show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on P(ω), the power set of ω, and any Borel equivalence relation strictly ...

2005
Y. Y. Yao

The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The relation, not necessarily equivalence, between objects are defined in terms of relationships between attribute values. The adoption of other types of relations enables us to define various classes of rough set models. This study ...

Journal: :J. Log. Comput. 2012
Pilar Dellunde

In this paper we develop the method of diagrams for fuzzy predicate logics and give a characterization of different kinds of preserving mappings in terms of diagrams. Our work is a contribution to the modeltheoretic study of equality-free fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts bei...

1997
Maarten de Mol

In this paper the development of automatically veriied proofs for functional programs is examined. This examination is made on the basis of a small functional program written in the functional language clean. For this program a proof is constructed in the proof system coq. This proof is automatically veriied by coq. The functional program presented contains two function-constructors for the cla...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید