Summary: {\it Z. Pawlak} had proposed the notion of rough truth in 1987 [Bull. Pol. Acad. Sci., Tech. Sci. 35, 253--258 (1987;

Zbl 0645.03019)]. The present article takes a fresh look at this “soft” truth, and presents a formal system ${\cal L}_{\cal R}$ that is shown to be sound and complete with respect to a semantics determined by this notion. ${\cal L}_{\cal R}$ is based on the modal logic S5. Notable are the rough consequence relation defining ${\cal L}_{\cal R}$, and rough consistency (introduced in [{\it M. K. Chakraborty} and {\it M. Banerjee}, Bull. Pol. Acad. Sci., Math. 41, 299--304 (1993;

Zbl 0795.03036)]), used to prove the completeness result. The former is defined in order to be able to derive roughly true propositions from roughly true premisses in an information system. The motivation for the latter stems from the observation that a proposition and its negation may well be roughly true together. A characterization of ${\cal L}_{\cal R}$-consequence shows that the paraconsistent discussive logic $J$ of Jaśkowski is equivalent to ${\cal L}_{\cal R}$. So, ${\cal L}_{\cal R}$, developed from a totally independent angle, viz. that of rough set theory, gives an alternative formulation to this well-studied logic. It is further observed that pre-rough logic [{\it M. Banerjee} and {\it M. K. Chakraborty}, Ann. Soc. Math., Ser. IV, Fundam. Inf. 28, 211--221 (1996;

Zbl 0864.03041)] and 3-valued Ł ukasiewicz logic are also embeddable into ${\cal L}_{\cal R}$.