Many efforts have been made by nineteenth and twentieth-century critics alike to classify Charles Algernon Swinburne’s Poems and Ballads (1866) as blatantly sacrilegious. This evaluative approach, however, fails to account for the thematic significance of Swinburne’s nuanced use of Christian imagery. Through a reading of three representative poems from the collection – “Dolores,” “Anactoria,” and “Laus Veneris” – this thesis demonstrates that Swinburne appropriates the Catholic concepts of transubstantiation, confession, and suffering for a specific aesthetic purpose. In the Catholic tradition, these concepts symbolically represent a unification of ostensibly antithetical states to achieve transcendence. For instance, the doctrine of transubstantiation unites the spiritual acceptance of Christ’s sacrifice through the physical consumption of bread and wine. Far from being, as Robert Buchanan famously claimed, “unclean for the mere sake of uncleanness,” Swinburne strategically appropriated the mechanism of religious transcendence in order to affect a poetic escape from the very moral categories it represented.

The purpose of this study was to bring more clarification to the concepts of spirituality and happiness, their meaning, attainability, and position in the field of Multicultural Education. In general, people think they will find joy and happiness if they graduate from a post-secondary educational institution with an undergraduate or graduate degree, find a good work environment, position, salary, living standards, status, etc. Yet, in the real world there may be a different way to find genuine happiness and joy which is fair, simple, easy and equal for all human beings even those who cannot afford higher levels of education. In order to present the data, the study discussed the life, philosophy and teachings of Imam Sheikh Iskender Ali Mihr, president of Mihr Foundation in Turkey, International Mihr Foundation in the United States and University of Allah in Virginia, and utterly an Ottoman. The review of literature was also included to assist the readers to grasp the different perspectives of the subject matter. Education should be inclusive and equal for all and so should joy and happiness! In today’s world where diversity is the key factor for almost every community, it is important for educators (teachers/instructors/administrators) to know what shapes students’ lives. This study encompassed the idea that only educating our students’ minds and bodies is not enough, and without spirituality the education is not complete. As Pamela Leigh (1997) stated, “..acknowledging that people come to work with more than their bodies and minds, they bring individual talents and unique spirits” (p. 26). Students also come with their unique spirits and we should take them as a whole and value them with all the qualities they possess. Nurturing their spirit should be part of our school system. No matter if they believe in God or not, educators should be ready to address the aspect of spirituality and religion. The research was to bring a greater understanding to questions such as how we can better accommodate students’ different spiritual beliefs, what the pros and cons are of bringing them together or keeping them separate. In order to answer these questions in a fashionable manner, we need to know “how much the spiritual beliefs of these students shape their cultures and their lives.” In a greater context, the questions like; what we really know about ‘true’ Islam as one of the fastest growing beliefs in the U.S., is it any different than other beliefs or is it the same, is there a way to eradicate the Islam-phobia that occurred after the 9/11 attack, what was the Ottoman Islamic model, were also answered. As educators, how do we cope with students who hear voices and start shooting around in a schoolyard, or students who binge drink or get suicidal? Even more importantly, how do we help the remaining population live a healthy and happy life without thinking of ending their own or others’ lives, as these examples turn out to be a daily life for us all! The remainder of this study looked at the “neutrality” of the school systems in the United States. Should educators stay neutral or not will be each individual’s decision to make.

No description available.

No description available.

In this paper we improve a goal-directed E-unification procedure by introducing a new rule, Cycle, for the case of collapsing equations, i.e. equations of the type x ≈ v where x ∈ Var (v). In the case of these equations some obviously unnecessary infinite paths of inferences were possible, because it was not known if the inference system was still complete if the inferences were not allowed into positions of x in v. Cycle does not allow such inferences and we prove that the system is complete. Hence we prove that as in other approaches, inferences into variable positions in our goal-directed procedure are not needed.

