Contrary to what has been stated in most accounts that Hume intends to make arguments against the existence of God, he aims to attack the claim that religious propositions can be argued; not completely reject these propositions. He considers these propositions epistemologically outside of human knowledge but ontologically accepts the existence of God. With such a view, we can dismiss atheistic-agnostic interpretations and relate him to a kind of mysticism. The key to deciding whether or not Hume is a mystic (...) is to determine what criteria we have to consider someone a mystic. Two very influential components here are (1)the belief in the existence of God; (2) the belief that the existence of God is far from our usual reasoning (antirational or irrational).And the second component is enough to call someone like Wittgenstein a fideist. We claim that there is clear evidence of these components in Hume’s works; therefore, what reason do we have to remove Hume from the circle of fideism and mysticism? In this study, after an introduction to the concept and types of fideism, we show that Hume, based on his works, surpasses skepticism and manifests a special kind of fideism.While there is an emphasis on the mystery of the proposition that God exists, he combines Christian faith, in aform that is inseparable from illogical and mysterious propositions such as the incarnation of God. Thus, Hume can be called a Christian mystic. (shrink)

We study topological constructions in the recursion theoretic framework of the lattice of recursively enumerable open subsets of a topological space X. Various constructions produce complemented recursively enumerable open sets with additional recursion theoretic properties, as well as noncomplemented open sets. In contrast to techniques in classical topology, we construct a disjoint recursively enumerable collection of basic open sets which cannot be extended to a recursively enumerable disjoint collection of basic open sets whose union is dense in X.

Close examination of the works of David Hume shows that his aim to explain the problem of evil is to attack natural theology and introduce it as a situation that is non-epistemological and unsystematic. So, contrary to what the majority of interpretations which typically express that he makes an argument against the existence of God, Hume wants to show that the statements of natural theology are rationally unprovable, and he does not want to totally decline them. As a matter of (...) fact, they ontologically exist, and are epistemologically out of human cognition. This article shows that the popular interpretation is false, and this would be done in two ways: the first is Hume’s statements about the cause of the world, and the second is Hume’s solutions for the problem of evil, that have mystical streaks. Based on these fact, it will be shown that Hume is not an atheist, but he is a mystical fideist. (shrink)

The recursion-theoretic study of mathematical structures other thanωis now a field of much activity. Analysis and algebra are two such structures which have been studied for their effective contents. Studies in analysis began with the work of Specker on nonconstructive proofs in analysis [16] and in Lacombe's inspiring notes on relevant notions of recursive analysis [8]. Studies in algebra originated in the work of Frolich and Shepherdson on effective extensions of explicit fields [1] and in Rabin's study of computable fields (...) [15]. Equipped with the richness of modern techniques in recursion theory, Metakides and Nerode [11]–[13] began investigating the effective content of vector spaces and fields; these studies have been extended by Kalantari, Remmel, Retzlaff, Shore and others.Kalantari and Retzlaff [5] began a foundational inquiry into effectiveness in topological spaces. They consider a topological spaceXwith a countable basis ⊿ for the topology. The space isfully effective, that is, the basis elements are coded intoωand the operation of intersection of basis elements and the relation of inclusion among them are both computable. Similar to, the lattice of recursively enumerable subsets ofω, the collection of r.e. open subsets ofXforms a latticeℒunder the usual operations of union and intersection. (shrink)

