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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F13%3A00395501" target="_blank" >RIV/67985840:_____/13:00395501 - isvavai.cz</a>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/IAA100190902" target="_blank" >IAA100190902: Matematická logika, složitost a algoritmy</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

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

Název periodika

Archive for Mathematical Logic

ISSN

1432-0665

e-ISSN

—

Svazek periodika

52

Číslo periodika v rámci svazku

1-2

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

10

Strana od-do

19-28

Kód UT WoS článku

000318365900002

EID výsledku v databázi Scopus

—