A Groszek-Laver pair of undistinguishable E0-classes

نویسندگان

  • Mohammad Golshani
  • Vladimir Kanovei
  • Vassily A. Lyubetsky
چکیده

A generic extension L[x, y] of L by reals x, y is defined, in which the union of E0 -classes of x and y is a Π 2 set, but neither of these two E0 -classes is separately ordinal-definable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

E0-dilation of strongly commuting CP0-semigroups

We prove that every strongly commuting pair of CP0-semigroups has a minimal E0-dilation. This is achieved in two major steps, interesting in themselves: 1: we show that a strongly commuting pair of CP0semigroups can be represented via a two parameter product system representation; 2: we prove that every fully coisometric product system representation has a fully coisometric, isometric dilation....

متن کامل

Notes of course at IHP: Applications of noncommutative topology in geometry and string theory

ing from the examples we have seen,topologists define twisted cohomology theoriesas follows. In a reasonable category of spaces(say those homotopy equivalent to CW com-plexes), any cohomology theory X 7→ E∗(X) isrepresentable by a representing object E calleda spectrum. (There is no connection withthe spectrum of an element of a Banach al-gebra, or the word “spec...

متن کامل

How within-city socioeconomic disparities affect life expectancy? Results of Urban HEART in Tehran, Iran

  Background :There is substantial lack of knowledge about the role of socioeconomic status (SES) indicators on life expectancy (LE) within-cities, especially within mega-cities. We aimed to investigate the disparities of LE within city districts of Tehran, Iran, and specify how SES inequalities play role on LE.   Methods : The death and population data for 2010 by different age, gender, and re...

متن کامل

On a Question of Slaman and Groszek

We answer a question of Slaman and Groszek by showing that any non-computable perfect tree computes one of its noncomputable paths.

متن کامل

A basis theorem for perfect sets

We show that if there is a nonconstructible real, then every perfect set has a nonconstructible element, answering a question of K. Prikry. This is a specific instance of a more general theorem giving a sufficient condition on a pair M ⊂ N of models of set theory implying that every perfect set in N has an element in N which is not in M .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Log. Q.

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2017