Tanzania has a law governing the admissibility of electronic evidence. This brought several changes. It provides for manner in which evidence may be admitted. also prescribes requirements determining authenticity But seems to incomplete and wrong some instances. obscures procedure laying foundation before its admission into Moreover, it ignores role digital professionals handling Furthermore, r...

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling and evaluating argumentation allowing general logical satisfaction conditions. Different criteria used to settle the acceptance of arguments are called semantics. Semantics ADFs so far mainly defined based on concept admissibility. Recently, notion strong admissibility has ADFs. In current work we study comp...

Theories of rational choice are often based on the assumption that the agent’s choices are reducible to a preference ordering on the set of alternatives. This assumption is reflected in work from a variety of disciplines including economics [19], psychology [15], and statistics [32], as well as in philosophy where the “logic of preference” is an established topic of study [12]. However, a persi...

1 I n t r o d u c t i o n Iterated admissibility (weak dominance) is a long-standing and attractive solution concept, making strong predictions in many games, e.g. the forward° induction path in signalling games and the backward-induction path in perfect° information trees. Yet its logical basis has remained unclear. The dlmculty appears to be this. The 'philosophy' behind iterated admissibilit...

Checking if a quasiequation is admissible in a finite algebra is a decidable problem, but the naive approach, i.e., checking validity in the corresponding free algebra, is computationally unfeasible. We give an algorithm for obtaining smaller algebras to check admissibility and a range of examples to demonstrate the advantages of this approach.