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

DOI10.1007/S00153-012-0304-9zbMATH Open1268.03045arXiv1207.1548OpenAlexW2068961663MaRDI QIDQ1935366FDOQ1935366

Jan Krajíček

Publication date: 15 February 2013

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1207.1548

zbMATH Keywords

saturation propertynonstandard model of arithmeticBoolean-valued structures

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Nonstandard models of arithmetic (03H15) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90)

Cites Work

• Title not available (Why is that?)
• Model Theory
• Title not available (Why is that?)
• Algebraic treatment of the notion of satisfiability

Cited In (1)

• On some composite Kies families: distributional properties and saturation in Hausdorff sense

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)