CENGO: a web-based serious game to increase the programming knowledge levels of computer engineering students

In recent years, games are used to increase the level of knowledge and experience of individuals working in different domains. Especially in the education field, there are several different serious games to teach the subjects of the lectures or other educational materials to students in an enjoyable way. Hence, this study proposes a quantitative research approach to increase the programming knowledge levels of the first-year undergraduate students at computer engineering departments. For this aim, a responsive web platform was developed to teach the syntax and logic of C programming language by using some game elements. Therefore, the students have a chance to repeat the topics related to C programming language continuously since the platform is always accessible. To figure out the efficiency of the designed environment, 10 first-year computer engineering students were selected. According to the results obtained from the user tests, this game can be used as an educational tool, which supports the traditional training methods, to increase the knowledge levels of students about the syntax and logic of C programming language

Coalition and coalition announcement logic

Dynamic epistemic logics which model abilities of agents to make various announcements and influence each other’s knowledge have been studied extensively in recent years. Two notable examples of such logics are Group Announcement Logic and Coalition Announcement Logic. They allow us to reason about what groups of agents can achieve through joint announcements in non-competitive and competitive environments. In this paper, we consider a combination of these logics – Coalition and Group Announcement Logic and provide its complete axiomatisation. Moreover, we partially answer the question of how group and coalition announcement operators interact, and settle some other open problems

Valid extensions of introspective systems: a foundation for reflective theorem provers

Introspective systems have been proved ueful in several applications, especially in the area of automated reasoning. In this paper we propose to use structured algebraic specifications to describe the embedded account of introspective systems. Our main result is that extending such an introspective system in a valid manner can be reduced to development of correct software. Since sound extension of automated reasoning systems again can be reduced to valid extension of introspective systems, our work can be seen as a foundation for extensible introspective reasoning systems, and in particular for reflective provers. We prove correctness of our mechanism and report on first experiences we have made with its realization in the KIV system (Karlsruhe Interactive Verifier)

Some Varieties of Superparadox. The implications of dynamic contradiction, the characteristic form of breakdown of breakdown of sense to which self-reference is prone

The Problem of the Paradoxes came to the fore in philosophy and mathematics with the discovery of Russell's Paradox in 1901. It is the "forgotten" intellectual-scientific problem of the Twentieth Century, because for more than sixty years a pretence was maintained, by a consensus of logicians, that the problem had been "solved"