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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Carnap, R., and Y. Bar Hillel. 1952. An outline of a theory of semantic information, Technical Report N. 247. Cambridge: M.I.T.
Goldman, S. 1953. Information theory. Englewood Cliffs.
Solomonoff, R. 1978. Complexity -based induction systems: Comparisons and convergence theorem. IEEE Transactions on Information Theory 24: 422–432.
Willis, D. 1970. Computational complexity and probability constructions. Journal of the ACM 17(2): 241–259.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht.
About this chapter
Cite this chapter
Carsetti, A. (2013). Randomness, Semantic Information and Limitation Procedures. In: Epistemic Complexity and Knowledge Construction. Theory and Decision Library A:, vol 45. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6013-4_3
Download citation
DOI: https://doi.org/10.1007/978-94-007-6013-4_3
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-6012-7
Online ISBN: 978-94-007-6013-4
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)