Abstract
A method for constructing Boolean-valued models of some fragments of arithmetic was developed in Krajíček (Forcing with Random Variables and Proof Complexity, London Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge, 2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random variables defined on a pseudo-finite sample space. We show that under a fairly natural condition on the family [called compactness in Krajíček (Forcing with Random Variables and Proof Complexity, London Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge, 2011)] the resulting structure has a property that is naturally interpreted as saturation for existential types. We also give an example showing that this cannot be extended to universal types.
Similar content being viewed by others
References
Boole G.: The Mathematical Analysis of Logic. Barclay and Macmillan, Cambridge (1847)
Krajíček, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory, Encyclopedia of Mathematics and Its Applications, vol. 60. Cambridge University Press, Cambridge (1995)
Krajíček, J.: Forcing with Random Variables and Proof Complexity, London Mathematical Society Lecture Notes Series, vol. 382. Cambridge University Press, Cambridge (2011)
Marker D.: Model Theory: An Introduction. Grad. Texts in Mathematics. Springer, Berlin (2002)
Rasiowa H., Sikorski R.: Algebraic treatment of the notion of satisfiability. Fundamenta Mathematicae 40, 62–65 (1953)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by grant IAA100190902. Also partially affiliated with the Institute of Mathematics of the Academy of Sciences.
Rights and permissions
About this article
Cite this article
Krajíček, J. A saturation property of structures obtained by forcing with a compact family of random variables. Arch. Math. Logic 52, 19–28 (2013). https://doi.org/10.1007/s00153-012-0304-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-012-0304-9