#### Filter Results:

- Full text PDF available (54)

#### Publication Year

1964

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sy-David Friedman, Ralf Schindler
- J. Symb. Log.
- 2003

Let n ≥ 3 be an integer. We show that it is consistent (relative to the consistency of n − 2 strong cardinals) that every Σ 1 n-set of reals is universally Baire yet there is a (lightface) projective well-ordering of the reals. The proof uses " David's trick " in the presence of inner models with strong cardinals.

- Samuel R. Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller
- J. Symb. Log.
- 2011

We give the first systematic study of strong isomorphism reductions , a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomor-phim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a… (More)

- Sy-David Friedman
- Bulletin of Symbolic Logic
- 2006

There are two standard ways to establish consistency in set theory. One is to prove consistency using inner models, in the way that Gödel proved the consistency of GCH using the inner model L. The other is to prove consistency using outer models, in the way that Cohen proved the consistency of the negation of CH by enlarging L to a forcing extension L[G].… (More)

- Sy-David Friedman, Radek Honzik
- Ann. Pure Appl. Logic
- 2008

The continuum function F on regular cardinals is known to have great freedom; if α, β are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F (α)) > α, (2) α < β → F (α) ≤ F (β). However, if we wish to preserve measurable cardinals in the generic extension, new restrictions must be put on F. We say that κ is F… (More)

- Ekaterina B. Fokina, Sy-David Friedman
- Math. Log. Q.
- 2012

We study the structure of Σ 1 1 equivalence relations on hyperarith-metical subsets of ω under reducibilities given by hyperarithmetical or computable functions, called h-reducibility and FF-reducibility, respectively. We show that the structure is rich even when one fixes the number of properly Σ 1 1 (i.e. Σ 1 1 but not ∆ 1 1) equivalence classes. We also… (More)

- Tatiana Arrigoni, Sy-David Friedman
- Bulletin of Symbolic Logic
- 2013

- Sy-David Friedman, Mohammad Golshani
- J. Symb. Log.
- 2013

Shelah-Woodin [10] investigate the possibility of violating instances of GCH through the addition of a single real. In particular they show that it is possible to obtain a failure of CH by adding a single real to a model of GCH, preserving cofinalities. In this article we strengthen their result by showing that it is possible to violate GCH at all infinite… (More)

- Ekaterina B. Fokina, Sy-David Friedman
- CiE
- 2009

If L is a finite relational language then all computable L-structures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-structure B an index n of its iso-morphic copy An can be found effectively and uniformly. Having such a universal computable numbering, we can identify computable structures with their indices in… (More)

- Ekaterina B. Fokina, Sy-David Friedman, Asger Törnquist
- Ann. Pure Appl. Logic
- 2010

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-Kechris-Louveau ([5]) show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on P(ω), the power set of ω, and… (More)

- Sy-David Friedman, Katherine Thompson
- J. Symb. Log.
- 2008

An important technique in large cardinal set theory is that of extending an elementary embedding j : M → N between inner models to an elementary embedding j * : M [G] → N [G * ] between generic extensions of them. This technique is crucial both in the study of large cardinal preservation and of internal consistency. In easy cases, such as when forcing to… (More)