Abstract
A probability distribution can be given to the set of isomorphism classes of models with universe {1, ..., n} of a sentence in first-order logic. We study the entropy of this distribution and derive a result from the 0–1 law for first-order sentences.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ebbinghaus H-D., Flum J.: Finite Model Theory, 2nd Edn. Springer, Berlin (1999)
Fagin R.: Probabilities on finite models. J. Symbolic Logic 41, 50–58 (1976)
Frank O., Öhrvik J.: Entropy of sums of random digits. Comput. Stat. Data Anal. 17, 177–184 (1994)
Glebskii Y.V., Kogan D.I., Liogonkii M.I., Talanov V.A.: Volume and fraction of satisfiability of formulas of the lower predicate calculus. Kibernetyka 2, 17–27 (1969)
Hodges W.: Model theory. Cambridge University Press, New York (1993)
Jones G.A., Jones J.M.: Information and coding theory. Springer, Berlin (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Koponen, V. Entropy of formulas. Arch. Math. Logic 48, 515–522 (2009). https://doi.org/10.1007/s00153-009-0135-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-009-0135-5