Although the Standard Model (SM) of particle physics describes observations well, there are several shortcomings of it. The most crucial of these are that the SM cannot explain the origin of neutrino masses and the existence of dark matter. Furthermore, there are several aspects of it that are seemingly ad hoc, such as the choice of gauge group and the cancellation of gauge anomalies. These shortcomings point to a theory beyond the SM. Although there are many proposed models for physics beyond the SM, in this thesis, we focus on grand unified theories based on the SO(10) gauge group. It predicts that the three gauge groups in the SM unify at a higher energy into one, which contains the SM as a subgroup. We focus on the Yukawa sector of these models and investigate the extent to which the observables such as fermion masses and mixing parameters can be accommodated into different models based on the SO(10) gauge group. Neutrino masses and leptonic mixing parameters are particularly interesting, since SO(10) models naturally embed the seesaw mechanism. The difference in energy scale between the electroweak scale and the scale of unification spans around 14 orders of magnitude. Therefore, one must relate the parameters of the SO(10) model to those of the SM through renormalization group equations. We investigate this for several different models by performing fits of SO(10) models to fermion masses and mixing parameters, taking into account thresholds at which heavy right-handed neutrinos are integrated out of the theory. Although the results are in general dependent on the particular model under consideration, there are some general results that appear to hold true. The observ- ables of the Yukawa sector can in general be accommodated into SO(10) models only if the neutrino masses are normally ordered and that inverted ordering is strongly disfavored. We find that the observable that provides the most tension in the fits is the leptonic mixing angle θ2l3, whose value is consistently favored to be lower in the fits than the actual value. Furthermore, we find that numerical fits to the data favor type-I seesaw over type-II seesaw for the generation of neutrino masses. / <p>Examinator: Professor Mark Pearce, Fysik, KTH</p>

Unification in the Description Logic (DL) FL₀ is known to be ExpTimecomplete, and of unification type zero. We investigate in this paper whether a lower complexity of the unification problem can be achieved by either syntactically restricting the role depth of concepts or semantically restricting the length of role paths in interpretations. We show that the answer to this question depends on whether the number formulating such a restriction is encoded in unary or binary: for unary coding, the complexity drops from ExpTime to PSpace. As an auxiliary result, which is however also of interest in its own right, we prove a PSpace-completeness result for a depth-restricted version of the intersection emptiness problem for deterministic root-to-frontier tree automata. Finally, we show that the unification type of FL₀ improves from type zero to unitary (finitary) for unification without (with) constants in the restricted setting.

Description Logics (DLs) [BCM+07] are prominent modeling formalisms underlying the Web Ontology Language (OWL). The lightweight DL EL in particular is used to formulate many biomedical ontologies. DLs allow to represent subconcept-superconcept relationships between concepts, e.g., diseases, as well as more complex correspondences. Unification in DLs has been proposed as a non-standard reasoning task to detect redundant concepts in ontologies [BN01, BM10b]. Recently, disunification in EL has been investigated and several algorithms were proposed to solve disunification problems [BBM16].

Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Description Logic EL to disunification since negative constraints on unifiers can be used to avoid unwanted unifiers. While decidability of the solvability of general EL-disunification problems remains an open problem, we obtain NP-completeness results for two interesting special cases: dismatching problems, where one side of each negative constraint must be ground, and local solvability of disunification problems, where we restrict the attention to solutions that are built from so-called atoms occurring in the input problem. More precisely, we first show that dismatching can be reduced to local disunification, and then provide two complementary NP-algorithms for finding local solutions of (general) disunification problems.

Unification with constants modulo the theory ACUI of an associative (A), commutative (C) and idempotent (I) binary function symbol with a unit (U) corresponds to solving a very simple type of set equations. It is well-known that solvability of systems of such equations can be decided in polynomial time by reducing it to satisfiability of propositional Horn formulae. Here we introduce a modified version of this problem by no longer requiring all equations to be completely solved, but allowing for a certain number of violations of the equations. We introduce three different ways of counting the number of violations, and investigate the complexity of the respective decision problem, i.e., the problem of deciding whether there is an assignment that solves the system with at most l violations for a given threshold value l. / Submitted to 30th International Workshop on Unification