Biomasse e loro quantificazione economica per un efficiente uso dell'energia

Biomasses and their possible use as energy resource are of great interest today, and the general problem of energy resources as well. In the present study the key questions of the convenience, from both energy and economy standpoints, have been addressed without any bias: the problem has been handled starting from “philosophical” bases disregarding any pre-settled ideology or political trend, but simply using mathematical approaches as logical tools for defining balances in a right way. In this context quantitative indexes such as LCA and EROEI have been widely used, together with multicriteria methods (such as ELECTRE) as decision supporting tools. This approach permits to remove mythologies, such as the unrealistic concept of clean energy, or the strange idea of biomasses as a magic to solve every thing in the field of the energy. As a consequence the present study aims to find any relevant aspect potentially useful for the society, looking at any possible source of energy without prejudices but without unrealistic expectations too. For what concerns biomasses, we studied in great details four very different cases of study, in order to have a scenario as various as much we can. A relevant result is the need to use biomasses together with other more efficient sources, especially recovering by-products from silviculture activities: but attention should be paid to the transportation and environmental costs. Another relevant result is the very difficult possibility of reliable evaluation of dedicated cultures as sources for “biomasses for energy”: the problem has to be carefully evaluated case-by-case, because what seems useful in a context, becomes totally disruptive in another one. In any case the concept itself of convenience is not well defined at a level of macrosystem: it seems more appropriate to limit this very concept at a level of microsystem, considering that what sounds fine in a limited well defined microsystem may cause great damage in another slightly different, or even very similar, microsystem. This approach seems the right way to solve the controversy about the concept of convenience.

Towards a logical foundation of randomized computation

This dissertation investigates the relations between logic and TCS in the probabilistic setting. It is motivated by two main considerations. On the one hand, since their appearance in the 1960s-1970s, probabilistic models have become increasingly pervasive in several fast-growing areas of CS. On the other, the study and development of (deterministic) computational models has considerably benefitted from the mutual interchanges between logic and CS. Nevertheless, probabilistic computation was only marginally touched by such fruitful interactions. The goal of this thesis is precisely to (start) bring(ing) this gap, by developing logical systems corresponding to specific aspects of randomized computation and, therefore, by generalizing standard achievements to the probabilistic realm. To do so, our key ingredient is the introduction of new, measure-sensitive quantifiers associated with quantitative interpretations. The dissertation is tripartite. In the first part, we focus on the relation between logic and counting complexity classes. We show that, due to our classical counting propositional logic, it is possible to generalize to counting classes, the standard results by Cook and Meyer and Stockmeyer linking propositional logic and the polynomial hierarchy. Indeed, we show that the validity problem for counting-quantified formulae captures the corresponding level in Wagner's hierarchy. In the second part, we consider programming language theory. Type systems for randomized \lambda-calculi, also guaranteeing various forms of termination properties, were introduced in the last decades, but these are not "logically oriented" and no Curry-Howard correspondence is known for them. Following intuitions coming from counting logics, we define the first probabilistic version of the correspondence. Finally, we consider the relationship between arithmetic and computation. We present a quantitative extension of the language of arithmetic able to formalize basic results from probability theory. This language is also our starting point to define randomized bounded theories and, so, to generalize canonical results by Buss.