Repository | Book | Chapter
Randomness, semantic information and limitation procedures
pp. 49-80
Abstract
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.
Publication details
Published in:
Carsetti Arturo (2013) Epistemic complexity and knowledge construction: morphogenesis, symbolic dynamics and beyond. Dordrecht, Springer.
Pages: 49-80
DOI: 10.1007/978-94-007-6013-4_3
Full citation:
Carsetti Arturo (2013) Randomness, semantic information and limitation procedures, In: Epistemic complexity and knowledge construction, Dordrecht, Springer, 49–80.