We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an information system. We outline a construction of proof systems for SHn logics, mv−algebras and many−valued information systems.