Randomness, semantic information and limitation procedures
pp. 49-80
in: , Epistemic complexity and knowledge construction, Berlin, Springer, 2013Abstract
Let 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.