In [5], Metakides and Nerode introduced the study of recursively enumerable substructures of a recursively presented structure. The main line of study presented in [5] is to examine the effective content of certain algebraic structures. In [6], Metakides and Nerode studied the lattice of r.e. subspaces of a recursively presented vector space. This lattice was later studied by Kalantari, Remmel, Retzlaff and Shore. Similar studies have been done by Metakides and Nerode [7] for algebraically closed fields, by Remmel [10] for (...) Boolean algebras and by Metakides and Remmel [8] and [9] for orderings. Kalantari and Retzlaff [4] introduced and studied the lattice of r.e. subsets of a recursively presented topological space. Kalantari and Retzlaff consideredX, a topological space with ⊿, a countable basis. This basis is coded into integers and with the help of this coding, r.e. subsets ofωgive rise to r.e. subsets ofX. The notion of “recursiveness” of a topological space is the natural next step which gives rise to the question of what should be the “degree” of an r.e. open subset ofX? It turns out that any r.e. open set partitions ⊿; into four sets whose Turing degrees become central in answering the question raised above.In this paper we show that the degrees of the elements of the partition of ⊿ imposed by an r.e. open set can be “controlled independently” in a sense to be made precise in the body of the paper. In [4], Kalantari and Retzlaff showed that givenAany r.e. set andany r.e. open subset ofX, there exists an r.e. open set ℋ which is a subset ofand is dense in and in whichAis coded. This shows that modulo a nowhere dense set, an r.e. open set can become as complicated as desired. After giving the general technical and notational machinery in §1, and giving the particulars of our needs in §2, in §3 we prove that the set ℋ described above could be made to be precisely of degree ofA. We then go on and establish various results on the mentioned partitioning of ⊿. One of the surprising results is that there are r.e. open sets such that every element of partitioning of ⊿ is of a different degree. Since the exact wording of the results uses the technical definitions of these partitioning elements, we do not summarize the results here and ask the reader to examine §3 after browsing through §§1 and 2. (shrink)

In this paper we develop a point-free approach to the study of topological spaces and functions on them, establish platforms for both and present some findings on recursive points. In the first sections of the paper, we obtain conditions under which our approach leads to the generation of ideal objects with which mathematicians work. Next, we apply the effective version of our approach to the real numbers, and make exact connections to the classical approach to recursive reals. In the succeeding (...) sections of the paper, we introduce machinery to produce functions on topological spaces and find succinct conditions which will be effectivized in our sequel. (shrink)

This paper is a culmination of our new foundations for recursive analysis through recursive topology as reported in Kalantari and Welch 125; 98 87). While in those papers we developed groundwork for an approach to point free analysis and applied recursion theory, in this paper we blend techniques of recursion theory with those of topology to establish new findings. We present several new techniques different from existing ones which yield interesting results. Incidental to our work is a unifying explanation of (...) various schools of study for recursive analysis. (shrink)

In this paper we continue our work of Kalantari and Welch . There we introduced machinery to produce a point-free approach to points and functions on topological spaces and found conditions for both which lend themselves to effectivization. While we studied recursive points in that paper, here, we present two useful classes of recursive functions on topological spaces, apply them to the reals, and find precise accounting for the nature of the properties of some examples that exist in the literature. (...) We end with a construction of a recursive function on a small subset of the unit interval which is strongly nonextendible. (shrink)

This paper is an investigation of definability hierarchies on effective topological spaces. An open subset U of an effective space X is definable iff there is a parameter free definition φ of U so that the atomic predicate symbols of φ are recursively open relations on X . The complexity of a definable open set may be identified with the quantifier complexity of its definition. For example, a set U is an ∃∃∀∃-set if it has an ∃∃∀∃ parameter free definition (...) using only recursively open predicate symbols. Since X is not equipped with a natural pairing apparatus such a U need not be an ∃∀∃-set. Let Σ denote the class of all ∃-sets, ∃∃-sets, ∃∃∃-sets etc. We show that an open set is in Σ iff it is equivalent modulo a nowhere dense set to a recursively enumerable open set . Thus Σ = e.r.e. Indeed we show the existence of a universal Σ -set as well as the existence of universal sets for higher levels of the definability hierarchy. (shrink)

