I. Basic concepts 1. Recursive enumerability and recursiveness. We consider infinite sequences of non-negative integers, free from repetitions. A familiar equivalence relation between such sequences is that based on sets: two sequences are equivalent when they enumerate the same set. The equivalence classes under this relation, with the necessary operations introduced, form a system isomorphic ...

Formal methods have proved their usefulness for analyzing the security of protocols. Most existingresults focus on trace properties like secrecy or authentication. There are however several securityproperties, which cannot be de ned (or cannot be naturally de ned) as trace properties and requirea notion of behavioural equivalence. Typical examples are anonymity, privacy related prop...

Previous studies have investigated the viability of a go/ no-go discrimination procedure (pREP) for generating stimulus equivalence. During pREP training, participants receive positive feedback for pressing a bar after the successive presentation of two same-class stimuli and for not pressing after the presentation of two different-class stimuli. During pREP testing, the procedures are the same...