Background: Practitioners in a variety of spiritual/religious traditions have described “mystical experiences”, defined by common set qualities. The “Mystical Experience Questionnaire” (MEQ30) provides validated and quantitative measure mystical experience, has been used successfully to demonstrate that the hallucinogenic substance psilocybin triggers mystical-type e...

The article presents the theological ideas and mystical–religious teachings of Greek-Byzantine Church Fathers, which, at same time, are philosophical because Byzantine theologians also reflected on human their life, relationship between man God, possibilities God-cognition obtaining higher sacred knowledge. Based analysis anthropological epistemological Greek we highlight that philosophizing wa...

abdullah al-baradouni and jalal ad-din muhammad mawlawi suggest some common ontological themes which are represented in themes like “freedom”, “astonishment”, “estrangement” “death”.  there are lots of similarities between two poets. two poets represent these themes with a sincere mystical approach. theme of freedom is represented in the  poems of two poets by a mystical approach and it means b...

mystical texts are the most important texts have been set to convey epistemic teachings and to influence the audiences concerned with awareness and esoteric training.  therefore it seems that specific techniques have been used in rhetoric to fulfill this objective. according to the style of speech in mystical texts, they can be considered as rhetoricals. reviewing the concept of rhetoric and it...

We consider problems in sequence enumeration suggested by Stockhausen’s problem, and derive a generating series for the number of sequences of length k on n available symbols such that adjacent symbols are distinct, the terminal symbol occurs exactly r times, and all other symbols occur at most r − 1 times. The analysis makes extensive use of techniques from the theory of symmetric functions. E...

The simple deterministic grammar (s-grammar) is the standard form grammar in which the handles of the Z-rules are distinct for each nonterminal symbol Z. The language generated by an s-grammar is called the simple deterministic language (s-language). It is known that the s-languages have the the prefix property and that their equivalence problem is solvable. (Korenjak and Hopcroft, 1966). Using...