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

Archive for Mathematical Logic 52 (1-2):19-28 (2013)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Generalizations of small profinite structures.Krzysztof Krupiński - 2010 - Journal of Symbolic Logic 75 (4):1147-1175.
A saturation property of ideals and weakly compact cardinals.Joji Takahashi - 1986 - Journal of Symbolic Logic 51 (3):513-525.
Pseudo-finite homogeneity and saturation.Jörg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
Mathias absoluteness and the Ramsey property.Lorenz Halbeisen & Haim Judah - 1996 - Journal of Symbolic Logic 61 (1):177-194.
The tree property at א ω+2.Sy-David Friedman & Ajdin Halilović - 2011 - Journal of Symbolic Logic 76 (2):477 - 490.
A theorem on the isomorphism property.Renling Jin - 1992 - Journal of Symbolic Logic 57 (3):1011-1017.
Limit ultrapowers and abstract logics.Paolo Lipparini - 1987 - Journal of Symbolic Logic 52 (2):437-454.

Analytics

Added to PP
2013-10-27

Downloads
39 (#356,773)

6 months
2 (#670,035)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The mathematical analysis of logic.George Boole - 1948 - Oxford,: Philosophical Library.
Algebraic Treatment of the Notion of Satisfiability.H. Rasiowa & R. Sikorski - 1955 - Journal of Symbolic Logic 20 (1):78-80.

Add more references