نتایج جستجو برای: de morgan

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

2018
Marie Evans Yingying Sang Brad C. Astor Peter J. Blankestijn Nigel J. Brunskill Philip A. Kalra Csaba P. Kovesdy Csaba P Kovesdy Haitao Zhang

Marie Evans, MD, PhD, Morgan Grams, MD PhD, Yingying Sang, MS, Brad C. Astor, PhD, MPH, Peter J. Blankestijn, MD, PhD, Nigel J. Brunskill, MD, PhD, John F. Collins, MBChB, Philip A. Kalra, MD BChir, MD, Csaba P. Kovesdy, MD, Adeera Levin, MD, Patrick B. Mark, MBChB, PhD, Olivier Moranne, MD, PhD, Panduranga Rao, MD, Pablo G. Rios, MD, Markus P. Schneider, MD, Varda Shalev, MD, Haitao Zhang, MD,...

2003
George W. Beadle Thomas Hunt Morgan Medal David S. Hogness David Hogness

The Genetics Society of America annually honors members who have made outstanding contributions to genetics. The Thomas Hunt Morgan Medal recognizes a lifetime contribution to the science of genetics. The Genetics Society of America Medal recognizes particularly outstanding contributions to the science of genetics within the past 15 years. The George W. Beadle Medal recognizes distinguished ser...

1998
M. N. S. Swamy

In two recent articles [2] and [3], Ferri et al. introduced and studied the properties of two numerical triangles, which they called DFF and DFZ triangles. However, in a subsequent article, Andre-Jeannin [1] showed that the polynomials generated by the rows of these triangles are indeed the Morgan-Voyce polynomials Bn{x) and bn(x), whose properties are well known [10] and [11]; in fact, the pol...

Journal: :Ann. Pure Appl. Logic 1997
Hajnal Andréka

We study algebras whose elements are relations, and the operations are natural \manipulations" of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schrr oder (who expanded the Boolean tradition with extra operators to handle algebras of binary relations). Well known examples of algebras of relations are the varieties RCA n of cylindric algebras of n-ary relations, ...

Journal: : 2023

Pour une publication sur Épisciences. Résumé de la thèse Morgan Lans, intitulée "Les dynamiques l’intégration : associations d’aide aux migrants et sociétés au cœur des espaces français, espagnol danois", sous direction d’Olivier Cousin Claire Schiff, soutenue le 17 mars 2022 à l'université Bordeaux

2011
John Patrick Phillip L. Morgan Victoria Smy

The soft constraints hypothesis (Gray et al., 2006) posits that a more memory-based strategy is induced with increasing costs of accessing goal-state information. This relationship was used advantageously to reduce forgetting in an interrupted visuo-spatial copying task, although it increased overall task completion time (Morgan et al., 2009). However, in problem solving, studies have found tha...

2009
JIANGUO CAO JIAN GE

We will simplify the earlier proofs of Perelman’s collapsing theorem of 3-manifolds given by Shioya-Yamaguchi [SY00]-[SY05] and Morgan-Tian [MT08]. A version of Perelman’s collapsing theorem states that: “Let {M3 i } be a sequence of compact Riemannian 3-manifolds with curvature bounded from below by (−1) and diam(M3 i ) ≥ c0 > 0. Suppose that all unit metric balls in M3 i have very small volum...

2014
Anitha Sara Thomas Sunil Jacob John

Pawlak’s Rough set theory was originally proposed as a general mathematical tool for dealing with uncertainty in modeling imperfect knowledge. The purpose of this paper is to introduce the concept of multifuzzy rough sets by combining the multi-fuzzy set and rough set models. Some operations such as Complement, Union, Intersection etc. are defined for multi-fuzzy rough sets and De Morgan’s laws...

2013
Angelo Gilio Giuseppe Sanfilippo A. Gilio G. Sanfilippo

In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as XH + P(X|H)H; in particular (the indicator of) a conditional event E|H is looked at as EH + P (E|H)H. This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditi...

Journal: :Ann. Pure Appl. Logic 2009
Rosalie Iemhoff George Metcalfe

The admissible rules of a logic are the rules under which the set of theorems of the logic is closed. In this paper a Gentzen-style framework is introduced for defining analytic proof systems that derive the admissible rules of various non-classical logics. Just as Gentzen systems for derivability treat sequents as basic objects, for admissibility, sequent rules are basic. Proof systems are def...

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

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