نتایج جستجو برای: if used properly

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

Journal: :journal of algebraic systems 2014
hosein fazaeli moghim fatemeh rashedi

let $r$ be a commutative ring with identity and $m$ be a unitary$r$-module. the primary-like spectrum $spec_l(m)$ is thecollection of all primary-like submodules $q$ such that $m/q$ is aprimeful $r$-module. here, $m$ is defined to be rsp if $rad(q)$ isa prime submodule for all $qin spec_l(m)$. this class containsthe family of multiplication modules properly. the purpose of thispaper is to intro...

Journal: :medical journal of islamic republic of iran 0
nasser simforoosh from the department of urology, shahid labbafi nejad medical center, shahid beheshti university of medical sciences, tehran, islamic republic of iran. abdol karim danesh dezfuli mohamad reza razzaghi

from 1983 until 1987, 4177 outpatient urologic procedures were performed at shahid labbafi nejad medical center. 34% of the cases were open surgical, while 66% were endourologic procedures. there was no surgical complication related to the outpatient aspect of the procedure. rate of infection in open surgical cases was almost zero. the number of procedures was increased each succeeding year. al...

1999
Geir B. Asheim GEIR B. ASHEIM

Proper consistency is defined by the properties that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain belief of proper consistency, a most preferred strategy is properly rationalizable. Any strategy used w...

Journal: :J. Philosophical Logic 2012
Adam Sennet Jonathan Weisberg

Compounds of indicative conditionals present some puzzling phenomena. Perhaps most striking, some nested indicative conditionals are uninterpretable. Proponents of NTV hold that indicative conditionals do not have truth values, and they use this to explain why nested indicative conditionals are sometimes uninterpretable: the embedded conditional does not provide the truth conditions needed by t...

2010
Laurent Gourvès Adria Lyra Carlos Alberto de Jesus Martinhon Jérôme Monnot

We deal with different algorithmic questions regarding properly arc-colored s-t paths, trails and circuits in arc-colored digraphs. Given an arc-colored digraph D with c ≥ 2 colors, we show that the problem of maximizing the number of arc disjoint properly arc-colored s-t trails can be solved in polynomial time. Surprisingly, we prove that the determination of one properly arc-colored s-t path ...

Journal: :The Proceedings of the Annual Convention of the Japanese Psychological Association 2017

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

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