According to our database
1,
Sy-David Friedman
authored at least 109 papers
between 1979 and 2024.
Collaborative distances:
2024
Mutually embeddable models of ZFC.
Ann. Pure Appl. Log., January, 2024
2023
Structural Properties of the stable Core.
J. Symb. Log., 2023
2022
Embeddings Into Outer Models.
J. Symb. Log., December, 2022
2021
Universism and Extensions of V.
Rev. Symb. Log., 2021
Generic coding with Help and Amalgamation Failure.
J. Symb. Log., 2021
2020
Maximality and ontology: how axiom content varies across philosophical frameworks.
Synth., 2020
2019
A ${\rm{\Sigma }}_4^1 $ WELLORDER OF THE REALS WITH ${\rm{NS}}_{\omega _1 } $ SATURATED.
J. Symb. Log., 2019
A model of second-order arithmetic satisfying AC but not DC.
J. Math. Log., 2019
Feasible set functions have small circuits.
Comput., 2019
2018
Coherent Systems of finite Support iterations.
J. Symb. Log., 2018
2017
Hyperclass forcing in Morse-Kelley class Theory.
J. Symb. Log., 2017
Cardinal characteristics at κ in a small u(κ) model.
Ann. Pure Appl. Log., 2017
A null ideal for inaccessibles.
Arch. Math. Log., 2017
2016
On strong forms of reflection in set theory.
Math. Log. Q., 2016
Definability of Satisfaction in outer Models.
J. Symb. Log., 2016
Evidence for Set-theoretic Truth and the Hyperuniverse Programme.
FLAP, 2016
Regularity properties on the generalized reals.
Ann. Pure Appl. Log., 2016
Cobham recursive set functions.
Ann. Pure Appl. Log., 2016
Fragments of Kripke-Platek set theory and the metamathematics of α-recursion theory.
Arch. Math. Log., 2016
2015
Multiverse conceptions in set theory.
Synth., 2015
Failures of the Silver Dichotomy in the generalized Baire Space.
J. Symb. Log., 2015
Large Cardinals and Lightface Definable Well-Orders, without the GCH.
J. Symb. Log., 2015
Safe Recursive Set Functions.
J. Symb. Log., 2015
Collapsing the cardinals of HOD.
J. Math. Log., 2015
Definable normal measures.
Ann. Pure Appl. Log., 2015
Large cardinals and definable well-orders, without the GCH.
Ann. Pure Appl. Log., 2015
The tree property at the א2n's and the failure of SCH at אω.
Ann. Pure Appl. Log., 2015
Large cardinals need not be large in HOD.
Ann. Pure Appl. Log., 2015
2014
Measure, category and projective wellorders.
J. Log. Anal., 2014
Cichoń's diagram, regularity properties and Δ<sup>1</sup><sub>3</sub> sets of reals.
Arch. Math. Log., 2014
Rank-into-rank hypotheses and the failure of GCH.
Arch. Math. Log., 2014
The completeness of isomorphism.
Proceedings of the Logic, Computation, Hierarchies, 2014
2013
The Nonabsoluteness of Model Existence in Uncountable Cardinals for L<sub>ω<sub>1</sub>,ω</sub>.
Notre Dame J. Formal Log., 2013
Classes of structures with universe a subset of <i>ω</i><sub>1</sub>.
J. Log. Comput., 2013
Killing the GCH everywhere with a single real.
J. Symb. Log., 2013
The hyperuniverse program.
Bull. Symb. Log., 2013
Ann. Pure Appl. Log., 2013
Fusion and large cardinal preservation.
Ann. Pure Appl. Log., 2013
Cardinal characteristics, projective wellorders and large continuum.
Ann. Pure Appl. Log., 2013
Baumgartner's conjecture and bounded forcing axioms.
Ann. Pure Appl. Log., 2013
Co-analytic mad families and definable wellorders.
Arch. Math. Log., 2013
2012
On Σ<sup>1</sup><sub>1</sub> equivalence relations over the natural numbers.
Math. Log. Q., 2012
Isomorphism relations on computable structures.
J. Symb. Log., 2012
Definable well-orders of H(ω<sub>2</sub>) and GCH.
J. Symb. Log., 2012
Projective maximal families of orthogonal measures with large continuum.
J. Log. Anal., 2012
Easton's theorem and large cardinals from the optimal hypothesis.
Ann. Pure Appl. Log., 2012
Foundational implications of the Inner Model Hypothesis.
Ann. Pure Appl. Log., 2012
On Borel equivalence relations in generalized Baire space.
Arch. Math. Log., 2012
Independence of higher Kurepa hypotheses.
Arch. Math. Log., 2012
Equivalence Relations That Are Σ<sup>0</sup><sub>3</sub> Complete for Computable Reducibility - (Extended Abstract).
Proceedings of the Logic, Language, Information and Computation, 2012
2011
On Absoluteness of Categoricity in Abstract Elementary Classes.
Notre Dame J. Formal Log., 2011
Analytic equivalence relations and bi-embeddability.
J. Symb. Log., 2011
Potential isomorphism of elementary substructures of a strictly stable homogeneous model.
J. Symb. Log., 2011
The tree property at ℵ<sub>ω+2</sub>.
J. Symb. Log., 2011
BPFA and projective well-orderings of the reals.
J. Symb. Log., 2011
Strong isomorphism reductions in complexity theory.
J. Symb. Log., 2011
Projective wellorders and mad families with large continuum.
Ann. Pure Appl. Log., 2011
2010
Ann. Pure Appl. Log., 2010
The effective theory of Borel equivalence relations.
Ann. Pure Appl. Log., 2010
Cardinal characteristics and projective wellorders.
Ann. Pure Appl. Log., 2010
2009
An inner model for global domination.
J. Symb. Log., 2009
The number of normal measures.
J. Symb. Log., 2009
Large cardinals and gap-1 morasses.
Ann. Pure Appl. Log., 2009
Large cardinals and locally defined well-orders of the universe.
Ann. Pure Appl. Log., 2009
Equivalence Relations on Classes of Computable Structures.
Proceedings of the Mathematical Theory and Computational Practice, 2009
2008
On the consistency strength of the inner model hypothesis.
J. Symb. Log., 2008
Perfect trees and elementary embeddings.
J. Symb. Log., 2008
Internal consistency for embedding complexity.
J. Symb. Log., 2008
Internal consistency and global co-stationarity of the ground model.
J. Symb. Log., 2008
on the singular cardinals.
J. Symb. Log., 2008
The internal consistency of Easton's theorem.
Ann. Pure Appl. Log., 2008
Easton's theorem and large cardinals.
Ann. Pure Appl. Log., 2008
Homogeneous iteration and measure one covering relative to HOD.
Arch. Math. Log., 2008
2006
Hyperfine structure theory and gap 1 morasses.
J. Symb. Log., 2006
Co-stationarity of the ground model.
J. Symb. Log., 2006
Internal Consistency and the Inner Model Hypothesis.
Bull. Symb. Log., 2006
2005
Genericity and Large Cardinals.
J. Math. Log., 2005
2004
Generic Sigma<sup>1</sup><sub>3</sub> absoluteness.
J. Symb. Log., 2004
2003
Universally Baire sets and definable well-orderings of the reals.
J. Symb. Log., 2003
Classification theory and 0<sup>#</sup>.
J. Symb. Log., 2003
Cardinal-preserving extensions.
J. Symb. Log., 2003
2002
0<sup>#</sup> and Inner Models.
J. Symb. Log., 2002
2001
Ann. Pure Appl. Log., 2001
1999
Ordinal Recursion Theory.
Proceedings of the Handbook of Computability Theory, 1999
1998
1997
Coding without Fine Structure.
J. Symb. Log., 1997
An elementary approach to the fine structure of L.
Bull. Symb. Log., 1997
Delta<sub>1</sub>-Definability.
Ann. Pure Appl. Log., 1997
1994
Jensen's Sigma<sup>*</sup> Theory and the Combinatorial Content of V=L.
J. Symb. Log., 1994
The Genericity Conjecture.
J. Symb. Log., 1994
A Simpler proof of Jensen's Coding Theorem.
Ann. Pure Appl. Log., 1994
1989
Coding Over a Measurable Cardinal.
J. Symb. Log., 1989
Ann. Pure Appl. Log., 1989
1987
A guide to "strong coding".
Ann. Pure Appl. Log., 1987
Ann. Pure Appl. Log., 1987
1985
A Guide to "Coding the Universe" by Beller, Jensen, Welch.
J. Symb. Log., 1985
1984
Annual Meeting of the Association for Symbolic Logic: Boston 1983.
J. Symb. Log., 1984
Model theory for L<sub>∞<sub>ω</sub><sub>1</sub></sub>.
Ann. Pure Appl. Log., 1984
1983
Some Recent Developments in Higher Recursion Theory.
J. Symb. Log., 1983
Degree theory on aleph<sub>ω</sub>.
Ann. Pure Appl. Log., 1983
1982
Steel forcing and barwise compactness.
Ann. Math. Log., 1982
1981
Meeting of the Association for Symbolic Logic: New York 1979.
J. Symb. Log., 1981
1979