We develop the concepts of recursively nowhere dense sets and sets that are recursively of first category and study closed sets of points in light of Baire's Category Theorem. Our theorems are primarily concerned with exdomains of recursive quantum functions and hence with avoidable points . An avoidance function is a recursive function which can be used to expel avoidable points from domains of recursive quantum functions. We define an avoidable set of points to be an arbitrary subset of the (...) avoidable points of a single avoidance function, and we study an effective union of such sets which we call a piecemeal avoidable set. We note that each of ‘the set of recursive points’ and ‘the set of avoidable points’ is of first category but not recursively of first category. We show an exdomain exists which is recursively nowhere dense, as well as one that is nowhere dense but not recursively nowhere dense. After establishing that every exdomain is recursively of first category, we prove that given any fixed exdomain, there is another exdomain, which while dense in the underlying space, is disjoint from the fixed exdomain. Finally, we show how to build a recursive sequence of recursive quantum functions that have mutually disjoint, dense exdomains. (shrink)

In this paper we first give a variant of a theorem of Jockusch–Lewis– Remmel on existence of a computable, degree-preserving homeomorphism between a bounded strong ${\Pi^0_2}$ class and a bounded ${\Pi^0_1}$ class in 2 ω . Namely, we show that for mathematically common and interesting topological spaces, such as computably presented ${\mathbb{R}^n}$ , we can obtain a similar result where the homeomorphism is in fact the identity mapping. Second, we apply this finding to give a new, priority-free proof of existence (...) of a tree of shadow points computable in 0′. (shrink)

This paper continues our study of computable point-free topological spaces and the metamathematical points in them. For us, a point is the intersection of a sequence of basic open sets with compact and nested closures. We call such a sequence a sharp filter. A function fF from points to points is generated by a function F from basic open sets to basic open sets such that sharp filters map to sharp filters. We restrict our study to functions that have at (...) least all computable points in their domains.We follow Turing's approach in stating that a point is computable if it is the limit of a computable sharp filter; we then define the Turing degree Deg of a general point x in an analogous way. Because of the vagaries of the definition, a result of J. Miller applies and we note that not all points in all our spaces have Turing degrees; but we also show a certain class of points do. We further show that in ℝn all points have Turing degrees and that these degrees are the same as the classical Turing degrees of points defined by other researchers.We also prove the following: For a point x that has a Turing degree and lies either on a computable tree T or in the domain of a computable function fF, there is a sharp filter on T or in dom converging to x and with the same Turing degree as x. Furthermore, all possible Turing degrees occur among the degrees of such points for a given computable function fF or a complete, computable, binary tree T. For each x ∈ dom for which x and fF have Turing degrees, Deg) ≤ Deg. Finally, the Turing degrees of the sharp filters convergent to a given x are closed upward in the partial order of all Turing degrees. (shrink)

_ Source: _Volume 40, Issue 1, pp 80 - 103 This study was designed to examine the relationships between social support, perceived stress, religiosity, and flourishing and to test the mediating role of perceived stress in the relationships between social support and religiosity with flourishing. This study also examines the moderating roles of religiosity and gender in the relationship between social support and flourishing among 2301 Malaysian older adults. Structural Equation Modelling showed that older adults with high levels of social (...) support, high levels of intrinsic religious motivation, high levels of extrinsic religious motivation, and low levels of perceived stress were more likely to experience flourishing. Bootstrapping analysis provided evidence of perceived stress as a significant partial mediator in the links between social support, intrinsic religious motivation, and extrinsic religious motivation with flourishing. Multi-group analysis revealed that religiosity and gender acted as significant moderators in the links between social support, perceived stress, and flourishing. (shrink)

The rate of human health care-associated infections caused by Acinetobacter baumannii has increased significantly in recent years for its remarkable resistance to desiccation and most antibiotics. Phospholipases, capable of destroying a phospholipid substrate, are heterologous group of enzymes which are believed to be the bacterial virulence determinants. There is a need for in silico studies to identify potential vaccine candidates. A. baumannii phospholipase D role has been proved in increasing organism’s resistance to human serum, destruction of host epithelial cell and (...) pathogenesis in murine model. In this in silico study high potentials of A. baumannii PLD in elicitation of humoral and cellular immunities were elucidated. Thermal stability, long half-life, non-similarity to human and gut flora proteome and non-allergenicity were in a list of A. baumannii PLD positive properties. Potential epitopic sequences were also identified that could be used as peptide vaccines against A. baumannii and various other human bacterial pathogens. (shrink)

