Learning programming is thought to be troublesome. One doable reason why students don’t do well in programming is expounded to the very fact that traditional way of learning within the lecture hall adds more stress on students in understanding the Material rather than applying the Material to a true application. For a few students, this teaching model might not catch their interest. As a result, they'll not offer their best effort to grasp the Material given. Seeing however the information is (...) applied to real issues will increase student interest in learning. As a consequence, this may increase their effort to be taught. In the current paper, we try to help students learn C# programming language using Intelligent Tutoring System. This ITS was developed using ITSB authoring tool to be able to help the student learn programming efficiently and make the learning procedure very pleasing. A knowledge base using ITSB authoring tool style was used to represent the student's work and to give customized feedback and support to students. (shrink)
El artículo propone una interpretación de la obra literaria "Las Crónicas de Narnia" del autor ingles C. S Lewis. Tal interpretación posibilita considerar la alegoría religiosa que esta obra literaria realiza sobre la experiencia de la divinidad a través de la figura del León.
It is often argued that the great quantity of evil in our world makes God’s existence less likely than a lesser quantity would, and this, presumably, because the probability that some evils are gratuitous increases as the overall quantity of evil increases. Often, an additive approach to quantifying evil is employed in such arguments. In this paper, we examine C. S. Lewis’ objection to the additive approach, arguing that although he is correct to reject this approach, there is a sense (...) in which he underestimates the quantity of pain. However, the quantity of pain in that sense does not significantly increase the probability that some pain is gratuitous. Therefore, the quantitative argument likely fails. (shrink)
For each natural number n, let C (n) be the closed and unbounded proper class of ordinals α such that V α is a Σ n elementary substructure of V. We say that κ is a C (n) -cardinal if it is the critical point of an elementary embedding j : V → M, M transitive, with j(κ) in C (n). By analyzing the notion of C (n)-cardinal at various levels of the usual hierarchy of large cardinal principles we show (...) that, starting at the level of superstrong cardinals and up to the level of rank-into-rank embeddings, C (n)-cardinals form a much finer hierarchy. The naturalness of the notion of C (n)-cardinal is exemplified by showing that the existence of C (n)-extendible cardinals is equivalent to simple reflection principles for classes of structures, which generalize the notions of supercompact and extendible cardinals. Moreover, building on results of Bagaria et al. (2010), we give new characterizations of Vopeňka’s Principle in terms of C (n)-extendible cardinals. (shrink)