A saturation property of structures obtained by forcing with a compact family of random variables
From MaRDI portal
Publication:1935366
Abstract: A method how to construct Boolean-valued models of some fragments of arithmetic was developed in Krajicek (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 K.(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.
Recommendations
Cites work
Cited in
(2)
This page was built for publication: A saturation property of structures obtained by forcing with a compact family of random variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935366)