This lunchtalk focuses on two related aims. (1) Most of the oldest propositional paraconsistent logics (as well as some other logics) had an indeterministic semantics. In this lunchtalk I offer a method to transform the models of a large family of two-valued indeterministic semantics (for propositional as well as for predicative logics) to models of a deterministic semantics. It is warranted that every model verifies the same formulas as its transformation. (2) A family of such semantic systems can also be transformed into 3/4-valued systems. This transformation too warrants that the transformed models verify the same formulas as the original ones. Moreover the 3/4-valued semantic systems lead to a very simple approach to corrective adaptive logics.