treatment with muḥarramāt (forbidden things)

نویسندگان
چکیده

the jurists have since early times wondered whether illnesses can be treated with forbidden or ḥarām things and thereby improve the illness and restore the patients to health; or whether it is totally forbidden and impermissible to step into this arena even if motivated by treatment of illness. of course, using the unlawful in treating illnesses where exploitations other than eating and drinking is in mind is not so much problematic and sensitive; however, what is more open to disputation is eating and drinking unlawful things with the intention of treatment. in this respect, although most of the jurists, especially the earlier ones, have viewed treatment with the unlawful, either absolutely or with certain muḥarramāt as impermissible and have not withstood it, the viewpoint addressed in this article is the permissibility of all kinds of treatment with all muḥarramāt irrespective of their differences. thus, in order to explain this viewpoint and reinforce it, five reasons have been set forth and by providing the conditions and answering to the contradictory probabilities and criticizing the opponents’ viewpoints, it is tried to pave the ground to some extent for the acceptability of this theory.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Covering Things with Things

An abstract NP-hard covering problem is presented and xed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of three parameters: n, the number of elements to be covered, k, the number of sets allowed in the covering, and d, the combinatorial dimension of the problem. The rst algorithm is deterministic and has running time O...

متن کامل

Sorting with Forbidden Intermediates

A wide range of applications, most notably in comparative genomics, in-volve the computation of a shortest sorting sequence of operations for a givenpermutation, where the set of allowed operations is fixed beforehand. Suchsequences are useful for instance when reconstructing potential scenarios ofevolution between species, or when trying to assess their similarity. We revisit<l...

متن کامل

Graphs with Forbidden Subgraphs

Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...

متن کامل

Set families with forbidden subposets

Let F be a family of subsets of {1, . . . , n}. We say that F is P -free if the inclusion order on F does not contain P as an induced subposet. The Turán function of P , denoted La∗(n, P ), is the maximum size of a P -free family of subsets of {1, . . . , n}. We show that La∗(n, P ) ≤ (4r + O( √ r)) ( n bn/2c ) if P is an r-element poset of height at most 2. We also show that La∗(n, Sr) = (r + ...

متن کامل

Universal Structures with Forbidden Homomorphisms

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every regular set F of finite connected structures there exists a (countable) ω-categorical universal structure U for the class Forbh(F) (of all countable structures not containing any homomorphic image of ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
فقه و اصول

جلد ۴۶، شماره ۱۷، صفحات ۲۹-۰

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023