Near unanimity identities and congruence distributivity in equational classes

1978 ◽  
Vol 8 (1) ◽  
pp. 29-32 ◽  
Author(s):  
Aleit Mitschke
2008 ◽  
Vol 58 (2) ◽  
pp. 119-128 ◽  
Author(s):  
Petar Marković ◽  
Ralph McKenzie

2002 ◽  
Vol 28 (4) ◽  
pp. 361-408
Author(s):  
Lars Noah

A rich academic literature exists about issues of informed consent in medical care, and, to a lesser extent, about a variety of issues posed by human experimentation. Most commentators regard patient autonomy as a desirable— though in practice often unattainable—goal, and near unanimity exists about the necessity for even fuller disclosure before experimenting on subjects. Although this Article intentionally side-steps the broader debate about informed consent, it challenges the conventional wisdom that special disclosure rules should apply in the experimental context.Clinical trials have become big business. Estimates suggest that as many as twenty million Americans have enrolled in formal biomedical studies, though, as a measure of the full scope of medical experimentation on humans, that figure may represent only the proverbial tip of the iceberg. Historically, sponsors of clinical trials recruited subjects informally, counting on word of mouth among physicians and also perhaps posting flyers around college campuses.


Author(s):  
Víctor Dalmau ◽  
Marcin Kozik ◽  
Andrei Krokhin ◽  
Konstantin Makarychev ◽  
Yury Makarychev ◽  
...  

2013 ◽  
Vol 23 (06) ◽  
pp. 1521-1531 ◽  
Author(s):  
JONAH HOROWITZ

This paper examines the computational complexity of determining whether or not an algebra satisfies a certain Mal'Cev condition. First, we define a class of Mal'Cev conditions whose satisfaction can be determined in polynomial time (special cube term satisfying the DCP) when the algebra in question is idempotent and provide an algorithm through which this determination may be made. The aforementioned class notably includes near unanimity terms and edge terms of fixed arity. Second, we define a different class of Mal'Cev conditions whose satisfaction, in general, requires exponential time to determine (Mal'Cev conditions satisfiable by CPB0 operations).


2011 ◽  
Vol 65 (1) ◽  
pp. 61-72 ◽  
Author(s):  
Sebastian Kerkhoff
Keyword(s):  

Order ◽  
1990 ◽  
Vol 7 (3) ◽  
pp. 239-247 ◽  
Author(s):  
R. W. Quackenbush ◽  
I. Rival ◽  
I. G. Rosenberg
Keyword(s):  

2004 ◽  
Vol 2 (3) ◽  
pp. 368-376
Author(s):  
I. Chajda ◽  
R. Halaš

Order ◽  
2003 ◽  
Vol 20 (4) ◽  
pp. 291-298 ◽  
Author(s):  
Gábor Kun ◽  
Csaba Szabó
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document