Near unanimity identities and congruence distributivity in equational classes

Aleit Mitschke

doi:10.1007/bf02485367

Near unanimity identities and congruence distributivity in equational classes

Algebra Universalis ◽

10.1007/bf02485367 ◽

1978 ◽

Vol 8 (1) ◽

pp. 29-32 ◽

Cited By ~ 17

Author(s):

Aleit Mitschke

Keyword(s):

Congruence Distributivity ◽

Near Unanimity

Download Full-text

Few subpowers, congruence distributivity and near-unanimity terms

Algebra Universalis ◽

10.1007/s00012-008-2049-1 ◽

2008 ◽

Vol 58 (2) ◽

pp. 119-128 ◽

Cited By ~ 5

Author(s):

Petar Marković ◽

Ralph McKenzie

Keyword(s):

Congruence Distributivity ◽

Near Unanimity

Download Full-text

Informed Consent and the Elusive Dichotomy Between Standard and Experimental Therapy

American Journal of Law & Medicine ◽

10.1017/s0098858800002690 ◽

2002 ◽

Vol 28 (4) ◽

pp. 361-408

Author(s):

Lars Noah

Keyword(s):

Clinical Trials ◽

Informed Consent ◽

Patient Autonomy ◽

College Campuses ◽

Human Experimentation ◽

Experimental Therapy ◽

Academic Literature ◽

Medical Experimentation ◽

Disclosure Rules ◽

Near Unanimity

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.

Download Full-text

Centralising groups of semiprojections and near unanimity operations

2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL) ◽

10.1109/ismvl49045.2020.00061 ◽

2020 ◽

Author(s):

Mike Behrisch ◽

Reinhard Poschel

Keyword(s):

Near Unanimity

Download Full-text

Robust algorithms with polynomial loss for near-unanimity CSPs

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611974782.22 ◽

2017 ◽

Cited By ~ 1

Author(s):

Víctor Dalmau ◽

Marcin Kozik ◽

Andrei Krokhin ◽

Konstantin Makarychev ◽

Yury Makarychev ◽

...

Keyword(s):

Robust Algorithms ◽

Near Unanimity

Download Full-text

COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS

International Journal of Algebra and Computation ◽

10.1142/s0218196713500343 ◽

2013 ◽

Vol 23 (06) ◽

pp. 1521-1531 ◽

Cited By ~ 4

Author(s):

JONAH HOROWITZ

Keyword(s):

Computational Complexity ◽

Polynomial Time ◽

Mal’Cev Condition ◽

Exponential Time ◽

Cube Term ◽

Near Unanimity

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).

Download Full-text