Given the increasing use of technology and the digitalization of international trade through electronic documents, there is a need for a globally harmonized standard that caters for the legal aspects of digitalization. The Model Law on Electronic Transferable Records (MLETR) is one such law. Yet, it has not been adopted in Nigeria or several other jurisdictions. This article considers the possibility of Nigeria adopting the MLETR. To do this, the article considers the meaning of electronic transferable documents and the legal implications of digitalizing them. The article also examines the barriers and challenges to digitalizing electronic transferable records. It then considers some of the laws in Nigeria that would support electronic and digital trade transactions. Subsequently, the article highlights the benefits, challenges and hindrances to the adoption of the MLETR in Nigeria. It recommends an approach to adopting the MLETR, drawing from jurisdictions that have adopted it.

Many tasks in statistical and causal inference can be construed as problems of entailment in a suitable formal language. We ask whether those problems are more difficult, from a computational perspective, for causal probabilistic languages than for pure probabilistic (or “associational”) languages. Despite several senses in which causal reasoning is indeed more complex—both expressively and inferentially—we show that causal entailment (or satisfiability) problems can be systematically and robustly reduced to purely probabilistic problems. Thus there is no jump in computational complexity. Along the way we answer several open problems concerning the complexity of well-known probability logics, in particular demonstrating the ${\exists \mathbb {R}}$-completeness of a polynomial probability calculus, as well as a seemingly much simpler system, the logic of comparative conditional probability.