We give a new method to enrich a logic with probability features in the context of a logic systems. Transference of results are addressed, such as completeness, decidability and model-checking. This method will be applied to obtain the probabilization of classic propositional logic (EPPL [P. Mateus, A. Sernadas, and C. Sernadas 2005]) of linear temporal logic (EPLTL), and mu-calculus (MEPL). The complexity of the SAT and model-checking algorithms for theses logics is examined. We briefly discuss how to quantize a logic by a similar process. Part of this work was done in cooperation with P. Mateus and R. Nagarajan.