L be a classical (two-valued) first-order language that contains a family p of predicates. From a general point of view, the set F of all formulas at the level of the two-valued predicate calculus becomes, as is well known, a Boolean algebra after identification of equivalent formulas." /> Randomness, semantic information and limitation procedures - Carsetti Arturo | sdvig press

Randomness, semantic information and limitation procedures

Arturo Carsetti

pp. 49-80

Full Text
Download
Other Editions

Text

This document is unfortunately not available for download at the moment.

Not implemented yet !