A Gift is not always a Gift: Heterogeneity and Long Term Effects in a Gift Exchange Experiment

We study gift exchange in a field experiment where a random subsample of participants in the Swiss Labour Force Survey received vouchers to be used in adult training. Actual voucher redemption can be traced, giving us the unique opportunity to study whether gift exchange in the form of participation in future rounds of the survey depends on the perceived usefulness of the gift. The group of voucher recipients as a whole has significantly higher response rates. There is considerable heterogeneity, however. Our results point to a long-lasting gift exchange relationship only for the subgroup that redeemed their vouchers.

Admissibility in Finitely Generated Quasivarieties

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable. However, since free algebras may be large even for small sets of small algebras and very few generators, this naive method for checking admissibility in Q is not computationally feasible. In this paper, algorithms are introduced that generate a minimal (with respect to a multiset well-ordering on their cardinalities) finite set of algebras such that the validity of a quasiequation in this set corresponds to admissibility of the quasiequation in Q. In particular, structural completeness (validity and admissibility coincide) and almost structural completeness (validity and admissibility coincide for quasiequations with unifiable premises) can be checked. The algorithms are illustrated with a selection of well-known finitely generated quasivarieties, and adapted to handle also admissibility of rules in finite-valued logics.

Always on: Cybermobbing in der modernen Gesellschaft

Cybermobbing ist ein brisantes Thema, das seit über einem Jahrzehnt weltweit für Aufsehen sorgt. Es handelt sich um eine elektronische Mobbingvariante, die vom Versenden einer beleidigenden SMS bis hin zum Veröffentlichen von peinlichen Videos auf YouTube oder Facebook geht. Cybermobbing kann als ungünstiges Nebenprodukt des gesellschaftlichen Wandels hin zur digitalen Kommunikation gesehen werden. Cybermobbing ist deswegen nicht nur ein individuelles, sondern auch ein gesellschaftliches Problem, das in diesem größeren Rahmen betrachtet werden muss. Sowohl das Individuum als auch die Familie, die Gleichaltrigen, die Schule und der gesellschaftliche Kontext sind wichtige Akteure einerseits bei Entstehung und Aufrechterhaltung von Cybermobbing, andererseits bei dessen Prävention und Intervention.

Propositional and situational representations of text

Two informationally equivalent texts were constructed which described a fictitious town, emphasizing its spatial layout. In one version (Survey text), spatial information was in geographic terms, while in the other version (Route text), the equivalent information was provided in the form of directions for driving through the town. Subjects recalled these texts and verified old as well as inference statements. In Experiment I, subjects were able to recall the texts quite well, while showing little ability to use the information they had acquired to make inferences about spatial relations in the town which had not been directly stated in the text. With simpler texts, subjects in Experiment II were able to make infereces, especially when the form of the question corresponded to the version of the text they had read. It was concluded that free recall depended on the construction of a propositional textbase during comprehension, while inferences required a situation model, either in the form of a mental map or a procedural representation of the town. It could be shown that the form of the situation model depended on both the representation invited by the text and subject biases.

Justifying induction on modal μ-formulae

We define a rank function for formulae of the propositional modal μ-calculus such that the rank of a fixed point is strictly bigger than the rank of any of its finite approximations. A rank function of this kind is needed, for instance, to establish the collapse of the modal μ-hierarchy over transitive transition systems. We show that the range of the rank function is ωω. Further we establish that the rank is computable by primitive recursion, which gives us a uniform method to generate formulae of arbitrary rank below ωω.