In the 2nd half of nineteenth century, when the Pan-Islamism ideology as the way out of Islamic world’s straits was formed in the mind of some Islamic world’s thinkers, some of Iranian thinkers joined the issue, as well. Mostly influenced by the ideologies particularly were Istanbul-resident Iranians intellectuals and thinkers who, oppressed by authoritarians of Iran, had taken refuge in Istanbul and started living there. Among them, Mirza Agha Khan Kermani and his inseparable fellow, Sheikh Ahmad Rouhi, had an interesting (...) yet bitter adventure. Despite having non-religious ideological background, they were attracted toward Pan-Islamism, acted whole-heartedly and sacrificed themselves for it.Using the remaining works by the two characters and other sources of that time, this study tried to recognize their roles in the movement of Pan-Islamism. (shrink)

The concept of value is so wide that could be considered as synonymous with human life and existence. The human being is engaged in the evaluations of being by doing every act. Life is a value that even its ascetic denial is a kind of valuation. When the human being enters the world, in fact he enters a pre-valued world and many values weighed upon him. To what extent is man capable of emancipating from pre-existing values and to what extent (...) can he succeed in creating value? The complex world today is very similar to the mythical world in which the blind and deaf valuing forces have overwhelmed and conquered human choices. It is here that human choices show a confusing and algebraic procedure, and freedom is as s chain that human being wrap around himself. (shrink)

This paper is a sequel to our [7]. In that paper we constructed a Π1 0 tree of avoidable points. Here we construct a Π1 0 tree of shadow points. This tree is a tree of sharp filters, where a sharp filter is a nested sequence of basic open sets converging to a point. In the construction we assign to each basic open set on the tree an address in 2<ω. One interesting fact is that while our Π1 0 tree (...) of sharp filters (a subtree of Δ<ω) is isomorphic to the tree of addresses (a subtree of 2<ω), the tree of addresses is recursively enumerable but not recursive. To achieve this end we use a finite injury priority argument. (shrink)

Multidrug-resistant Acinetobacter baumannii is recognized to be among the most difficult antimicrobial-resistant gram negative bacilli to control and treat. One of the major challenges that the pathogenic bacteria face in their host is the scarcity of freely available iron. To survive under such conditions, bacteria express new proteins on their outer membrane and also secrete iron chelators called siderophores. Antibodies directed against these proteins associated with iron uptake exert a bacteriostatic or bactericidal effect against A. baumanii in vitro, by blocking (...) siderophore mediated iron uptake pathways. Attempts should be made to discover peptides that could mimic protein epitopes and possess the same immunogenicity as the whole protein. Subsequently, theoretical methods for epitope prediction have been developed leading to synthesis of such peptides that are important for development of immunodiagnostic tests and vaccines. The present study was designed to in silico resolving the major obstacles in the control or in prevention of the diseases caused by A. baumannii. We exploited bioinformatic tools to better understand and characterize the Baumannii acinetobactin utilization structure of A. baumannii and select appropriate regions as effective B cell epitopes. In conclusion, amino acids 26–191 of cork domain and 321–635 of part of the barrel domain including L4–L9, were selected as vaccine candidates. These two regions contain functional exposed amino acids with higher score of B cell epitopes properties. Majority of amino acids are hydrophilic, flexible, accessible, and favorable for B cells from secondary structure point of view. (shrink)

