100 found
Order:
  1. David Asperó & Sy-David Friedman (2012). Definable Well-Orders of $H(\Omega _2)$ and $GCH$. Journal of Symbolic Logic 77 (4):1101-1121.
    Assuming ${2^{{N_0}}}$ = N₁ and ${2^{{N_1}}}$ = N₂, we build a partial order that forces the existence of a well-order of H(ω₂) lightface definable over ⟨H(ω₂), Є⟩ and that preserves cardinal exponentiation and cofinalities.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  2. Sy D. Friedman (1994). The Genericity Conjecture. Journal of Symbolic Logic 59 (2):606-614.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  3
    Sy-David Friedman & Philipp Lücke (2015). Large Cardinals and Definable Well-Orders, Without the GCH. Annals of Pure and Applied Logic 166 (3):306-324.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  4.  2
    Sy-David Friedman & Radek Honzik (2008). Easton's Theorem and Large Cardinals. Annals of Pure and Applied Logic 154 (3):191-208.
    The continuum function αmaps to2α on regular cardinals is known to have great freedom. Let us say that F is an Easton function iff for regular cardinals α and β, image and α<β→F≤F. The classic example of an Easton function is the continuum function αmaps to2α on regular cardinals. If GCH holds then any Easton function is the continuum function on regular cardinals of some cofinality-preserving extension V[G]; we say that F is realised in V[G]. However if we also wish (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  5.  5
    Sy-David Friedman & Katherine Thompson (2008). Perfect Trees and Elementary Embeddings. Journal of Symbolic Logic 73 (3):906-918.
    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 make the GCH hold while preserving a measurable cardinal (via a reverse Easton iteration of α-Cohen forcing for successor cardinals α), the (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  6.  8
    Ekaterina B. Fokina, Sy-David Friedman & Asger Törnquist (2010). The Effective Theory of Borel Equivalence Relations. Annals of Pure and Applied Logic 161 (7):837-850.
    The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver [20] and Harrington, Kechris and Louveau [6] show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on , the power set of ω, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on . In this article we examine the effective (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  7.  43
    Tatiana Arrigoni & Sy-David Friedman (2013). The Hyperuniverse Program. Bulletin of Symbolic Logic 19 (1):77-96.
    The Hyperuniverse Program is a new approach to set-theoretic truth which is based on justifiable principles and leads to the resolution of many questions independent from ZFC. The purpose of this paper is to present this program, to illustrate its mathematical content and implications, and to discuss its philosophical assumptions.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  8.  13
    Vera Fischer & Sy David Friedman (2010). Cardinal Characteristics and Projective Wellorders. Annals of Pure and Applied Logic 161 (7):916-922.
    Using countable support iterations of S-proper posets, we show that the existence of a definable wellorder of the reals is consistent with each of the following: , and.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  9.  16
    Sy-David Friedman (2006). Internal Consistency and the Inner Model Hypothesis. Bulletin of Symbolic Logic 12 (4):591-600.
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  10.  12
    Sy-David Friedman & Menachem Magidor (2009). The Number of Normal Measures. Journal of Symbolic Logic 74 (3):1069-1080.
    There have been numerous results showing that a measurable cardinal κ can carry exactly α normal measures in a model of GCH, where a is a cardinal at most κ⁺⁺. Starting with just one measurable cardinal, we have [9] (for α = 1), [10] (for α = κ⁺⁺, the maximum possible) and [1] (for α = κ⁺, after collapsing κ⁺⁺) . In addition, under stronger large cardinal hypotheses, one can handle the remaining cases: [12] (starting with a measurable cardinal of (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  11.  6
    Vincenzo Dimonte & Sy-David Friedman (2014). Rank-Into-Rank Hypotheses and the Failure of GCH. Archive for Mathematical Logic 53 (3-4):351-366.
  12.  7
    Sy-David Friedman, Philip Welch & W. Woodin (2008). On the Consistency Strength of the Inner Model Hypothesis. Journal of Symbolic Logic 73 (2):391-400.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  13.  11
    Sy-David Friedman, Michael Rathjen & Andreas Weiermann (2013). Slow Consistency. Annals of Pure and Applied Logic 164 (3):382-393.
    The fact that “natural” theories, i.e. theories which have something like an “idea” to them, are almost always linearly ordered with regard to logical strength has been called one of the great mysteries of the foundation of mathematics. However, one easily establishes the existence of theories with incomparable logical strengths using self-reference . As a result, PA+Con is not the least theory whose strength is greater than that of PA. But still we can ask: is there a sense in which (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  14.  1
    Sy-David Friedman & Ajdin Halilović (2011). The Tree Property at א Ω+2. Journal of Symbolic Logic 76 (2):477 - 490.
    Assuming the existence of a weakly compact hypermeasurable cardinal we prove that in some forcing extension א ω is a strong limit cardinal and א ω+2 has the tree property. This improves a result of Matthew Foreman (see [2]).
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  15.  17
    Carolin Antos, Sy-David Friedman, Radek Honzik & Claudio Ternullo (2015). Multiverse Conceptions in Set Theory. Synthese 192 (8):2463-2488.
    We review different conceptions of the set-theoretic multiverse and evaluate their features and strengths. In Sect. 1, we set the stage by briefly discussing the opposition between the ‘universe view’ and the ‘multiverse view’. Furthermore, we propose to classify multiverse conceptions in terms of their adherence to some form of mathematical realism. In Sect. 2, we use this classification to review four major conceptions. Finally, in Sect. 3, we focus on the distinction between actualism and potentialism with regard to the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16.  17
    Vera Fischer, Sy David Friedman & Lyubomyr Zdomskyy (2011). Projective Wellorders and Mad Families with Large Continuum. Annals of Pure and Applied Logic 162 (11):853-862.
    We show that is consistent with the existence of a -definable wellorder of the reals and a -definable ω-mad subfamily of [ω]ω.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  17.  12
    Sy David Friedman, Radek Honzik & Lyubomyr Zdomskyy (2012). Fusion and Large Cardinal Preservation. Annals of Pure and Applied Logic 2 (12):1247-1273.
    In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size ⩽κ not only does not collapse κ+ but also preserves the strength of κ . This provides a general theory covering the known cases of tree iterations which preserve large cardinals [3], Friedman and Halilović [5], Friedman and Honzik [6], Friedman and Magidor [8], Friedman and Zdomskyy [10], Honzik [12]).
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  18.  10
    Sy-David Friedman (2012). The Stable Core. Bulletin of Symbolic Logic 18 (2):261-267.
    Vopenka [2] proved long ago that every set of ordinals is set-generic over HOD, Gödel's inner model of hereditarily ordinal-definable sets. Here we show that the entire universe V is class-generic over, and indeed over the even smaller inner model $\mathbb{S}=$, where S is the Stability predicate. We refer to the inner model $\mathbb{S}$ as the Stable Core of V. The predicate S has a simple definition which is more absolute than any definition of HOD; in particular, it is possible (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  19.  4
    Natasha Dobrinen & Sy-David Friedman (2008). Homogeneous Iteration and Measure One Covering Relative to HOD. Archive for Mathematical Logic 47 (7-8):711-718.
    Relative to a hyperstrong cardinal, it is consistent that measure one covering fails relative to HOD. In fact it is consistent that there is a superstrong cardinal and for every regular cardinal κ, κ + is greater than κ + of HOD. The proof uses a very general lemma showing that homogeneity is preserved through certain reverse Easton iterations.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  20.  13
    Ekaterina B. Fokina, Sy-David Friedman, Valentina Harizanov, Julia F. Knight, Charles McCoy & Antonio Montalbán (2012). Isomorphism Relations on Computable Structures. Journal of Symbolic Logic 77 (1):122-132.
    We study the complexity of the isomorphism relation on classes of computable structures. We use the notion of FF-reducibility introduced in [9] to show completeness of the isomorphism relation on many familiar classes in the context of all ${\mathrm{\Sigma }}_{1}^{1}$ equivalence relations on hyperarithmetical subsets of ω.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  21.  6
    Ekaterina B. Fokina & Sy‐David Friedman (2012). On Σ11 Equivalence Relations Over the Natural Numbers. Mathematical Logic Quarterly 58 (1‐2):113-124.
    We study the structure of Σ11 equivalence relations on hyperarithmetical 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 equation imagei.e., Σ11 but not equation image equivalence classes. We also show the existence of incomparable Σ11 equivalence relations that are complete as subsets of ω × ω with respect to the corresponding reducibility on sets. We study complete Σ11 (...)
    No categories
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  22.  1
    David Asperó & Sy-David Friedman (2009). Large Cardinals and Locally Defined Well-Orders of the Universe. Annals of Pure and Applied Logic 157 (1):1-15.
    By forcing over a model of with a class-sized partial order preserving this theory we produce a model in which there is a locally defined well-order of the universe; that is, one whose restriction to all levels H is a well-order of H definable over the structure H, by a parameter-free formula. Further, this forcing construction preserves all supercompact cardinals as well as all instances of regular local supercompactness. It is also possible to define variants of this construction which, in (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  23.  18
    Sy-David Friedman & Lyubomyr Zdomskyy (2010). Projective Mad Families. Annals of Pure and Applied Logic 161 (12):1581-1587.
    Using almost disjoint coding we prove the consistency of the existence of a definable ω-mad family of infinite subsets of ω together with.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  24.  10
    Yong Cheng, Sy-David Friedman & Joel David Hamkins (2015). Large Cardinals Need Not Be Large in HOD. Annals of Pure and Applied Logic 166 (11):1186-1198.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  25.  23
    Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman & Moritz Müller (2011). Strong Isomorphism Reductions in Complexity Theory. Journal of Symbolic Logic 76 (4):1381-1402.
    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 isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n in both (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  26.  18
    Sy-David Friedman & Mohammad Golshani (2012). Independence of Higher Kurepa Hypotheses. Archive for Mathematical Logic 51 (5-6):621-633.
    We study the Generalized Kurepa hypothesis introduced by Chang. We show that relative to the existence of an inaccessible cardinal the Gap-n-Kurepa hypothesis does not follow from the Gap-m-Kurepa hypothesis for m different from n. The use of an inaccessible is necessary for this result.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  27.  16
    Sy D. Friedman (2005). Genericity and Large Cardinals. Journal of Mathematical Logic 5 (02):149-166.
  28.  15
    Tatiana Arrigoni & Sy-David Friedman (2012). Foundational Implications of the Inner Model Hypothesis. Annals of Pure and Applied Logic 163 (10):1360-1366.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  29. Sy-David Friedman & Luca Motto Ros (2011). Analytic Equivalence Relations and Bi-Embeddability. Journal of Symbolic Logic 76 (1):243 - 266.
    Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of L ω ₁ ω ) is far from complete (see [5, 2]). In (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  30. Sy-David Friedman & Luca Motto Ros (2011). Analytic Equivalence Relations and Bi-Embeddability. Journal of Symbolic Logic 76 (1):243-266.
    Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of ℒω1ω) is far from complete (see [5, 2]). In this article we strengthen (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  7
    Sy D. Friedman (2002). 0# and Inner Models. Journal of Symbolic Logic 67 (3):924 - 932.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  32.  13
    Sy D. Friedman (1997). Coding Without Fine Structure. Journal of Symbolic Logic 62 (3):808-815.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  33.  17
    Sy-David Friedman, Philip Welch & W. Hugh Woodin (2008). On the Consistency Strength of the Inner Model Hypothesis. Journal of Symbolic Logic 73 (2):391 - 400.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  34.  12
    Sy-David Friedman, Peter Koepke & Boris Piwinger (2006). Hyperfine Structure Theory and Gap 1 Morasses. Journal of Symbolic Logic 71 (2):480 - 490.
    Using the Friedman-Koepke Hyperfine Structure Theory of [2], we provide a short construction of a gap 1 morass in the constructible universe.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  35.  12
    Vera Fischer, Sy David Friedman & Lyubomyr Zdomskyy (2013). Cardinal Characteristics, Projective Wellorders and Large Continuum. Annals of Pure and Applied Logic 164 (7-8):763-770.
    We extend the work of Fischer et al. [6] by presenting a method for controlling cardinal characteristics in the presence of a projective wellorder and 2ℵ0>ℵ2. This also answers a question of Harrington [9] by showing that the existence of a Δ31 wellorder of the reals is consistent with Martinʼs axiom and 2ℵ0=ℵ3.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  36.  20
    Sy-David Friedman & Tapani Hyttinen (2012). On Borel Equivalence Relations in Generalized Baire Space. Archive for Mathematical Logic 51 (3-4):299-304.
    We construct two Borel equivalence relations on the generalized Baire space κ κ , κ <κ = κ > ω, with the property that neither of them is Borel reducible to the other. A small modification of the construction shows that the straightforward generalization of the Glimm-Effros dichotomy fails.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  37.  8
    Sy D. Friedman (1994). Jensen's Σ* Theory and the Combinatorial Content of V = L. Journal of Symbolic Logic 59 (3):1096 - 1104.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  38.  11
    Vera Fischer, Sy David Friedman & Yurii Khomskii (2013). Co-Analytic Mad Families and Definable Wellorders. Archive for Mathematical Logic 52 (7-8):809-822.
    We show that the existence of a ${\Pi^1_1}$ -definable mad family is consistent with the existence of a ${\Delta^{1}_{3}}$ -definable well-order of the reals and ${\mathfrak{b}=\mathfrak{c}=\aleph_3}$.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  39.  9
    Sy D. Friedman (2003). Cardinal-Preserving Extensions. Journal of Symbolic Logic 68 (4):1163-1170.
    A classic result of Baumgartner-Harrington-Kleinberg [1] implies that assuming CH a stationary subset of ω1 has a CUB subset in a cardinal-perserving generic extension of V, via a forcing of cardinality ω1. Therefore, assuming that $\omega_2^L$ is countable: { $X \in L \mid X \subseteq \omega_1^L$ and X has a CUB subset in a cardinal -preserving extension of L} is constructible, as it equals the set of constructible subsets of $\omega_1^L$ which in L are stationary. Is there a similar such (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography  
  40.  7
    Sy D. Friedman (1979). HC of an Admissible Set. Journal of Symbolic Logic 44 (1):95-102.
    If A is an admissible set, let HC(A) = {x∣ x ∈ A and x is hereditarily countable in A}. Then HC(A) is admissible. Corollaries are drawn characterizing the "real parts" of admissible sets and the analytical consequences of admissible set theory.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  41.  2
    Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller & Neil Thapen (2016). Cobham Recursive Set Functions. Annals of Pure and Applied Logic 167 (3):335-369.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42.  11
    Sy-David Friedman & Radek Honzik (2012). Eastonʼs Theorem and Large Cardinals From the Optimal Hypothesis. Annals of Pure and Applied Logic 163 (12):1738-1747.
    The equiconsistency of a measurable cardinal with Mitchell order o=κ++ with a measurable cardinal such that 2κ=κ++ follows from the results by W. Mitchell [13] and M. Gitik [7]. These results were later generalized to measurable cardinals with 2κ larger than κ++ .In Friedman and Honzik [5], we formulated and proved Eastonʼs theorem [4] in a large cardinal setting, using slightly stronger hypotheses than the lower bounds identified by Mitchell and Gitik , for a suitable μ, instead of the cardinals (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  43.  13
    Sy D. Friedman & Peter Koepke (1997). An Elementary Approach to the Fine Structure of L. Bulletin of Symbolic Logic 3 (4):453-468.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  44.  4
    Sy D. Friedman (1982). Steel Forcing and Barwise Compactness. Annals of Mathematical Logic 22 (1):31-46.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  45.  5
    Natasha Dobrinen & Sy-David Friedman (2006). Co-Stationarity of the Ground Model. Journal of Symbolic Logic 71 (3):1029 - 1043.
    This paper investigates when it is possible for a partial ordering P to force Pκ(λ) \ V to be stationary in VP. It follows from a result of Gitik that whenever P adds a new real, then Pκ(λ) \ V is stationary in VP for each regular uncountable cardinal κ in VP and all cardinals λ > κ in VP [4]. However, a covering theorem of Magidor implies that when no new ω-sequences are added, large cardinals become necessary [7]. The (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  46.  19
    Sy D. Friedman (1989). Coding Over a Measurable Cardinal. Journal of Symbolic Logic 54 (4):1145-1159.
  47.  3
    Vera Fischer, Sy David Friedman & Yurii Khomskii (2014). Cichoń’s Diagram, Regularity Properties and $${\Varvec{\Delta}^1_3}$$ Δ 3 1 Sets of Reals. Archive for Mathematical Logic 53 (5-6):695-729.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48.  11
    Sy D. Friedman (1983). Some Recent Developments in Higher Recursion Theory. Journal of Symbolic Logic 48 (3):629-642.
    In recent years higher recursion theory has experienced a deep interaction with other areas of logic, particularly set theory (fine structure, forcing, and combinatorics) and infinitary model theory. In this paper we wish to illustrate this interaction by surveying the progress that has been made in two areas: the global theory of the κ-degrees and the study of closure ordinals.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  49.  3
    Sy-David Friedman & Liuzhen Wu (2015). Definable Normal Measures. Annals of Pure and Applied Logic 166 (1):46-60.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50.  3
    Sy-David Friedman & Radek Honzik (2015). The Tree Property at the ℵ 2 N 's and the Failure of SCH at ℵ Ω. Annals of Pure and Applied Logic 166 (4):526-552.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 100