the most skeptical approach towards the authenticity of islamic original textss, was represented in the late 1970s by john wansbrough. by insisting that isnad of hadiths and bibliographical information are not reliable, wansbrough suggested literary analysis instead of dating of all early islamic texts including the quran. by employing literary analysis to early islamic texts of exegesis, hadit...

In his twenty-seven year reign (1978-2005), Pope John Paul II created not only more saints than any other pope in history, but also more saints than all the other popes put together since Pope Urban VIII centralised control of saint-making in 1634. This article argues that the elevation of ‘celebrity saints’, such as Padre Pio and Mother Theresa, can be seen as an attempt on the part of the Cat...

The purpose of this study is to describe a recent comparison women's political participation based on empirical evidence the matrilineal and patrilineal orders in West North Sumatra, respectively. This was motivated by low involvement women politics 2014 2019 general elections. offers specific insights into kinship order as allegiance. qualitative research carried out using pragmatic methodolog...

Abstract This study revisits the question of early modern Ottoman madrasa curriculum, which, ever since famous Studia Islamica article Nenad Filipovic and late Shahab Ahmed in 2004, has come to be recognized as “sultan’s syllabus,” implying a strict imposition centrally-designed course study. By utilizing host endowment lists, book registers, autobiographical writings high- low-ranking scholars...

The vertex canonical labeling technique is one of the powerful methods in solving the graph isomorphism problem. However, some famous algorithms relied upon this technique are incomplete due to their non-zero probability of rejection. In this paper, we advance a new method of vertex canonical labeling and propose a complete graph isomorphism algorithm with depth-first backtracking. The time com...

The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. However, in the context of chemistry, because molecules are a restricted class of graphs, the problem of graph isomorphism can be solved efficiently (i.e., in polynomial-time). This paper presents the theoretical results that for all molecules, the problems...