BackgroundUncertainty intolerance (IU), the tendency to think or react negatively toward uncertain events may have implication on individuals’ mental health and psychological wellbeing. The Intolerance of Uncertainty Scale-12 (IU-12) is commonly used across the globe to measure IU, however, its’ psychometric properties are yet to be evaluated in Iran with a Persian-speaking population. Therefore, the purpose of this research was to translate and validate the IU-12 among Iranian undergraduate students.Materials and MethodsThe multi-stage cluster random sampling was employed to recruit 410 (...) Iranian undergraduate students (260 females) from the Azad University to complete the IU-12, the Depression Anxiety Stress Scale-2, and the Penn State Worry Questionnaire in a cross-sectional design. In this study, face validity, content validity, construct validity, and concurrent validity were measured and Construct Reliability (CR) and Cronbach’s alpha were used to measure reliability.ResultsThe impact score of the translated IU-12 indicated acceptable face validity (value of impact score was greater than 1.5). The value of Content Validity Index (CVI) and the value of Content Validity Ratio (CVR) were above 0.7 and 0.78, respectively. The values of CVI and CVR indicated the items had acceptable content validity and were deemed essential to the measure. The measurement model analysis showed the measure with two subscales had good fit indices (CMIN/df = 2.75, p < 0.01, RMSEA = 0.07, TLI = 0.94, CFI = 0.95, GFI = 0.94). A Confirmatory Factor Analysis (CFA) indicated the scale was composed of the two subscales found in the English-version of the scale (prospective anxiety and inhibitory anxiety), and no items were removed from the scale. The values of CR (0.86) and Cronbach’s alphas (0.89) showed the measure had appropriate internal consistency.ConclusionThe findings support the psychometric properties of the Persian version of the IU-12. This scale could be used to reliably and accurately measure uncertainty intolerance among undergraduate students in Iran. (shrink)

Recent research in the cognitive science of religion suggests that humans intuitively believe that others survive death. In response to this finding, three cognitive theories have been offered to explain this: the simulation constraint theory (Bering, Citation2002); the imaginative obstacle theory (Nichols, Citation2007); and terror management theory (Pyszczynski, Rothschild, & Abdollahi, 2008). First, I provide a critical analysis of each of these theories. Second, I argue that these theories, while perhaps explaining why one would believe in his own personal (...) immortality, leave an explanatory gap in that they do not explain why one would intuitively attribute survival of death to others. To fill in the gap, I offer a cognitive theory based on offline social reasoning and social embodiment which provides for the belief in an eternal social realm in which the deceased survive—the afterlife. (shrink)

Recent research (Bering 2002, 2006) into what has become known as “the folk psychology of souls” demonstrates that humans intuitively believe that others survive death. Additional research (Harris & Gimenéz, 2005; Astuti & Harris, 2008) has demonstrated that this belief is highly context sensitive. In this thesis, the author presents this research and provides a critical analysis of the findings based on philosophical and empirical concerns. The author also presents and critically analyses several theories that have been proposed to explain (...) this intuitive belief: intuitive Cartesian substance dualism (Bloom, 2004); the simulation constraint theory (Bering, 2006); the imaginative obstacle theory (Nichols, 2007); and terror management theory (Pyszczynski, Rothschild, & Abdollahi, 2008; Vail III, et al., 2010). The author argues, based on philosophical concerns, and anthropological and psychological empirical evidence, that none of the proposed theories are up to the task of giving a cognitive account of the folk psychology of souls. The author then argues for three interconnected theses to provide a cognitive account for why humans intuitively believe that others survive death. The first thesis, from which the second and third theses follow, is that the acceptance of afterlife beliefs is predisposed by a specific, and already well-documented, imaginative process—the offline social reasoning process. The second thesis is that afterlife beliefs are social in nature. The third thesis is that the living imagine the deceased as socially embodied in such a way as to continue to fulfill on-going social obligations with others. The author further suggests six reasons why the fantasy/reality distinction breaks down for the imaginer such that the continued existence of the decedent in the afterlife is believed to be real. Finally, the author suggests avenues for further research that would support this cognitive account. (shrink)