We extend classical first-order logic with subtyping by type predicates and type coercion. Type predicates assert that the value of a term belongs to a more special type than the signature guarantees, while type coercion allows using terms of a more general type where the signature calls for a more special one. These operations are important e.g. in the specification and verification of object-...

Background Coercive measures may traumatize patients and may disturb their relationship to carers. To maintain a good therapeutic relationship and to help avoid future coercion carers should address the aftermath of coercion with the patients involved. Much variation exists regarding postincident treatment and Swiss data show that only about 30% of patients receive such treatment. Thus, the stu...

An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system are polymorphism and coercion between types. Recently the use of order-sorted rewrite systems was proposed as a general framework. We will give a quite simple example of a family of types arising in computer algebra whose coerc...