A saturation property of structures obtained by forcing with a compact family of random variables

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10188759" target="_blank" >RIV/00216208:11320/13:10188759 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00153-012-0304-9" target="_blank" >http://dx.doi.org/10.1007/s00153-012-0304-9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00153-012-0304-9" target="_blank" >10.1007/s00153-012-0304-9</a>

Result language
angličtina
Original language name
A saturation property of structures obtained by forcing with a compact family of random variables
Original language description
A method for constructing Boolean-valued models of some fragments of arithmetic was developed in Krajicek (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 inKrajicek (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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)